/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-figure3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 01:57:40,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 01:57:40,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 01:57:40,197 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 01:57:40,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 01:57:40,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 01:57:40,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 01:57:40,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 01:57:40,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 01:57:40,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 01:57:40,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 01:57:40,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 01:57:40,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 01:57:40,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 01:57:40,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 01:57:40,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 01:57:40,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 01:57:40,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 01:57:40,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 01:57:40,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 01:57:40,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 01:57:40,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 01:57:40,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 01:57:40,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 01:57:40,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 01:57:40,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 01:57:40,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 01:57:40,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 01:57:40,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 01:57:40,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 01:57:40,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 01:57:40,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 01:57:40,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 01:57:40,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 01:57:40,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 01:57:40,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 01:57:40,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 01:57:40,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 01:57:40,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 01:57:40,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 01:57:40,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 01:57:40,240 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 01:57:40,264 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 01:57:40,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 01:57:40,266 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 01:57:40,266 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 01:57:40,266 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 01:57:40,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 01:57:40,267 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 01:57:40,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 01:57:40,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 01:57:40,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 01:57:40,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 01:57:40,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 01:57:40,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 01:57:40,268 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 01:57:40,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 01:57:40,268 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 01:57:40,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 01:57:40,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 01:57:40,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 01:57:40,269 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 01:57:40,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 01:57:40,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:57:40,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 01:57:40,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 01:57:40,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 01:57:40,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 01:57:40,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 01:57:40,269 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 01:57:40,270 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 01:57:40,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 01:57:40,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 01:57:40,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 01:57:40,601 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 01:57:40,601 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 01:57:40,602 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-figure3.wvr.c [2022-12-13 01:57:41,592 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 01:57:41,747 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 01:57:41,748 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure3.wvr.c [2022-12-13 01:57:41,753 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7468ce6d9/192e8656a5bf4de990003184ea552d08/FLAGb585a4ba1 [2022-12-13 01:57:41,768 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7468ce6d9/192e8656a5bf4de990003184ea552d08 [2022-12-13 01:57:41,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 01:57:41,771 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 01:57:41,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 01:57:41,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 01:57:41,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 01:57:41,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:57:41" (1/1) ... [2022-12-13 01:57:41,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60063044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:41, skipping insertion in model container [2022-12-13 01:57:41,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:57:41" (1/1) ... [2022-12-13 01:57:41,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 01:57:41,794 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 01:57:41,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:57:41,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:57:41,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:57:41,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:57:41,925 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/popl20-figure3.wvr.c[2121,2134] [2022-12-13 01:57:41,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:57:41,935 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 01:57:41,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:57:41,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:57:41,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:57:41,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:57:41,956 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/popl20-figure3.wvr.c[2121,2134] [2022-12-13 01:57:41,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:57:41,970 INFO L208 MainTranslator]: Completed translation [2022-12-13 01:57:41,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:41 WrapperNode [2022-12-13 01:57:41,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 01:57:41,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 01:57:41,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 01:57:41,972 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 01:57:41,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:41" (1/1) ... [2022-12-13 01:57:41,982 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:41" (1/1) ... [2022-12-13 01:57:41,999 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 72 [2022-12-13 01:57:42,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 01:57:42,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 01:57:42,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 01:57:42,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 01:57:42,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:41" (1/1) ... [2022-12-13 01:57:42,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:41" (1/1) ... [2022-12-13 01:57:42,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:41" (1/1) ... [2022-12-13 01:57:42,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:41" (1/1) ... [2022-12-13 01:57:42,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:41" (1/1) ... [2022-12-13 01:57:42,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:41" (1/1) ... [2022-12-13 01:57:42,029 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:41" (1/1) ... [2022-12-13 01:57:42,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:41" (1/1) ... [2022-12-13 01:57:42,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 01:57:42,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 01:57:42,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 01:57:42,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 01:57:42,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:41" (1/1) ... [2022-12-13 01:57:42,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:57:42,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:42,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 01:57:42,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 01:57:42,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 01:57:42,102 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 01:57:42,103 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 01:57:42,103 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 01:57:42,103 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 01:57:42,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 01:57:42,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 01:57:42,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 01:57:42,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 01:57:42,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 01:57:42,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 01:57:42,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 01:57:42,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 01:57:42,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 01:57:42,105 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 01:57:42,169 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 01:57:42,170 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 01:57:42,298 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 01:57:42,316 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 01:57:42,316 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 01:57:42,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:57:42 BoogieIcfgContainer [2022-12-13 01:57:42,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 01:57:42,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 01:57:42,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 01:57:42,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 01:57:42,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:57:41" (1/3) ... [2022-12-13 01:57:42,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24176a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:57:42, skipping insertion in model container [2022-12-13 01:57:42,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:57:41" (2/3) ... [2022-12-13 01:57:42,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24176a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:57:42, skipping insertion in model container [2022-12-13 01:57:42,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:57:42" (3/3) ... [2022-12-13 01:57:42,324 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-figure3.wvr.c [2022-12-13 01:57:42,335 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 01:57:42,335 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 01:57:42,335 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 01:57:42,427 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 01:57:42,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 80 transitions, 176 flow [2022-12-13 01:57:42,484 INFO L130 PetriNetUnfolder]: 6/78 cut-off events. [2022-12-13 01:57:42,484 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:57:42,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 78 events. 6/78 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2022-12-13 01:57:42,488 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 80 transitions, 176 flow [2022-12-13 01:57:42,503 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 70 transitions, 152 flow [2022-12-13 01:57:42,504 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:42,514 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 70 transitions, 152 flow [2022-12-13 01:57:42,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 70 transitions, 152 flow [2022-12-13 01:57:42,532 INFO L130 PetriNetUnfolder]: 6/70 cut-off events. [2022-12-13 01:57:42,532 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:57:42,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 70 events. 6/70 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2022-12-13 01:57:42,535 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 70 transitions, 152 flow [2022-12-13 01:57:42,535 INFO L226 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-13 01:57:44,210 INFO L241 LiptonReduction]: Total number of compositions: 55 [2022-12-13 01:57:44,220 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 01:57:44,236 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;@5c88a94f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 01:57:44,236 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 01:57:44,239 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-13 01:57:44,239 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:57:44,239 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:44,240 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:44,240 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:44,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:44,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1374975466, now seen corresponding path program 1 times [2022-12-13 01:57:44,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:44,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474859083] [2022-12-13 01:57:44,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:44,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:44,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:44,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474859083] [2022-12-13 01:57:44,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474859083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:44,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:44,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 01:57:44,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968038728] [2022-12-13 01:57:44,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:44,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:57:44,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:44,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:57:44,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:57:44,531 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 15 [2022-12-13 01:57:44,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-13 01:57:44,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:44,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 15 [2022-12-13 01:57:44,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:44,580 INFO L130 PetriNetUnfolder]: 49/94 cut-off events. [2022-12-13 01:57:44,580 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 01:57:44,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 94 events. 49/94 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 267 event pairs, 13 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 143. Up to 65 conditions per place. [2022-12-13 01:57:44,582 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 16 selfloop transitions, 2 changer transitions 4/24 dead transitions. [2022-12-13 01:57:44,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 24 transitions, 113 flow [2022-12-13 01:57:44,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:57:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:57:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-13 01:57:44,590 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 01:57:44,591 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 42 flow. Second operand 3 states and 30 transitions. [2022-12-13 01:57:44,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 24 transitions, 113 flow [2022-12-13 01:57:44,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 24 transitions, 99 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:44,596 INFO L231 Difference]: Finished difference. Result has 19 places, 16 transitions, 48 flow [2022-12-13 01:57:44,598 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=19, PETRI_TRANSITIONS=16} [2022-12-13 01:57:44,611 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2022-12-13 01:57:44,612 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:44,612 INFO L89 Accepts]: Start accepts. Operand has 19 places, 16 transitions, 48 flow [2022-12-13 01:57:44,614 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:44,615 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:44,615 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 16 transitions, 48 flow [2022-12-13 01:57:44,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 16 transitions, 48 flow [2022-12-13 01:57:44,626 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-13 01:57:44,626 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:57:44,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 24 events. 4/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 22. Up to 7 conditions per place. [2022-12-13 01:57:44,629 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 16 transitions, 48 flow [2022-12-13 01:57:44,629 INFO L226 LiptonReduction]: Number of co-enabled transitions 60 [2022-12-13 01:57:44,629 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:44,630 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 01:57:44,630 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 16 transitions, 48 flow [2022-12-13 01:57:44,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-13 01:57:44,631 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:44,631 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:44,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 01:57:44,631 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:44,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:44,632 INFO L85 PathProgramCache]: Analyzing trace with hash -867956374, now seen corresponding path program 1 times [2022-12-13 01:57:44,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:44,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286337344] [2022-12-13 01:57:44,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:44,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:44,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:44,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286337344] [2022-12-13 01:57:44,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286337344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:44,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:44,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:57:44,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442857349] [2022-12-13 01:57:44,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:44,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:44,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:44,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:44,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:44,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 01:57:44,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 16 transitions, 48 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-13 01:57:44,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:44,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 01:57:44,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:44,841 INFO L130 PetriNetUnfolder]: 72/149 cut-off events. [2022-12-13 01:57:44,842 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-13 01:57:44,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 149 events. 72/149 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 467 event pairs, 24 based on Foata normal form. 6/155 useless extension candidates. Maximal degree in co-relation 177. Up to 78 conditions per place. [2022-12-13 01:57:44,844 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 28 selfloop transitions, 3 changer transitions 6/37 dead transitions. [2022-12-13 01:57:44,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 37 transitions, 178 flow [2022-12-13 01:57:44,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:44,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:44,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-13 01:57:44,846 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2022-12-13 01:57:44,846 INFO L175 Difference]: Start difference. First operand has 19 places, 16 transitions, 48 flow. Second operand 5 states and 37 transitions. [2022-12-13 01:57:44,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 37 transitions, 178 flow [2022-12-13 01:57:44,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 37 transitions, 175 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 01:57:44,848 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 74 flow [2022-12-13 01:57:44,848 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2022-12-13 01:57:44,848 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2022-12-13 01:57:44,848 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:44,849 INFO L89 Accepts]: Start accepts. Operand has 25 places, 18 transitions, 74 flow [2022-12-13 01:57:44,850 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:44,850 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:44,850 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 18 transitions, 74 flow [2022-12-13 01:57:44,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 18 transitions, 74 flow [2022-12-13 01:57:44,854 INFO L130 PetriNetUnfolder]: 3/27 cut-off events. [2022-12-13 01:57:44,854 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:57:44,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 27 events. 3/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 45 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 34. Up to 8 conditions per place. [2022-12-13 01:57:44,854 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 18 transitions, 74 flow [2022-12-13 01:57:44,854 INFO L226 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-13 01:57:44,970 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:44,971 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:57:44,971 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 71 flow [2022-12-13 01:57:44,972 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-13 01:57:44,972 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:44,972 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:44,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 01:57:44,972 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:44,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:44,974 INFO L85 PathProgramCache]: Analyzing trace with hash 883944601, now seen corresponding path program 1 times [2022-12-13 01:57:44,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:44,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911951958] [2022-12-13 01:57:44,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:44,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:45,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:45,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911951958] [2022-12-13 01:57:45,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911951958] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:45,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524958129] [2022-12-13 01:57:45,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:45,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:45,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:45,109 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:57:45,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 01:57:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:45,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:57:45,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:45,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:45,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:45,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524958129] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:45,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 01:57:45,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2022-12-13 01:57:45,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534129264] [2022-12-13 01:57:45,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:45,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:57:45,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:45,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:57:45,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:57:45,285 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-13 01:57:45,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 71 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-13 01:57:45,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:45,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-13 01:57:45,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:45,331 INFO L130 PetriNetUnfolder]: 42/87 cut-off events. [2022-12-13 01:57:45,331 INFO L131 PetriNetUnfolder]: For 143/145 co-relation queries the response was YES. [2022-12-13 01:57:45,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 87 events. 42/87 cut-off events. For 143/145 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 214 event pairs, 18 based on Foata normal form. 6/89 useless extension candidates. Maximal degree in co-relation 96. Up to 56 conditions per place. [2022-12-13 01:57:45,332 INFO L137 encePairwiseOnDemand]: 14/16 looper letters, 17 selfloop transitions, 1 changer transitions 5/24 dead transitions. [2022-12-13 01:57:45,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 134 flow [2022-12-13 01:57:45,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:57:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:57:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-13 01:57:45,334 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-13 01:57:45,334 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 71 flow. Second operand 3 states and 27 transitions. [2022-12-13 01:57:45,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 134 flow [2022-12-13 01:57:45,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 119 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 01:57:45,335 INFO L231 Difference]: Finished difference. Result has 22 places, 16 transitions, 54 flow [2022-12-13 01:57:45,335 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=22, PETRI_TRANSITIONS=16} [2022-12-13 01:57:45,336 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 2 predicate places. [2022-12-13 01:57:45,336 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:45,336 INFO L89 Accepts]: Start accepts. Operand has 22 places, 16 transitions, 54 flow [2022-12-13 01:57:45,336 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:45,336 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:45,337 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 16 transitions, 54 flow [2022-12-13 01:57:45,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 16 transitions, 54 flow [2022-12-13 01:57:45,339 INFO L130 PetriNetUnfolder]: 3/20 cut-off events. [2022-12-13 01:57:45,339 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 01:57:45,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 20 events. 3/20 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 19. Up to 7 conditions per place. [2022-12-13 01:57:45,339 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 16 transitions, 54 flow [2022-12-13 01:57:45,339 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 01:57:45,340 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:45,340 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 01:57:45,340 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 16 transitions, 54 flow [2022-12-13 01:57:45,340 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-13 01:57:45,340 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:45,341 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:45,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 01:57:45,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:45,542 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:45,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:45,543 INFO L85 PathProgramCache]: Analyzing trace with hash -745912205, now seen corresponding path program 1 times [2022-12-13 01:57:45,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:45,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613488345] [2022-12-13 01:57:45,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:45,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:45,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:45,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:45,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613488345] [2022-12-13 01:57:45,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613488345] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:45,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610153088] [2022-12-13 01:57:45,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:45,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:45,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:45,715 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:57:45,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 01:57:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:45,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 01:57:45,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:45,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:45,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:45,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610153088] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:45,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:45,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 5 [2022-12-13 01:57:45,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993388348] [2022-12-13 01:57:45,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:45,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:57:45,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:45,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:57:45,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:57:45,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-13 01:57:45,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 16 transitions, 54 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:45,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:45,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-13 01:57:45,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:46,011 INFO L130 PetriNetUnfolder]: 73/146 cut-off events. [2022-12-13 01:57:46,011 INFO L131 PetriNetUnfolder]: For 53/55 co-relation queries the response was YES. [2022-12-13 01:57:46,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 146 events. 73/146 cut-off events. For 53/55 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 425 event pairs, 19 based on Foata normal form. 7/151 useless extension candidates. Maximal degree in co-relation 179. Up to 61 conditions per place. [2022-12-13 01:57:46,012 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 26 selfloop transitions, 6 changer transitions 4/37 dead transitions. [2022-12-13 01:57:46,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 37 transitions, 184 flow [2022-12-13 01:57:46,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:57:46,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:57:46,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-13 01:57:46,013 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2022-12-13 01:57:46,013 INFO L175 Difference]: Start difference. First operand has 21 places, 16 transitions, 54 flow. Second operand 4 states and 41 transitions. [2022-12-13 01:57:46,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 37 transitions, 184 flow [2022-12-13 01:57:46,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 37 transitions, 175 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 01:57:46,014 INFO L231 Difference]: Finished difference. Result has 24 places, 20 transitions, 95 flow [2022-12-13 01:57:46,014 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=24, PETRI_TRANSITIONS=20} [2022-12-13 01:57:46,015 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 4 predicate places. [2022-12-13 01:57:46,015 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:46,015 INFO L89 Accepts]: Start accepts. Operand has 24 places, 20 transitions, 95 flow [2022-12-13 01:57:46,016 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:46,016 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:46,016 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 20 transitions, 95 flow [2022-12-13 01:57:46,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 95 flow [2022-12-13 01:57:46,019 INFO L130 PetriNetUnfolder]: 5/35 cut-off events. [2022-12-13 01:57:46,019 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 01:57:46,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 35 events. 5/35 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 55. Up to 11 conditions per place. [2022-12-13 01:57:46,019 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 20 transitions, 95 flow [2022-12-13 01:57:46,019 INFO L226 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-13 01:57:46,020 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:46,020 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 01:57:46,020 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 95 flow [2022-12-13 01:57:46,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:46,021 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:46,021 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:46,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 01:57:46,225 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,SelfDestructingSolverStorable3 [2022-12-13 01:57:46,225 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:46,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:46,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1954653069, now seen corresponding path program 2 times [2022-12-13 01:57:46,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:46,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270163061] [2022-12-13 01:57:46,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:46,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:46,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:46,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:46,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270163061] [2022-12-13 01:57:46,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270163061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:46,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:46,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:57:46,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743448777] [2022-12-13 01:57:46,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:46,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:46,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:46,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:46,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:46,318 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 01:57:46,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:46,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:46,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 01:57:46,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:46,409 INFO L130 PetriNetUnfolder]: 112/229 cut-off events. [2022-12-13 01:57:46,409 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-12-13 01:57:46,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 229 events. 112/229 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 823 event pairs, 7 based on Foata normal form. 6/235 useless extension candidates. Maximal degree in co-relation 323. Up to 81 conditions per place. [2022-12-13 01:57:46,410 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 35 selfloop transitions, 10 changer transitions 9/54 dead transitions. [2022-12-13 01:57:46,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 54 transitions, 340 flow [2022-12-13 01:57:46,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:57:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:57:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-12-13 01:57:46,412 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-13 01:57:46,412 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 95 flow. Second operand 7 states and 45 transitions. [2022-12-13 01:57:46,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 54 transitions, 340 flow [2022-12-13 01:57:46,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 54 transitions, 324 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-12-13 01:57:46,413 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 171 flow [2022-12-13 01:57:46,414 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=171, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2022-12-13 01:57:46,414 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 12 predicate places. [2022-12-13 01:57:46,414 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:46,414 INFO L89 Accepts]: Start accepts. Operand has 32 places, 27 transitions, 171 flow [2022-12-13 01:57:46,415 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:46,415 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:46,415 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 27 transitions, 171 flow [2022-12-13 01:57:46,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 27 transitions, 171 flow [2022-12-13 01:57:46,420 INFO L130 PetriNetUnfolder]: 12/66 cut-off events. [2022-12-13 01:57:46,420 INFO L131 PetriNetUnfolder]: For 41/43 co-relation queries the response was YES. [2022-12-13 01:57:46,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 66 events. 12/66 cut-off events. For 41/43 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 236 event pairs, 0 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 150. Up to 16 conditions per place. [2022-12-13 01:57:46,420 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 27 transitions, 171 flow [2022-12-13 01:57:46,420 INFO L226 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-13 01:57:46,427 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:46,427 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 01:57:46,427 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 160 flow [2022-12-13 01:57:46,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:46,428 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:46,428 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:46,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 01:57:46,428 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:46,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:46,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1515525847, now seen corresponding path program 3 times [2022-12-13 01:57:46,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:46,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894070186] [2022-12-13 01:57:46,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:46,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:46,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:46,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:46,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894070186] [2022-12-13 01:57:46,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894070186] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:46,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89689103] [2022-12-13 01:57:46,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 01:57:46,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:46,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:46,491 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:57:46,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 01:57:46,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 01:57:46,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:57:46,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 01:57:46,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:46,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:46,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:46,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89689103] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:46,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:46,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 9 [2022-12-13 01:57:46,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050351253] [2022-12-13 01:57:46,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:46,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:57:46,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:46,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:57:46,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:57:46,626 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 01:57:46,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 160 flow. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:46,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:46,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 01:57:46,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:46,790 INFO L130 PetriNetUnfolder]: 143/303 cut-off events. [2022-12-13 01:57:46,790 INFO L131 PetriNetUnfolder]: For 437/437 co-relation queries the response was YES. [2022-12-13 01:57:46,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 303 events. 143/303 cut-off events. For 437/437 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1230 event pairs, 16 based on Foata normal form. 12/315 useless extension candidates. Maximal degree in co-relation 529. Up to 139 conditions per place. [2022-12-13 01:57:46,792 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 47 selfloop transitions, 12 changer transitions 16/75 dead transitions. [2022-12-13 01:57:46,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 75 transitions, 542 flow [2022-12-13 01:57:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:57:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:57:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-12-13 01:57:46,794 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2022-12-13 01:57:46,794 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 160 flow. Second operand 8 states and 58 transitions. [2022-12-13 01:57:46,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 75 transitions, 542 flow [2022-12-13 01:57:46,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 75 transitions, 533 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 01:57:46,799 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 278 flow [2022-12-13 01:57:46,799 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=278, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2022-12-13 01:57:46,801 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 20 predicate places. [2022-12-13 01:57:46,801 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:46,801 INFO L89 Accepts]: Start accepts. Operand has 40 places, 34 transitions, 278 flow [2022-12-13 01:57:46,804 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:46,804 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:46,804 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 34 transitions, 278 flow [2022-12-13 01:57:46,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 34 transitions, 278 flow [2022-12-13 01:57:46,811 INFO L130 PetriNetUnfolder]: 15/99 cut-off events. [2022-12-13 01:57:46,811 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2022-12-13 01:57:46,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 99 events. 15/99 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 478 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 269. Up to 23 conditions per place. [2022-12-13 01:57:46,812 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 34 transitions, 278 flow [2022-12-13 01:57:46,812 INFO L226 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-13 01:57:46,852 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:46,939 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [297] L41-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_55 4294967296))) (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_46|) |v_thread2Thread1of1ForFork1_~i~1#1_45|) (= (ite (< 0 (mod (+ v_~c~0_68 v_~counter~0_108) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_26|) (= v_~counter~0_108 v_~counter~0_110) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_26| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_26|) (= v_thread1Thread1of1ForFork0_~i~0_43 (+ v_thread1Thread1of1ForFork0_~i~0_44 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_26| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_46| 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_44 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_110, ~c~0=v_~c~0_68, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_44, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_46|, ~N~0=v_~N~0_55} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_26|, ~counter~0=v_~counter~0_108, ~c~0=v_~c~0_68, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_34|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_43, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_34|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_26|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_45|, ~N~0=v_~N~0_55} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:46,940 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:46,940 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:47,065 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:47,066 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:47,224 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 01:57:47,225 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 424 [2022-12-13 01:57:47,225 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 296 flow [2022-12-13 01:57:47,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:47,225 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:47,225 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:47,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 01:57:47,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:47,426 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:47,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:47,426 INFO L85 PathProgramCache]: Analyzing trace with hash 376578346, now seen corresponding path program 1 times [2022-12-13 01:57:47,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:47,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768731302] [2022-12-13 01:57:47,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:47,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:47,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:47,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768731302] [2022-12-13 01:57:47,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768731302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:47,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:47,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:57:47,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977397111] [2022-12-13 01:57:47,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:47,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:47,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:47,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:47,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:47,495 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 01:57:47,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 296 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-13 01:57:47,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:47,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 01:57:47,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:47,571 INFO L130 PetriNetUnfolder]: 124/270 cut-off events. [2022-12-13 01:57:47,571 INFO L131 PetriNetUnfolder]: For 732/732 co-relation queries the response was YES. [2022-12-13 01:57:47,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 270 events. 124/270 cut-off events. For 732/732 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1099 event pairs, 28 based on Foata normal form. 12/282 useless extension candidates. Maximal degree in co-relation 594. Up to 200 conditions per place. [2022-12-13 01:57:47,573 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 27 selfloop transitions, 10 changer transitions 11/48 dead transitions. [2022-12-13 01:57:47,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 466 flow [2022-12-13 01:57:47,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-13 01:57:47,573 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 01:57:47,573 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 296 flow. Second operand 5 states and 36 transitions. [2022-12-13 01:57:47,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 466 flow [2022-12-13 01:57:47,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 441 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-13 01:57:47,576 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 296 flow [2022-12-13 01:57:47,576 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2022-12-13 01:57:47,576 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 23 predicate places. [2022-12-13 01:57:47,576 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:47,576 INFO L89 Accepts]: Start accepts. Operand has 43 places, 31 transitions, 296 flow [2022-12-13 01:57:47,577 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:47,577 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:47,577 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 296 flow [2022-12-13 01:57:47,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 296 flow [2022-12-13 01:57:47,582 INFO L130 PetriNetUnfolder]: 13/64 cut-off events. [2022-12-13 01:57:47,582 INFO L131 PetriNetUnfolder]: For 260/293 co-relation queries the response was YES. [2022-12-13 01:57:47,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 64 events. 13/64 cut-off events. For 260/293 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 205 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 210. Up to 21 conditions per place. [2022-12-13 01:57:47,582 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 296 flow [2022-12-13 01:57:47,582 INFO L226 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-13 01:57:47,583 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:47,583 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:47,684 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:47,684 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 01:57:47,684 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 303 flow [2022-12-13 01:57:47,685 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-13 01:57:47,685 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:47,685 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:47,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 01:57:47,685 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:47,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:47,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1634612875, now seen corresponding path program 1 times [2022-12-13 01:57:47,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:47,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823044479] [2022-12-13 01:57:47,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:47,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:47,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:47,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823044479] [2022-12-13 01:57:47,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823044479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:47,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:47,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:47,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719889919] [2022-12-13 01:57:47,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:47,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:47,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:47,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:47,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:47,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 01:57:47,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 303 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:47,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:47,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 01:57:47,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:47,810 INFO L130 PetriNetUnfolder]: 105/217 cut-off events. [2022-12-13 01:57:47,811 INFO L131 PetriNetUnfolder]: For 739/739 co-relation queries the response was YES. [2022-12-13 01:57:47,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 217 events. 105/217 cut-off events. For 739/739 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 746 event pairs, 30 based on Foata normal form. 7/222 useless extension candidates. Maximal degree in co-relation 591. Up to 176 conditions per place. [2022-12-13 01:57:47,812 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 32 selfloop transitions, 7 changer transitions 7/46 dead transitions. [2022-12-13 01:57:47,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 451 flow [2022-12-13 01:57:47,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:57:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:57:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-13 01:57:47,812 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2022-12-13 01:57:47,813 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 303 flow. Second operand 4 states and 37 transitions. [2022-12-13 01:57:47,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 451 flow [2022-12-13 01:57:47,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 374 flow, removed 28 selfloop flow, removed 5 redundant places. [2022-12-13 01:57:47,815 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 264 flow [2022-12-13 01:57:47,815 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=36, 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=264, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2022-12-13 01:57:47,816 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 20 predicate places. [2022-12-13 01:57:47,816 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:47,816 INFO L89 Accepts]: Start accepts. Operand has 40 places, 32 transitions, 264 flow [2022-12-13 01:57:47,816 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:47,816 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:47,816 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 32 transitions, 264 flow [2022-12-13 01:57:47,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 32 transitions, 264 flow [2022-12-13 01:57:47,821 INFO L130 PetriNetUnfolder]: 12/62 cut-off events. [2022-12-13 01:57:47,821 INFO L131 PetriNetUnfolder]: For 157/167 co-relation queries the response was YES. [2022-12-13 01:57:47,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 62 events. 12/62 cut-off events. For 157/167 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 202 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 173. Up to 14 conditions per place. [2022-12-13 01:57:47,822 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 32 transitions, 264 flow [2022-12-13 01:57:47,822 INFO L226 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-13 01:57:47,865 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [302] $Ultimate##0-->L41-4: Formula: (and (= v_~counter~0_126 (+ v_~counter~0_127 (* v_~c~0_74 2))) (= 2 v_thread1Thread1of1ForFork0_~i~0_51) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_51) 4294967296) (mod v_~N~0_61 4294967296))) InVars {~counter~0=v_~counter~0_127, ~c~0=v_~c~0_74, ~N~0=v_~N~0_61} OutVars{~counter~0=v_~counter~0_126, ~c~0=v_~c~0_74, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_38|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_51, ~N~0=v_~N~0_61} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [301] $Ultimate##0-->L51-4: Formula: (and (not (= (ite (< 0 (mod v_~counter~0_122 4294967296)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_32| 0)) (= v_~counter~0_122 (+ v_~counter~0_120 (* v_~c~0_72 2))) (= (ite (< 0 (mod (+ v_~c~0_72 v_~counter~0_120) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_32|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_53|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_32| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_32|) (< 1 (mod v_~N~0_59 4294967296))) InVars {~counter~0=v_~counter~0_122, ~c~0=v_~c~0_72, ~N~0=v_~N~0_59} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_32|, ~counter~0=v_~counter~0_120, ~c~0=v_~c~0_72, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_40|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_32|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_53|, ~N~0=v_~N~0_59} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:47,972 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [302] $Ultimate##0-->L41-4: Formula: (and (= v_~counter~0_126 (+ v_~counter~0_127 (* v_~c~0_74 2))) (= 2 v_thread1Thread1of1ForFork0_~i~0_51) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_51) 4294967296) (mod v_~N~0_61 4294967296))) InVars {~counter~0=v_~counter~0_127, ~c~0=v_~c~0_74, ~N~0=v_~N~0_61} OutVars{~counter~0=v_~counter~0_126, ~c~0=v_~c~0_74, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_38|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_51, ~N~0=v_~N~0_61} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [299] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_57 4294967296)) (.cse1 (+ v_~c~0_70 v_~counter~0_114))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_28| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_28|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_49|) (< (mod v_thread1Thread1of1ForFork0_~i~0_48 4294967296) .cse0) (< 1 .cse0) (= (ite (< 0 (mod .cse1 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_28|) (= v_~counter~0_116 .cse1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_28| 0)) (= v_thread1Thread1of1ForFork0_~i~0_47 (+ v_thread1Thread1of1ForFork0_~i~0_48 1)))) InVars {~counter~0=v_~counter~0_116, ~c~0=v_~c~0_70, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_48, ~N~0=v_~N~0_57} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_28|, ~counter~0=v_~counter~0_114, ~c~0=v_~c~0_70, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_36|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_47, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_36|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_28|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_49|, ~N~0=v_~N~0_57} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:48,061 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:48,061 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 245 [2022-12-13 01:57:48,061 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 273 flow [2022-12-13 01:57:48,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:48,062 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:48,062 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:48,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 01:57:48,062 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:48,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:48,062 INFO L85 PathProgramCache]: Analyzing trace with hash 744504984, now seen corresponding path program 1 times [2022-12-13 01:57:48,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:48,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169949673] [2022-12-13 01:57:48,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:48,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:48,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:48,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169949673] [2022-12-13 01:57:48,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169949673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:48,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:48,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:48,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841974504] [2022-12-13 01:57:48,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:48,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:57:48,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:48,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:57:48,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:57:48,109 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 01:57:48,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 273 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:48,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:48,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 01:57:48,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:48,153 INFO L130 PetriNetUnfolder]: 113/231 cut-off events. [2022-12-13 01:57:48,153 INFO L131 PetriNetUnfolder]: For 675/675 co-relation queries the response was YES. [2022-12-13 01:57:48,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 231 events. 113/231 cut-off events. For 675/675 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 782 event pairs, 69 based on Foata normal form. 6/231 useless extension candidates. Maximal degree in co-relation 808. Up to 222 conditions per place. [2022-12-13 01:57:48,154 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 35 selfloop transitions, 2 changer transitions 1/38 dead transitions. [2022-12-13 01:57:48,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 388 flow [2022-12-13 01:57:48,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:57:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:57:48,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-13 01:57:48,155 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-13 01:57:48,155 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 273 flow. Second operand 3 states and 27 transitions. [2022-12-13 01:57:48,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 388 flow [2022-12-13 01:57:48,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 361 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 01:57:48,157 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 259 flow [2022-12-13 01:57:48,157 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=259, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2022-12-13 01:57:48,157 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 21 predicate places. [2022-12-13 01:57:48,157 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:48,158 INFO L89 Accepts]: Start accepts. Operand has 41 places, 32 transitions, 259 flow [2022-12-13 01:57:48,158 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:48,158 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:48,158 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 32 transitions, 259 flow [2022-12-13 01:57:48,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 32 transitions, 259 flow [2022-12-13 01:57:48,163 INFO L130 PetriNetUnfolder]: 13/63 cut-off events. [2022-12-13 01:57:48,163 INFO L131 PetriNetUnfolder]: For 119/126 co-relation queries the response was YES. [2022-12-13 01:57:48,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 63 events. 13/63 cut-off events. For 119/126 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 197 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 185. Up to 18 conditions per place. [2022-12-13 01:57:48,163 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 32 transitions, 259 flow [2022-12-13 01:57:48,163 INFO L226 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-13 01:57:48,164 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:48,164 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 01:57:48,164 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 259 flow [2022-12-13 01:57:48,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:48,164 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:48,164 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:48,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 01:57:48,165 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:48,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:48,165 INFO L85 PathProgramCache]: Analyzing trace with hash 243496335, now seen corresponding path program 1 times [2022-12-13 01:57:48,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:48,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409439380] [2022-12-13 01:57:48,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:48,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:48,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:48,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409439380] [2022-12-13 01:57:48,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409439380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:48,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:48,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:57:48,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598064423] [2022-12-13 01:57:48,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:48,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:57:48,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:48,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:57:48,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:57:48,202 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 01:57:48,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 259 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:48,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:48,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 01:57:48,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:48,254 INFO L130 PetriNetUnfolder]: 131/259 cut-off events. [2022-12-13 01:57:48,254 INFO L131 PetriNetUnfolder]: For 896/896 co-relation queries the response was YES. [2022-12-13 01:57:48,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 259 events. 131/259 cut-off events. For 896/896 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 924 event pairs, 61 based on Foata normal form. 6/265 useless extension candidates. Maximal degree in co-relation 912. Up to 168 conditions per place. [2022-12-13 01:57:48,256 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 44 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2022-12-13 01:57:48,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 49 transitions, 453 flow [2022-12-13 01:57:48,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:57:48,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:57:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-13 01:57:48,256 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 01:57:48,256 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 259 flow. Second operand 4 states and 38 transitions. [2022-12-13 01:57:48,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 49 transitions, 453 flow [2022-12-13 01:57:48,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 441 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-13 01:57:48,259 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 279 flow [2022-12-13 01:57:48,259 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-12-13 01:57:48,259 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 23 predicate places. [2022-12-13 01:57:48,259 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:48,259 INFO L89 Accepts]: Start accepts. Operand has 43 places, 33 transitions, 279 flow [2022-12-13 01:57:48,260 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:48,260 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:48,260 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 279 flow [2022-12-13 01:57:48,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 33 transitions, 279 flow [2022-12-13 01:57:48,265 INFO L130 PetriNetUnfolder]: 17/78 cut-off events. [2022-12-13 01:57:48,265 INFO L131 PetriNetUnfolder]: For 195/205 co-relation queries the response was YES. [2022-12-13 01:57:48,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 78 events. 17/78 cut-off events. For 195/205 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 285 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 228. Up to 24 conditions per place. [2022-12-13 01:57:48,265 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 33 transitions, 279 flow [2022-12-13 01:57:48,265 INFO L226 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-13 01:57:48,271 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [305] $Ultimate##0-->L51-4: Formula: (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_57|) 4294967296) (mod v_~N~0_65 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_36| 0)) (not (= (ite (< 0 (mod v_~counter~0_136 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_36| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_36|) (= (+ v_~counter~0_134 (* v_~c~0_78 2)) v_~counter~0_136) (= (ite (< 0 (mod (+ v_~c~0_78 v_~counter~0_134) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_36|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_57|)) InVars {~counter~0=v_~counter~0_136, ~c~0=v_~c~0_78, ~N~0=v_~N~0_65} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_36|, ~counter~0=v_~counter~0_134, ~c~0=v_~c~0_78, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_44|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_36|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_57|, ~N~0=v_~N~0_65} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:48,271 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:48,271 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:48,371 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:48,372 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-13 01:57:48,372 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 278 flow [2022-12-13 01:57:48,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:48,372 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:48,372 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:48,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 01:57:48,372 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:48,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:48,372 INFO L85 PathProgramCache]: Analyzing trace with hash -337889893, now seen corresponding path program 1 times [2022-12-13 01:57:48,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:48,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240575106] [2022-12-13 01:57:48,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:48,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:48,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:48,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:48,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240575106] [2022-12-13 01:57:48,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240575106] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:48,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848598727] [2022-12-13 01:57:48,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:48,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:48,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:48,442 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:57:48,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 01:57:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:48,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 01:57:48,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:48,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:48,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:48,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848598727] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:48,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:48,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 5 [2022-12-13 01:57:48,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564907314] [2022-12-13 01:57:48,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:48,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:57:48,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:48,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:57:48,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:57:48,537 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 01:57:48,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 278 flow. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:48,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:48,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 01:57:48,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:48,630 INFO L130 PetriNetUnfolder]: 201/403 cut-off events. [2022-12-13 01:57:48,630 INFO L131 PetriNetUnfolder]: For 1768/1768 co-relation queries the response was YES. [2022-12-13 01:57:48,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1856 conditions, 403 events. 201/403 cut-off events. For 1768/1768 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1800 event pairs, 41 based on Foata normal form. 14/417 useless extension candidates. Maximal degree in co-relation 962. Up to 166 conditions per place. [2022-12-13 01:57:48,632 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 31 selfloop transitions, 17 changer transitions 5/53 dead transitions. [2022-12-13 01:57:48,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 479 flow [2022-12-13 01:57:48,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:57:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:57:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-13 01:57:48,633 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-13 01:57:48,633 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 278 flow. Second operand 4 states and 42 transitions. [2022-12-13 01:57:48,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 479 flow [2022-12-13 01:57:48,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 460 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-13 01:57:48,636 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 353 flow [2022-12-13 01:57:48,636 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=353, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2022-12-13 01:57:48,637 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 26 predicate places. [2022-12-13 01:57:48,637 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:48,637 INFO L89 Accepts]: Start accepts. Operand has 46 places, 35 transitions, 353 flow [2022-12-13 01:57:48,637 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:48,637 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:48,637 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 35 transitions, 353 flow [2022-12-13 01:57:48,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 353 flow [2022-12-13 01:57:48,646 INFO L130 PetriNetUnfolder]: 24/112 cut-off events. [2022-12-13 01:57:48,646 INFO L131 PetriNetUnfolder]: For 388/397 co-relation queries the response was YES. [2022-12-13 01:57:48,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 112 events. 24/112 cut-off events. For 388/397 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 521 event pairs, 2 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 381. Up to 36 conditions per place. [2022-12-13 01:57:48,647 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 35 transitions, 353 flow [2022-12-13 01:57:48,647 INFO L226 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-13 01:57:48,647 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:48,648 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:48,774 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:48,775 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:57:48,775 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 364 flow [2022-12-13 01:57:48,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:48,775 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:48,776 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:48,791 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-13 01:57:48,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:48,976 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:48,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:48,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1563129131, now seen corresponding path program 1 times [2022-12-13 01:57:48,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:48,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6203465] [2022-12-13 01:57:48,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:48,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:49,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:49,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:49,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6203465] [2022-12-13 01:57:49,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6203465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:49,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:49,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:57:49,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749010800] [2022-12-13 01:57:49,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:49,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:57:49,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:49,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:57:49,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:57:49,027 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 01:57:49,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:49,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:49,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 01:57:49,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:49,092 INFO L130 PetriNetUnfolder]: 191/387 cut-off events. [2022-12-13 01:57:49,092 INFO L131 PetriNetUnfolder]: For 1997/1997 co-relation queries the response was YES. [2022-12-13 01:57:49,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1902 conditions, 387 events. 191/387 cut-off events. For 1997/1997 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1678 event pairs, 117 based on Foata normal form. 2/387 useless extension candidates. Maximal degree in co-relation 857. Up to 367 conditions per place. [2022-12-13 01:57:49,093 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 34 selfloop transitions, 2 changer transitions 8/44 dead transitions. [2022-12-13 01:57:49,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 488 flow [2022-12-13 01:57:49,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:57:49,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:57:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-12-13 01:57:49,094 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39473684210526316 [2022-12-13 01:57:49,094 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 364 flow. Second operand 4 states and 30 transitions. [2022-12-13 01:57:49,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 488 flow [2022-12-13 01:57:49,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 44 transitions, 444 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-13 01:57:49,097 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 330 flow [2022-12-13 01:57:49,097 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=330, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2022-12-13 01:57:49,097 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 28 predicate places. [2022-12-13 01:57:49,098 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:49,098 INFO L89 Accepts]: Start accepts. Operand has 48 places, 35 transitions, 330 flow [2022-12-13 01:57:49,098 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:49,098 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:49,098 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 35 transitions, 330 flow [2022-12-13 01:57:49,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 35 transitions, 330 flow [2022-12-13 01:57:49,106 INFO L130 PetriNetUnfolder]: 33/139 cut-off events. [2022-12-13 01:57:49,106 INFO L131 PetriNetUnfolder]: For 362/368 co-relation queries the response was YES. [2022-12-13 01:57:49,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 139 events. 33/139 cut-off events. For 362/368 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 676 event pairs, 13 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 437. Up to 43 conditions per place. [2022-12-13 01:57:49,107 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 35 transitions, 330 flow [2022-12-13 01:57:49,107 INFO L226 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-13 01:57:49,109 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [307] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod (+ v_~c~0_82 v_~counter~0_146) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_40|) (= v_~counter~0_148 v_~counter~0_146) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_40| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_40|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_61|) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_63) 4294967296) (mod v_~N~0_69 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_40| 0)) (= 2 v_thread1Thread1of1ForFork0_~i~0_63) (not (= (ite (< 0 (mod (+ v_~counter~0_146 (* v_~c~0_82 2)) 4294967296)) 1 0) 0))) InVars {~counter~0=v_~counter~0_148, ~c~0=v_~c~0_82, ~N~0=v_~N~0_69} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_40|, ~counter~0=v_~counter~0_146, ~c~0=v_~c~0_82, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_46|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_63, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_48|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_40|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_61|, ~N~0=v_~N~0_69} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:57:49,242 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:57:49,243 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 01:57:49,243 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 329 flow [2022-12-13 01:57:49,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:49,243 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:49,243 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:49,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 01:57:49,243 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:49,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:49,243 INFO L85 PathProgramCache]: Analyzing trace with hash -957947211, now seen corresponding path program 1 times [2022-12-13 01:57:49,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:49,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849892256] [2022-12-13 01:57:49,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:49,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:49,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:49,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849892256] [2022-12-13 01:57:49,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849892256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:49,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:49,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:57:49,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198576725] [2022-12-13 01:57:49,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:49,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:57:49,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:49,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:57:49,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:57:49,294 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 01:57:49,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 329 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:49,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:49,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 01:57:49,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:49,362 INFO L130 PetriNetUnfolder]: 199/394 cut-off events. [2022-12-13 01:57:49,362 INFO L131 PetriNetUnfolder]: For 1873/1873 co-relation queries the response was YES. [2022-12-13 01:57:49,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1936 conditions, 394 events. 199/394 cut-off events. For 1873/1873 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1669 event pairs, 109 based on Foata normal form. 12/406 useless extension candidates. Maximal degree in co-relation 1347. Up to 359 conditions per place. [2022-12-13 01:57:49,364 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 37 selfloop transitions, 6 changer transitions 3/46 dead transitions. [2022-12-13 01:57:49,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 46 transitions, 496 flow [2022-12-13 01:57:49,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:57:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:57:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-13 01:57:49,365 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-13 01:57:49,365 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 329 flow. Second operand 4 states and 34 transitions. [2022-12-13 01:57:49,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 46 transitions, 496 flow [2022-12-13 01:57:49,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 468 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-13 01:57:49,367 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 367 flow [2022-12-13 01:57:49,367 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=367, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2022-12-13 01:57:49,368 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 28 predicate places. [2022-12-13 01:57:49,368 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:49,368 INFO L89 Accepts]: Start accepts. Operand has 48 places, 37 transitions, 367 flow [2022-12-13 01:57:49,368 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:49,369 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:49,369 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 37 transitions, 367 flow [2022-12-13 01:57:49,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 37 transitions, 367 flow [2022-12-13 01:57:49,377 INFO L130 PetriNetUnfolder]: 35/147 cut-off events. [2022-12-13 01:57:49,377 INFO L131 PetriNetUnfolder]: For 494/499 co-relation queries the response was YES. [2022-12-13 01:57:49,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 147 events. 35/147 cut-off events. For 494/499 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 748 event pairs, 13 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 505. Up to 43 conditions per place. [2022-12-13 01:57:49,378 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 37 transitions, 367 flow [2022-12-13 01:57:49,378 INFO L226 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-13 01:57:49,379 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:49,379 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 01:57:49,379 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 367 flow [2022-12-13 01:57:49,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:49,379 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:49,379 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:49,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 01:57:49,380 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:49,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:49,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1984554546, now seen corresponding path program 1 times [2022-12-13 01:57:49,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:49,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569745489] [2022-12-13 01:57:49,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:49,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:49,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:49,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569745489] [2022-12-13 01:57:49,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569745489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:49,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:49,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:57:49,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206174006] [2022-12-13 01:57:49,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:49,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:57:49,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:49,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:57:49,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:57:49,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 01:57:49,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 367 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:49,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:49,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 01:57:49,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:49,531 INFO L130 PetriNetUnfolder]: 243/498 cut-off events. [2022-12-13 01:57:49,531 INFO L131 PetriNetUnfolder]: For 3152/3152 co-relation queries the response was YES. [2022-12-13 01:57:49,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2633 conditions, 498 events. 243/498 cut-off events. For 3152/3152 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2402 event pairs, 123 based on Foata normal form. 6/504 useless extension candidates. Maximal degree in co-relation 1466. Up to 349 conditions per place. [2022-12-13 01:57:49,533 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 45 selfloop transitions, 10 changer transitions 2/57 dead transitions. [2022-12-13 01:57:49,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 676 flow [2022-12-13 01:57:49,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:57:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:57:49,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-13 01:57:49,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-13 01:57:49,534 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 367 flow. Second operand 4 states and 34 transitions. [2022-12-13 01:57:49,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 57 transitions, 676 flow [2022-12-13 01:57:49,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 57 transitions, 628 flow, removed 20 selfloop flow, removed 1 redundant places. [2022-12-13 01:57:49,537 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 453 flow [2022-12-13 01:57:49,538 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=453, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2022-12-13 01:57:49,538 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 32 predicate places. [2022-12-13 01:57:49,538 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:49,538 INFO L89 Accepts]: Start accepts. Operand has 52 places, 43 transitions, 453 flow [2022-12-13 01:57:49,539 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:49,539 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:49,539 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 43 transitions, 453 flow [2022-12-13 01:57:49,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 43 transitions, 453 flow [2022-12-13 01:57:49,549 INFO L130 PetriNetUnfolder]: 49/186 cut-off events. [2022-12-13 01:57:49,550 INFO L131 PetriNetUnfolder]: For 1068/1077 co-relation queries the response was YES. [2022-12-13 01:57:49,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 186 events. 49/186 cut-off events. For 1068/1077 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1005 event pairs, 12 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 781. Up to 78 conditions per place. [2022-12-13 01:57:49,551 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 43 transitions, 453 flow [2022-12-13 01:57:49,551 INFO L226 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-13 01:57:49,551 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:57:49,552 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 01:57:49,552 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 453 flow [2022-12-13 01:57:49,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:49,552 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:49,552 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:49,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 01:57:49,552 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:49,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:49,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1069079464, now seen corresponding path program 2 times [2022-12-13 01:57:49,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:49,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762458311] [2022-12-13 01:57:49,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:49,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:49,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:49,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762458311] [2022-12-13 01:57:49,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762458311] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:49,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412112319] [2022-12-13 01:57:49,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 01:57:49,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:49,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:49,603 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:57:49,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 01:57:49,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 01:57:49,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:57:49,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:57:49,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:49,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:49,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412112319] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:49,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:49,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 01:57:49,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276662524] [2022-12-13 01:57:49,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:49,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:57:49,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:49,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:57:49,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:57:49,707 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 01:57:49,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 453 flow. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:49,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:49,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 01:57:49,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:49,829 INFO L130 PetriNetUnfolder]: 233/482 cut-off events. [2022-12-13 01:57:49,829 INFO L131 PetriNetUnfolder]: For 4194/4194 co-relation queries the response was YES. [2022-12-13 01:57:49,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2766 conditions, 482 events. 233/482 cut-off events. For 4194/4194 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2297 event pairs, 121 based on Foata normal form. 12/494 useless extension candidates. Maximal degree in co-relation 1376. Up to 408 conditions per place. [2022-12-13 01:57:49,831 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 43 selfloop transitions, 12 changer transitions 8/63 dead transitions. [2022-12-13 01:57:49,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 738 flow [2022-12-13 01:57:49,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:49,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:49,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-13 01:57:49,832 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 01:57:49,832 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 453 flow. Second operand 5 states and 40 transitions. [2022-12-13 01:57:49,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 738 flow [2022-12-13 01:57:49,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 700 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-13 01:57:49,837 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 481 flow [2022-12-13 01:57:49,837 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=481, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2022-12-13 01:57:49,837 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 36 predicate places. [2022-12-13 01:57:49,837 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:49,837 INFO L89 Accepts]: Start accepts. Operand has 56 places, 44 transitions, 481 flow [2022-12-13 01:57:49,838 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:49,838 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:49,838 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 44 transitions, 481 flow [2022-12-13 01:57:49,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 44 transitions, 481 flow [2022-12-13 01:57:49,848 INFO L130 PetriNetUnfolder]: 45/175 cut-off events. [2022-12-13 01:57:49,848 INFO L131 PetriNetUnfolder]: For 1131/1136 co-relation queries the response was YES. [2022-12-13 01:57:49,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 175 events. 45/175 cut-off events. For 1131/1136 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 924 event pairs, 12 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 728. Up to 71 conditions per place. [2022-12-13 01:57:49,849 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 44 transitions, 481 flow [2022-12-13 01:57:49,849 INFO L226 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-13 01:57:49,850 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:49,909 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [312] $Ultimate##0-->L51-4: Formula: (and (< 2 (mod v_~N~0_75 4294967296)) (= v_thread1Thread1of1ForFork0_~i~0_71 3) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_51| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_74|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_51| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (= (ite (< 0 (mod (+ v_~c~0_88 v_~counter~0_168) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (= v_~counter~0_168 v_~counter~0_170) (not (= (ite (< 0 (mod (+ v_~counter~0_168 (* v_~c~0_88 2)) 4294967296)) 1 0) 0))) InVars {~counter~0=v_~counter~0_170, ~c~0=v_~c~0_88, ~N~0=v_~N~0_75} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_51|, ~counter~0=v_~counter~0_168, ~c~0=v_~c~0_88, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_54|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_71, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_59|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_74|, ~N~0=v_~N~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:57:50,012 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [312] $Ultimate##0-->L51-4: Formula: (and (< 2 (mod v_~N~0_75 4294967296)) (= v_thread1Thread1of1ForFork0_~i~0_71 3) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_51| 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_74|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_51| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (= (ite (< 0 (mod (+ v_~c~0_88 v_~counter~0_168) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (= v_~counter~0_168 v_~counter~0_170) (not (= (ite (< 0 (mod (+ v_~counter~0_168 (* v_~c~0_88 2)) 4294967296)) 1 0) 0))) InVars {~counter~0=v_~counter~0_170, ~c~0=v_~c~0_88, ~N~0=v_~N~0_75} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_51|, ~counter~0=v_~counter~0_168, ~c~0=v_~c~0_88, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_54|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_71, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_59|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_74|, ~N~0=v_~N~0_75} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [315] L41-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_81 4294967296))) (and (< (mod v_thread1Thread1of1ForFork0_~i~0_86 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_58| 0)) (= v_thread1Thread1of1ForFork0_~i~0_85 (+ v_thread1Thread1of1ForFork0_~i~0_86 1)) (= (ite (< 0 (mod (+ v_~c~0_94 v_~counter~0_188) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|) (= v_~counter~0_188 v_~counter~0_190) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_58| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_82| 4294967296) .cse0) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_82|) |v_thread2Thread1of1ForFork1_~i~1#1_81|))) InVars {~counter~0=v_~counter~0_190, ~c~0=v_~c~0_94, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_86, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_82|, ~N~0=v_~N~0_81} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_58|, ~counter~0=v_~counter~0_188, ~c~0=v_~c~0_94, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_66|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_85, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_66|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_58|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_81|, ~N~0=v_~N~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:50,012 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:50,012 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:50,160 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:57:50,161 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 324 [2022-12-13 01:57:50,161 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 493 flow [2022-12-13 01:57:50,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:50,161 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:50,161 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:50,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 01:57:50,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 01:57:50,362 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:50,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:50,362 INFO L85 PathProgramCache]: Analyzing trace with hash -510407338, now seen corresponding path program 1 times [2022-12-13 01:57:50,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:50,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648233404] [2022-12-13 01:57:50,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:50,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:50,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:50,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:50,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648233404] [2022-12-13 01:57:50,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648233404] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:50,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373333813] [2022-12-13 01:57:50,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:50,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:50,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:50,461 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:57:50,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 01:57:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:50,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 01:57:50,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:50,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:50,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373333813] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:50,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:50,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 01:57:50,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330622318] [2022-12-13 01:57:50,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:50,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:57:50,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:50,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:57:50,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:57:50,626 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 01:57:50,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 493 flow. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:50,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:50,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 01:57:50,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:50,873 INFO L130 PetriNetUnfolder]: 252/509 cut-off events. [2022-12-13 01:57:50,873 INFO L131 PetriNetUnfolder]: For 5328/5328 co-relation queries the response was YES. [2022-12-13 01:57:50,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3047 conditions, 509 events. 252/509 cut-off events. For 5328/5328 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2413 event pairs, 117 based on Foata normal form. 30/539 useless extension candidates. Maximal degree in co-relation 1852. Up to 405 conditions per place. [2022-12-13 01:57:50,877 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 56 selfloop transitions, 18 changer transitions 4/78 dead transitions. [2022-12-13 01:57:50,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 883 flow [2022-12-13 01:57:50,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:57:50,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:57:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-12-13 01:57:50,878 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3439153439153439 [2022-12-13 01:57:50,878 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 493 flow. Second operand 9 states and 65 transitions. [2022-12-13 01:57:50,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 883 flow [2022-12-13 01:57:50,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 78 transitions, 796 flow, removed 33 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:50,887 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 588 flow [2022-12-13 01:57:50,887 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=588, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2022-12-13 01:57:50,888 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 43 predicate places. [2022-12-13 01:57:50,888 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:50,888 INFO L89 Accepts]: Start accepts. Operand has 63 places, 50 transitions, 588 flow [2022-12-13 01:57:50,888 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:50,889 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:50,889 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 50 transitions, 588 flow [2022-12-13 01:57:50,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 50 transitions, 588 flow [2022-12-13 01:57:50,901 INFO L130 PetriNetUnfolder]: 51/190 cut-off events. [2022-12-13 01:57:50,901 INFO L131 PetriNetUnfolder]: For 1884/1889 co-relation queries the response was YES. [2022-12-13 01:57:50,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 190 events. 51/190 cut-off events. For 1884/1889 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1040 event pairs, 13 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 938. Up to 80 conditions per place. [2022-12-13 01:57:50,903 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 50 transitions, 588 flow [2022-12-13 01:57:50,903 INFO L226 LiptonReduction]: Number of co-enabled transitions 150 [2022-12-13 01:57:50,912 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] L41-4-->thread1EXIT: Formula: (and (not (< (mod v_thread1Thread1of1ForFork0_~i~0_In_1 4294967296) (mod v_~N~0_In_3 4294967296))) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:50,996 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:50,997 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-13 01:57:50,997 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 584 flow [2022-12-13 01:57:50,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:50,997 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:50,997 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:51,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 01:57:51,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 01:57:51,198 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:51,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:51,198 INFO L85 PathProgramCache]: Analyzing trace with hash 797847954, now seen corresponding path program 1 times [2022-12-13 01:57:51,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:51,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290705531] [2022-12-13 01:57:51,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:51,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:51,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:51,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290705531] [2022-12-13 01:57:51,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290705531] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:51,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585628393] [2022-12-13 01:57:51,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:51,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:51,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:51,265 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:57:51,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 01:57:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:51,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:57:51,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:51,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:51,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:51,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:51,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585628393] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:51,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:51,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-12-13 01:57:51,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853296561] [2022-12-13 01:57:51,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:51,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:57:51,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:51,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:57:51,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:57:51,356 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 01:57:51,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 584 flow. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-13 01:57:51,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:51,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 01:57:51,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:51,476 INFO L130 PetriNetUnfolder]: 285/589 cut-off events. [2022-12-13 01:57:51,476 INFO L131 PetriNetUnfolder]: For 8754/8754 co-relation queries the response was YES. [2022-12-13 01:57:51,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3868 conditions, 589 events. 285/589 cut-off events. For 8754/8754 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3004 event pairs, 133 based on Foata normal form. 12/601 useless extension candidates. Maximal degree in co-relation 2238. Up to 461 conditions per place. [2022-12-13 01:57:51,480 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 57 selfloop transitions, 16 changer transitions 4/77 dead transitions. [2022-12-13 01:57:51,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 77 transitions, 960 flow [2022-12-13 01:57:51,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:57:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:57:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-13 01:57:51,480 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2022-12-13 01:57:51,480 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 584 flow. Second operand 6 states and 51 transitions. [2022-12-13 01:57:51,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 77 transitions, 960 flow [2022-12-13 01:57:51,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 860 flow, removed 44 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:51,499 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 609 flow [2022-12-13 01:57:51,499 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=609, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2022-12-13 01:57:51,500 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 45 predicate places. [2022-12-13 01:57:51,500 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:51,500 INFO L89 Accepts]: Start accepts. Operand has 65 places, 53 transitions, 609 flow [2022-12-13 01:57:51,500 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:51,500 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:51,500 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 53 transitions, 609 flow [2022-12-13 01:57:51,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 53 transitions, 609 flow [2022-12-13 01:57:51,517 INFO L130 PetriNetUnfolder]: 57/228 cut-off events. [2022-12-13 01:57:51,517 INFO L131 PetriNetUnfolder]: For 2351/2356 co-relation queries the response was YES. [2022-12-13 01:57:51,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 228 events. 57/228 cut-off events. For 2351/2356 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1377 event pairs, 14 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 1038. Up to 84 conditions per place. [2022-12-13 01:57:51,518 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 53 transitions, 609 flow [2022-12-13 01:57:51,518 INFO L226 LiptonReduction]: Number of co-enabled transitions 164 [2022-12-13 01:57:51,523 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:51,523 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:51,683 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:51,683 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-13 01:57:51,683 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 614 flow [2022-12-13 01:57:51,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-13 01:57:51,683 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:51,684 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:51,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 01:57:51,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:51,884 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:51,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:51,884 INFO L85 PathProgramCache]: Analyzing trace with hash -117627128, now seen corresponding path program 2 times [2022-12-13 01:57:51,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:51,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980306823] [2022-12-13 01:57:51,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:51,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:51,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:51,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980306823] [2022-12-13 01:57:51,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980306823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:51,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:51,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:57:51,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444112354] [2022-12-13 01:57:51,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:51,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:57:51,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:51,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:57:51,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:57:51,954 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 01:57:51,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 614 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:51,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:51,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 01:57:51,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:52,047 INFO L130 PetriNetUnfolder]: 277/565 cut-off events. [2022-12-13 01:57:52,047 INFO L131 PetriNetUnfolder]: For 7912/7912 co-relation queries the response was YES. [2022-12-13 01:57:52,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3602 conditions, 565 events. 277/565 cut-off events. For 7912/7912 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2802 event pairs, 155 based on Foata normal form. 2/567 useless extension candidates. Maximal degree in co-relation 2579. Up to 545 conditions per place. [2022-12-13 01:57:52,050 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 52 selfloop transitions, 2 changer transitions 8/62 dead transitions. [2022-12-13 01:57:52,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 62 transitions, 814 flow [2022-12-13 01:57:52,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:57:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:57:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-13 01:57:52,052 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3695652173913043 [2022-12-13 01:57:52,052 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 614 flow. Second operand 4 states and 34 transitions. [2022-12-13 01:57:52,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 62 transitions, 814 flow [2022-12-13 01:57:52,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 62 transitions, 754 flow, removed 25 selfloop flow, removed 1 redundant places. [2022-12-13 01:57:52,060 INFO L231 Difference]: Finished difference. Result has 68 places, 53 transitions, 564 flow [2022-12-13 01:57:52,060 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=564, PETRI_PLACES=68, PETRI_TRANSITIONS=53} [2022-12-13 01:57:52,060 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 48 predicate places. [2022-12-13 01:57:52,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:52,060 INFO L89 Accepts]: Start accepts. Operand has 68 places, 53 transitions, 564 flow [2022-12-13 01:57:52,061 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:52,061 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:52,061 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 53 transitions, 564 flow [2022-12-13 01:57:52,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 53 transitions, 564 flow [2022-12-13 01:57:52,075 INFO L130 PetriNetUnfolder]: 55/208 cut-off events. [2022-12-13 01:57:52,075 INFO L131 PetriNetUnfolder]: For 2306/2315 co-relation queries the response was YES. [2022-12-13 01:57:52,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1099 conditions, 208 events. 55/208 cut-off events. For 2306/2315 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1191 event pairs, 12 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 987. Up to 77 conditions per place. [2022-12-13 01:57:52,076 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 53 transitions, 564 flow [2022-12-13 01:57:52,076 INFO L226 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-13 01:57:52,080 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [318] $Ultimate##0-->L51-4: Formula: (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_87|) 4294967296) (mod v_~N~0_85 4294967296)) (not (= (ite (< 0 (mod (+ v_~counter~0_202 (* v_~c~0_98 2)) 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_93 4) (= (ite (< 0 (mod (+ v_~c~0_98 v_~counter~0_200) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|) (= 4 |v_thread2Thread1of1ForFork1_~i~1#1_87|) (= v_~counter~0_202 v_~counter~0_200) (not (= (ite (< 0 (mod (+ v_~c~0_98 v_~counter~0_202) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_62| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|)) InVars {~counter~0=v_~counter~0_202, ~c~0=v_~c~0_98, ~N~0=v_~N~0_85} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_62|, ~counter~0=v_~counter~0_200, ~c~0=v_~c~0_98, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_72|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_93, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_70|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_62|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_87|, ~N~0=v_~N~0_85} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:57:52,241 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:52,241 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 181 [2022-12-13 01:57:52,241 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 558 flow [2022-12-13 01:57:52,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:52,242 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:52,242 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:52,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 01:57:52,242 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:52,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:52,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1070284112, now seen corresponding path program 2 times [2022-12-13 01:57:52,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:52,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167990094] [2022-12-13 01:57:52,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:52,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:52,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:52,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:52,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167990094] [2022-12-13 01:57:52,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167990094] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:52,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407777058] [2022-12-13 01:57:52,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 01:57:52,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:52,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:52,380 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:57:52,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 01:57:52,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 01:57:52,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:57:52,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 01:57:52,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:52,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:52,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407777058] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:52,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:52,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 01:57:52,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462848172] [2022-12-13 01:57:52,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:52,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:57:52,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:52,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:57:52,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:57:52,499 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 01:57:52,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 52 transitions, 558 flow. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:52,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:52,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 01:57:52,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:52,872 INFO L130 PetriNetUnfolder]: 368/765 cut-off events. [2022-12-13 01:57:52,872 INFO L131 PetriNetUnfolder]: For 10982/10982 co-relation queries the response was YES. [2022-12-13 01:57:52,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5089 conditions, 765 events. 368/765 cut-off events. For 10982/10982 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4224 event pairs, 45 based on Foata normal form. 18/783 useless extension candidates. Maximal degree in co-relation 3721. Up to 325 conditions per place. [2022-12-13 01:57:52,877 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 65 selfloop transitions, 41 changer transitions 17/123 dead transitions. [2022-12-13 01:57:52,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 123 transitions, 1475 flow [2022-12-13 01:57:52,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 01:57:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 01:57:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 91 transitions. [2022-12-13 01:57:52,878 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2826086956521739 [2022-12-13 01:57:52,878 INFO L175 Difference]: Start difference. First operand has 65 places, 52 transitions, 558 flow. Second operand 14 states and 91 transitions. [2022-12-13 01:57:52,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 123 transitions, 1475 flow [2022-12-13 01:57:52,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 123 transitions, 1463 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 01:57:52,889 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 1061 flow [2022-12-13 01:57:52,889 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1061, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2022-12-13 01:57:52,889 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 62 predicate places. [2022-12-13 01:57:52,890 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:52,890 INFO L89 Accepts]: Start accepts. Operand has 82 places, 76 transitions, 1061 flow [2022-12-13 01:57:52,890 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:52,890 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:52,890 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 76 transitions, 1061 flow [2022-12-13 01:57:52,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 76 transitions, 1061 flow [2022-12-13 01:57:52,909 INFO L130 PetriNetUnfolder]: 67/262 cut-off events. [2022-12-13 01:57:52,909 INFO L131 PetriNetUnfolder]: For 4346/4353 co-relation queries the response was YES. [2022-12-13 01:57:52,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1764 conditions, 262 events. 67/262 cut-off events. For 4346/4353 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1628 event pairs, 6 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 1624. Up to 105 conditions per place. [2022-12-13 01:57:52,911 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 76 transitions, 1061 flow [2022-12-13 01:57:52,911 INFO L226 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-13 01:57:52,912 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [322] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (+ v_~counter~0_223 v_~c~0_104))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|) (< 4 (mod v_~N~0_91 4294967296)) (= 5 v_thread1Thread1of1ForFork0_~i~0_105) (not (= (ite (< 0 (mod (+ v_~counter~0_223 (* 2 v_~c~0_104)) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_105| 4) (= v_~counter~0_221 .cse0) (not (= (ite (< 0 (mod .cse0 4294967296)) 1 0) 0)) (= (ite (< 0 (mod v_~counter~0_221 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|))) InVars {~counter~0=v_~counter~0_223, ~c~0=v_~c~0_104, ~N~0=v_~N~0_91} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_75|, ~counter~0=v_~counter~0_221, ~c~0=v_~c~0_104, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_80|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_105, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_83|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_75|, ~N~0=v_~N~0_91, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_105|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:52,912 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:52,912 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:53,068 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] L41-4-->thread1EXIT: Formula: (and (not (< (mod v_thread1Thread1of1ForFork0_~i~0_In_1 4294967296) (mod v_~N~0_In_3 4294967296))) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:53,147 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] L41-4-->thread1EXIT: Formula: (and (not (< (mod v_thread1Thread1of1ForFork0_~i~0_In_1 4294967296) (mod v_~N~0_In_3 4294967296))) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:53,229 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:57:53,280 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:57:53,281 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 391 [2022-12-13 01:57:53,281 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 1078 flow [2022-12-13 01:57:53,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:53,281 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:53,281 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:53,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 01:57:53,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:53,481 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:53,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:53,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1539170051, now seen corresponding path program 1 times [2022-12-13 01:57:53,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:53,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233441301] [2022-12-13 01:57:53,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:53,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:53,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:53,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233441301] [2022-12-13 01:57:53,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233441301] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:53,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259590530] [2022-12-13 01:57:53,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:53,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:53,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:53,549 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:57:53,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 01:57:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:53,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 01:57:53,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:53,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:53,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:53,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:53,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259590530] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:53,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:53,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 01:57:53,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517843376] [2022-12-13 01:57:53,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:53,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:57:53,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:53,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:57:53,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:57:53,667 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 01:57:53,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 1078 flow. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:53,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:53,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 01:57:53,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:53,991 INFO L130 PetriNetUnfolder]: 386/797 cut-off events. [2022-12-13 01:57:53,992 INFO L131 PetriNetUnfolder]: For 21574/21574 co-relation queries the response was YES. [2022-12-13 01:57:53,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6350 conditions, 797 events. 386/797 cut-off events. For 21574/21574 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4392 event pairs, 145 based on Foata normal form. 44/841 useless extension candidates. Maximal degree in co-relation 4885. Up to 607 conditions per place. [2022-12-13 01:57:53,998 INFO L137 encePairwiseOnDemand]: 15/27 looper letters, 73 selfloop transitions, 47 changer transitions 6/126 dead transitions. [2022-12-13 01:57:53,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 126 transitions, 1986 flow [2022-12-13 01:57:53,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:57:53,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:57:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-12-13 01:57:54,000 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29218106995884774 [2022-12-13 01:57:54,000 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 1078 flow. Second operand 9 states and 71 transitions. [2022-12-13 01:57:54,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 126 transitions, 1986 flow [2022-12-13 01:57:54,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 126 transitions, 1643 flow, removed 167 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:54,032 INFO L231 Difference]: Finished difference. Result has 88 places, 93 transitions, 1386 flow [2022-12-13 01:57:54,032 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1386, PETRI_PLACES=88, PETRI_TRANSITIONS=93} [2022-12-13 01:57:54,032 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 68 predicate places. [2022-12-13 01:57:54,032 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:54,032 INFO L89 Accepts]: Start accepts. Operand has 88 places, 93 transitions, 1386 flow [2022-12-13 01:57:54,033 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:54,033 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:54,033 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 93 transitions, 1386 flow [2022-12-13 01:57:54,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 93 transitions, 1386 flow [2022-12-13 01:57:54,064 INFO L130 PetriNetUnfolder]: 78/298 cut-off events. [2022-12-13 01:57:54,065 INFO L131 PetriNetUnfolder]: For 5657/5662 co-relation queries the response was YES. [2022-12-13 01:57:54,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1960 conditions, 298 events. 78/298 cut-off events. For 5657/5662 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1912 event pairs, 6 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 1802. Up to 107 conditions per place. [2022-12-13 01:57:54,069 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 93 transitions, 1386 flow [2022-12-13 01:57:54,069 INFO L226 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-13 01:57:54,201 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:54,202 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-13 01:57:54,202 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 92 transitions, 1378 flow [2022-12-13 01:57:54,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:54,202 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:54,202 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:54,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 01:57:54,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:54,403 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:54,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:54,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1816649414, now seen corresponding path program 1 times [2022-12-13 01:57:54,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:54,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529445910] [2022-12-13 01:57:54,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:54,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:54,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:54,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:54,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529445910] [2022-12-13 01:57:54,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529445910] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:54,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411009691] [2022-12-13 01:57:54,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:54,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:54,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:54,468 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:57:54,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 01:57:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:54,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:57:54,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:54,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:54,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:54,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411009691] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:54,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:54,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-13 01:57:54,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059752888] [2022-12-13 01:57:54,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:54,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:57:54,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:54,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:57:54,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:57:54,586 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 01:57:54,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 92 transitions, 1378 flow. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:54,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:54,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 01:57:54,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:54,774 INFO L130 PetriNetUnfolder]: 408/840 cut-off events. [2022-12-13 01:57:54,774 INFO L131 PetriNetUnfolder]: For 23719/23719 co-relation queries the response was YES. [2022-12-13 01:57:54,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6667 conditions, 840 events. 408/840 cut-off events. For 23719/23719 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4693 event pairs, 172 based on Foata normal form. 12/852 useless extension candidates. Maximal degree in co-relation 5244. Up to 698 conditions per place. [2022-12-13 01:57:54,780 INFO L137 encePairwiseOnDemand]: 14/27 looper letters, 90 selfloop transitions, 28 changer transitions 8/126 dead transitions. [2022-12-13 01:57:54,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 126 transitions, 1982 flow [2022-12-13 01:57:54,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:57:54,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:57:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-12-13 01:57:54,781 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31746031746031744 [2022-12-13 01:57:54,781 INFO L175 Difference]: Start difference. First operand has 86 places, 92 transitions, 1378 flow. Second operand 7 states and 60 transitions. [2022-12-13 01:57:54,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 126 transitions, 1982 flow [2022-12-13 01:57:54,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 126 transitions, 1749 flow, removed 108 selfloop flow, removed 3 redundant places. [2022-12-13 01:57:54,817 INFO L231 Difference]: Finished difference. Result has 92 places, 97 transitions, 1334 flow [2022-12-13 01:57:54,817 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1334, PETRI_PLACES=92, PETRI_TRANSITIONS=97} [2022-12-13 01:57:54,818 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 72 predicate places. [2022-12-13 01:57:54,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:54,818 INFO L89 Accepts]: Start accepts. Operand has 92 places, 97 transitions, 1334 flow [2022-12-13 01:57:54,819 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:54,819 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:54,819 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 97 transitions, 1334 flow [2022-12-13 01:57:54,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 97 transitions, 1334 flow [2022-12-13 01:57:54,842 INFO L130 PetriNetUnfolder]: 82/317 cut-off events. [2022-12-13 01:57:54,843 INFO L131 PetriNetUnfolder]: For 5214/5219 co-relation queries the response was YES. [2022-12-13 01:57:54,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1954 conditions, 317 events. 82/317 cut-off events. For 5214/5219 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2102 event pairs, 6 based on Foata normal form. 0/312 useless extension candidates. Maximal degree in co-relation 1786. Up to 107 conditions per place. [2022-12-13 01:57:54,846 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 97 transitions, 1334 flow [2022-12-13 01:57:54,846 INFO L226 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-13 01:57:54,853 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:54,854 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:55,146 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:55,146 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:55,419 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:55,480 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [324] $Ultimate##0-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_79| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|) (not (= (ite (< 0 (mod (+ v_~counter~0_232 (* 2 v_~c~0_106)) 4294967296)) 1 0) 0)) (= (ite (< 0 (mod (+ v_~counter~0_230 v_~c~0_106) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|) (= v_~counter~0_232 v_~counter~0_230) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_110|) (< 4 (mod v_~N~0_93 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_79| 0)) (= 5 v_thread1Thread1of1ForFork0_~i~0_111)) InVars {~counter~0=v_~counter~0_232, ~c~0=v_~c~0_106, ~N~0=v_~N~0_93} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_79|, ~counter~0=v_~counter~0_230, ~c~0=v_~c~0_106, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_86|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_111, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_87|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_110|, ~N~0=v_~N~0_93} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [333] L41-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_107 4294967296))) (and (= |v_thread2Thread1of1ForFork1_~i~1#1_144| (+ |v_thread2Thread1of1ForFork1_~i~1#1_145| 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_102| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_102|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_145| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_102| (ite (< 0 (mod (+ v_~counter~0_273 v_~c~0_120) 4294967296)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_102| 0)) (= v_thread1Thread1of1ForFork0_~i~0_133 (+ v_thread1Thread1of1ForFork0_~i~0_134 1)) (= v_~counter~0_275 v_~counter~0_273) (< (mod v_thread1Thread1of1ForFork0_~i~0_134 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_275, ~c~0=v_~c~0_120, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_134, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_145|, ~N~0=v_~N~0_107} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_102|, ~counter~0=v_~counter~0_273, ~c~0=v_~c~0_120, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_98|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_133, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_110|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_102|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_144|, ~N~0=v_~N~0_107} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:55,481 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:55,481 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:55,661 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [324] $Ultimate##0-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_79| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|) (not (= (ite (< 0 (mod (+ v_~counter~0_232 (* 2 v_~c~0_106)) 4294967296)) 1 0) 0)) (= (ite (< 0 (mod (+ v_~counter~0_230 v_~c~0_106) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|) (= v_~counter~0_232 v_~counter~0_230) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_110|) (< 4 (mod v_~N~0_93 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_79| 0)) (= 5 v_thread1Thread1of1ForFork0_~i~0_111)) InVars {~counter~0=v_~counter~0_232, ~c~0=v_~c~0_106, ~N~0=v_~N~0_93} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_79|, ~counter~0=v_~counter~0_230, ~c~0=v_~c~0_106, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_86|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_111, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_87|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_110|, ~N~0=v_~N~0_93} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:57:55,792 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:57:55,792 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 974 [2022-12-13 01:57:55,792 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 95 transitions, 1348 flow [2022-12-13 01:57:55,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:55,792 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:55,793 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:55,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 01:57:55,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 01:57:55,993 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:55,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:55,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1734477096, now seen corresponding path program 1 times [2022-12-13 01:57:55,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:55,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590083767] [2022-12-13 01:57:55,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:55,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:56,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:56,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590083767] [2022-12-13 01:57:56,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590083767] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:56,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096659969] [2022-12-13 01:57:56,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:56,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:56,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:56,109 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:57:56,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 01:57:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:56,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 01:57:56,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:56,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:56,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:56,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096659969] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:56,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:56,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-12-13 01:57:56,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495788939] [2022-12-13 01:57:56,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:56,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:57:56,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:56,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:57:56,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:57:56,236 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 01:57:56,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 95 transitions, 1348 flow. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 8 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-13 01:57:56,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:56,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 01:57:56,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:56,583 INFO L130 PetriNetUnfolder]: 694/1436 cut-off events. [2022-12-13 01:57:56,583 INFO L131 PetriNetUnfolder]: For 31362/31362 co-relation queries the response was YES. [2022-12-13 01:57:56,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10631 conditions, 1436 events. 694/1436 cut-off events. For 31362/31362 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 9222 event pairs, 135 based on Foata normal form. 51/1487 useless extension candidates. Maximal degree in co-relation 9915. Up to 613 conditions per place. [2022-12-13 01:57:56,601 INFO L137 encePairwiseOnDemand]: 11/30 looper letters, 104 selfloop transitions, 52 changer transitions 28/184 dead transitions. [2022-12-13 01:57:56,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 184 transitions, 2834 flow [2022-12-13 01:57:56,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:56,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:56,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-13 01:57:56,602 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4533333333333333 [2022-12-13 01:57:56,602 INFO L175 Difference]: Start difference. First operand has 91 places, 95 transitions, 1348 flow. Second operand 5 states and 68 transitions. [2022-12-13 01:57:56,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 184 transitions, 2834 flow [2022-12-13 01:57:56,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 184 transitions, 2677 flow, removed 50 selfloop flow, removed 3 redundant places. [2022-12-13 01:57:56,731 INFO L231 Difference]: Finished difference. Result has 95 places, 124 transitions, 1931 flow [2022-12-13 01:57:56,732 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1931, PETRI_PLACES=95, PETRI_TRANSITIONS=124} [2022-12-13 01:57:56,732 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 75 predicate places. [2022-12-13 01:57:56,733 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:56,733 INFO L89 Accepts]: Start accepts. Operand has 95 places, 124 transitions, 1931 flow [2022-12-13 01:57:56,734 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:56,735 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:56,735 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 124 transitions, 1931 flow [2022-12-13 01:57:56,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 124 transitions, 1931 flow [2022-12-13 01:57:56,770 INFO L130 PetriNetUnfolder]: 128/493 cut-off events. [2022-12-13 01:57:56,770 INFO L131 PetriNetUnfolder]: For 8301/8308 co-relation queries the response was YES. [2022-12-13 01:57:56,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3303 conditions, 493 events. 128/493 cut-off events. For 8301/8308 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3739 event pairs, 15 based on Foata normal form. 0/486 useless extension candidates. Maximal degree in co-relation 3149. Up to 165 conditions per place. [2022-12-13 01:57:56,774 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 124 transitions, 1931 flow [2022-12-13 01:57:56,774 INFO L226 LiptonReduction]: Number of co-enabled transitions 352 [2022-12-13 01:57:56,775 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:56,853 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [328] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (+ v_~counter~0_255 (* 2 v_~c~0_114)))) (and (= (ite (< 0 (mod (+ v_~counter~0_253 (* 4294967295 v_~c~0_114)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_91|) (= v_~counter~0_253 .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_91| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_91|) (= |v_thread2Thread1of1ForFork1_~i~1#1_129| 4) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_123) 4294967296) (mod v_~N~0_101 4294967296)) (= 6 v_thread1Thread1of1ForFork0_~i~0_123) (not (= 0 (ite (< 0 (mod (+ v_~counter~0_255 v_~c~0_114) 4294967296)) 1 0))) (not (= (ite (< 0 (mod .cse0 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_255, ~c~0=v_~c~0_114, ~N~0=v_~N~0_101} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_91|, ~counter~0=v_~counter~0_253, ~c~0=v_~c~0_114, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_92|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_123, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_99|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_91|, ~N~0=v_~N~0_101, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:56,853 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:56,853 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:57,056 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:57,132 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:57,182 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [308] $Ultimate##0-->L51-4: Formula: (and (= v_~counter~0_152 (+ v_~c~0_84 v_~counter~0_154)) (< 2 (mod v_~N~0_71 4294967296)) (= v_thread1Thread1of1ForFork0_~i~0_65 3) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_42| (ite (< 0 (mod (+ v_~c~0_84 v_~counter~0_152) 4294967296)) 1 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_63|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_42| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_42| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_42|)) InVars {~counter~0=v_~counter~0_154, ~c~0=v_~c~0_84, ~N~0=v_~N~0_71} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_42|, ~counter~0=v_~counter~0_152, ~c~0=v_~c~0_84, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_48|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_65, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_50|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_42|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_63|, ~N~0=v_~N~0_71} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [340] L41-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_117 4294967296))) (and (= |v_thread2Thread1of1ForFork1_~i~1#1_166| (+ |v_thread2Thread1of1ForFork1_~i~1#1_167| 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_154 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_167| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_120| (ite (< 0 (mod (+ v_~counter~0_311 v_~c~0_130) 4294967296)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_120| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_120|) (= v_thread1Thread1of1ForFork0_~i~0_153 (+ v_thread1Thread1of1ForFork0_~i~0_154 1)) (= v_~counter~0_309 v_~counter~0_311) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_120| 0)))) InVars {~counter~0=v_~counter~0_311, ~c~0=v_~c~0_130, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_154, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_167|, ~N~0=v_~N~0_117} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_120|, ~counter~0=v_~counter~0_309, ~c~0=v_~c~0_130, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_114|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_153, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_128|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_120|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_166|, ~N~0=v_~N~0_117} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:57:57,182 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:57,182 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:57,297 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 01:57:57,298 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 565 [2022-12-13 01:57:57,298 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 124 transitions, 1984 flow [2022-12-13 01:57:57,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 8 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-13 01:57:57,298 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:57,298 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:57,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 01:57:57,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 01:57:57,499 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:57,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:57,499 INFO L85 PathProgramCache]: Analyzing trace with hash 300972667, now seen corresponding path program 1 times [2022-12-13 01:57:57,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:57,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856354551] [2022-12-13 01:57:57,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:57,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:57,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:57,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:57,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856354551] [2022-12-13 01:57:57,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856354551] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:57:57,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901446918] [2022-12-13 01:57:57,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:57,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:57:57,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:57:57,548 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:57:57,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 01:57:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:57,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:57:57,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:57:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:57,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:57:57,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:57,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901446918] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:57:57,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:57:57,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 01:57:57,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584844105] [2022-12-13 01:57:57,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:57:57,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:57:57,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:57,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:57:57,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:57:57,670 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 01:57:57,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 124 transitions, 1984 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:57,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:57,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 01:57:57,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:58,055 INFO L130 PetriNetUnfolder]: 676/1406 cut-off events. [2022-12-13 01:57:58,055 INFO L131 PetriNetUnfolder]: For 35096/35096 co-relation queries the response was YES. [2022-12-13 01:57:58,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11105 conditions, 1406 events. 676/1406 cut-off events. For 35096/35096 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9046 event pairs, 267 based on Foata normal form. 18/1424 useless extension candidates. Maximal degree in co-relation 10509. Up to 1085 conditions per place. [2022-12-13 01:57:58,064 INFO L137 encePairwiseOnDemand]: 14/34 looper letters, 113 selfloop transitions, 57 changer transitions 11/181 dead transitions. [2022-12-13 01:57:58,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 181 transitions, 3085 flow [2022-12-13 01:57:58,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:57:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:57:58,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2022-12-13 01:57:58,065 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29831932773109243 [2022-12-13 01:57:58,065 INFO L175 Difference]: Start difference. First operand has 95 places, 124 transitions, 1984 flow. Second operand 7 states and 71 transitions. [2022-12-13 01:57:58,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 181 transitions, 3085 flow [2022-12-13 01:57:58,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 181 transitions, 2955 flow, removed 65 selfloop flow, removed 0 redundant places. [2022-12-13 01:57:58,104 INFO L231 Difference]: Finished difference. Result has 105 places, 140 transitions, 2372 flow [2022-12-13 01:57:58,104 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1880, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2372, PETRI_PLACES=105, PETRI_TRANSITIONS=140} [2022-12-13 01:57:58,104 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 85 predicate places. [2022-12-13 01:57:58,104 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:58,105 INFO L89 Accepts]: Start accepts. Operand has 105 places, 140 transitions, 2372 flow [2022-12-13 01:57:58,105 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:58,106 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:58,106 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 140 transitions, 2372 flow [2022-12-13 01:57:58,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 140 transitions, 2372 flow [2022-12-13 01:57:58,149 INFO L130 PetriNetUnfolder]: 142/561 cut-off events. [2022-12-13 01:57:58,149 INFO L131 PetriNetUnfolder]: For 10570/10577 co-relation queries the response was YES. [2022-12-13 01:57:58,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3748 conditions, 561 events. 142/561 cut-off events. For 10570/10577 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4442 event pairs, 15 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 3552. Up to 179 conditions per place. [2022-12-13 01:57:58,157 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 140 transitions, 2372 flow [2022-12-13 01:57:58,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-13 01:57:58,162 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:58,162 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:59,097 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:57:59,097 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:00,239 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:00,300 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [335] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~counter~0_279 v_~c~0_122) 4294967296)) 1 0))) (and (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_137) 4294967296) (mod v_~N~0_109 4294967296)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_148|) (= v_~counter~0_281 v_~counter~0_279) (not (= (ite (< 0 (mod (+ v_~counter~0_281 (* 2 v_~c~0_122)) 4294967296)) 1 0) 0)) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_104| .cse0) (= 6 v_thread1Thread1of1ForFork0_~i~0_137) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_104| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_104|))) InVars {~counter~0=v_~counter~0_281, ~c~0=v_~c~0_122, ~N~0=v_~N~0_109} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_104|, ~counter~0=v_~counter~0_279, ~c~0=v_~c~0_122, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_100|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_137, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_112|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_104|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_148|, ~N~0=v_~N~0_109} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [348] L41-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_127 4294967296))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137| (ite (< 0 (mod (+ v_~counter~0_343 v_~c~0_140) 4294967296)) 1 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_192| 1) |v_thread2Thread1of1ForFork1_~i~1#1_191|) (< (mod v_thread1Thread1of1ForFork0_~i~0_172 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_192| 4294967296) .cse0) (= v_~counter~0_343 v_~counter~0_341) (= (+ v_thread1Thread1of1ForFork0_~i~0_172 1) v_thread1Thread1of1ForFork0_~i~0_171))) InVars {~counter~0=v_~counter~0_343, ~c~0=v_~c~0_140, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_172, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_192|, ~N~0=v_~N~0_127} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_137|, ~counter~0=v_~counter~0_341, ~c~0=v_~c~0_140, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_124|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_171, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_145|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_137|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_191|, ~N~0=v_~N~0_127} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:00,300 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:00,301 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:00,475 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [335] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~counter~0_279 v_~c~0_122) 4294967296)) 1 0))) (and (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_137) 4294967296) (mod v_~N~0_109 4294967296)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_148|) (= v_~counter~0_281 v_~counter~0_279) (not (= (ite (< 0 (mod (+ v_~counter~0_281 (* 2 v_~c~0_122)) 4294967296)) 1 0) 0)) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_104| .cse0) (= 6 v_thread1Thread1of1ForFork0_~i~0_137) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_104| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_104|))) InVars {~counter~0=v_~counter~0_281, ~c~0=v_~c~0_122, ~N~0=v_~N~0_109} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_104|, ~counter~0=v_~counter~0_279, ~c~0=v_~c~0_122, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_100|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_137, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_112|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_104|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_148|, ~N~0=v_~N~0_109} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:58:00,607 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:58:00,608 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2504 [2022-12-13 01:58:00,608 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 139 transitions, 2410 flow [2022-12-13 01:58:00,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:00,608 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:00,608 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:00,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 01:58:00,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 01:58:00,809 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:00,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:00,809 INFO L85 PathProgramCache]: Analyzing trace with hash 520212132, now seen corresponding path program 1 times [2022-12-13 01:58:00,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:00,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966754922] [2022-12-13 01:58:00,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:00,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:00,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:00,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966754922] [2022-12-13 01:58:00,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966754922] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:00,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097687326] [2022-12-13 01:58:00,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:00,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:00,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:00,952 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:58:00,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 01:58:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:01,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 01:58:01,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:01,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:01,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:01,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:01,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097687326] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:01,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:01,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 01:58:01,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123031844] [2022-12-13 01:58:01,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:01,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:58:01,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:01,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:58:01,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:58:01,088 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 01:58:01,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 139 transitions, 2410 flow. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:01,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:01,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 01:58:01,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:01,652 INFO L130 PetriNetUnfolder]: 822/1772 cut-off events. [2022-12-13 01:58:01,652 INFO L131 PetriNetUnfolder]: For 53919/53919 co-relation queries the response was YES. [2022-12-13 01:58:01,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13872 conditions, 1772 events. 822/1772 cut-off events. For 53919/53919 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 12176 event pairs, 212 based on Foata normal form. 90/1862 useless extension candidates. Maximal degree in co-relation 13091. Up to 657 conditions per place. [2022-12-13 01:58:01,665 INFO L137 encePairwiseOnDemand]: 21/37 looper letters, 98 selfloop transitions, 98 changer transitions 9/205 dead transitions. [2022-12-13 01:58:01,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 205 transitions, 3618 flow [2022-12-13 01:58:01,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:58:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:58:01,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-12-13 01:58:01,667 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28040540540540543 [2022-12-13 01:58:01,667 INFO L175 Difference]: Start difference. First operand has 104 places, 139 transitions, 2410 flow. Second operand 8 states and 83 transitions. [2022-12-13 01:58:01,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 205 transitions, 3618 flow [2022-12-13 01:58:01,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 205 transitions, 3428 flow, removed 94 selfloop flow, removed 2 redundant places. [2022-12-13 01:58:01,728 INFO L231 Difference]: Finished difference. Result has 113 places, 159 transitions, 2997 flow [2022-12-13 01:58:01,728 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2204, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2997, PETRI_PLACES=113, PETRI_TRANSITIONS=159} [2022-12-13 01:58:01,728 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 93 predicate places. [2022-12-13 01:58:01,728 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:01,729 INFO L89 Accepts]: Start accepts. Operand has 113 places, 159 transitions, 2997 flow [2022-12-13 01:58:01,730 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:01,730 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:01,730 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 159 transitions, 2997 flow [2022-12-13 01:58:01,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 159 transitions, 2997 flow [2022-12-13 01:58:01,786 INFO L130 PetriNetUnfolder]: 168/719 cut-off events. [2022-12-13 01:58:01,786 INFO L131 PetriNetUnfolder]: For 15292/15299 co-relation queries the response was YES. [2022-12-13 01:58:01,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4913 conditions, 719 events. 168/719 cut-off events. For 15292/15299 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 6170 event pairs, 22 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 4501. Up to 215 conditions per place. [2022-12-13 01:58:01,792 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 159 transitions, 2997 flow [2022-12-13 01:58:01,792 INFO L226 LiptonReduction]: Number of co-enabled transitions 470 [2022-12-13 01:58:01,794 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:58:01,795 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-13 01:58:01,795 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 159 transitions, 2997 flow [2022-12-13 01:58:01,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:01,795 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:01,795 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:01,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 01:58:01,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 01:58:01,999 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:02,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:02,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1879225370, now seen corresponding path program 1 times [2022-12-13 01:58:02,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:02,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105442339] [2022-12-13 01:58:02,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:02,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:02,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:02,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105442339] [2022-12-13 01:58:02,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105442339] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:02,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939792051] [2022-12-13 01:58:02,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:02,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:02,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:02,118 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:58:02,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 01:58:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:02,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 01:58:02,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:02,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:02,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939792051] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:02,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:02,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 01:58:02,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866791835] [2022-12-13 01:58:02,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:02,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:58:02,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:02,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:58:02,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:58:02,260 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 01:58:02,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 159 transitions, 2997 flow. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:02,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:02,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 01:58:02,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:02,769 INFO L130 PetriNetUnfolder]: 912/1958 cut-off events. [2022-12-13 01:58:02,769 INFO L131 PetriNetUnfolder]: For 63259/63259 co-relation queries the response was YES. [2022-12-13 01:58:02,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16209 conditions, 1958 events. 912/1958 cut-off events. For 63259/63259 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13877 event pairs, 348 based on Foata normal form. 60/2014 useless extension candidates. Maximal degree in co-relation 13161. Up to 1419 conditions per place. [2022-12-13 01:58:02,783 INFO L137 encePairwiseOnDemand]: 17/37 looper letters, 112 selfloop transitions, 99 changer transitions 11/222 dead transitions. [2022-12-13 01:58:02,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 222 transitions, 4250 flow [2022-12-13 01:58:02,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:58:02,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:58:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 80 transitions. [2022-12-13 01:58:02,784 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24024024024024024 [2022-12-13 01:58:02,784 INFO L175 Difference]: Start difference. First operand has 113 places, 159 transitions, 2997 flow. Second operand 9 states and 80 transitions. [2022-12-13 01:58:02,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 222 transitions, 4250 flow [2022-12-13 01:58:02,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 222 transitions, 4033 flow, removed 85 selfloop flow, removed 2 redundant places. [2022-12-13 01:58:02,870 INFO L231 Difference]: Finished difference. Result has 124 places, 178 transitions, 3538 flow [2022-12-13 01:58:02,870 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2833, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3538, PETRI_PLACES=124, PETRI_TRANSITIONS=178} [2022-12-13 01:58:02,870 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 104 predicate places. [2022-12-13 01:58:02,871 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:02,871 INFO L89 Accepts]: Start accepts. Operand has 124 places, 178 transitions, 3538 flow [2022-12-13 01:58:02,872 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:02,872 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:02,872 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 178 transitions, 3538 flow [2022-12-13 01:58:02,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 178 transitions, 3538 flow [2022-12-13 01:58:02,935 INFO L130 PetriNetUnfolder]: 184/779 cut-off events. [2022-12-13 01:58:02,935 INFO L131 PetriNetUnfolder]: For 18418/18425 co-relation queries the response was YES. [2022-12-13 01:58:02,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5560 conditions, 779 events. 184/779 cut-off events. For 18418/18425 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6813 event pairs, 22 based on Foata normal form. 0/772 useless extension candidates. Maximal degree in co-relation 5146. Up to 233 conditions per place. [2022-12-13 01:58:02,941 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 178 transitions, 3538 flow [2022-12-13 01:58:02,941 INFO L226 LiptonReduction]: Number of co-enabled transitions 524 [2022-12-13 01:58:02,942 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:02,989 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:02,989 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:03,298 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:58:03,299 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 428 [2022-12-13 01:58:03,299 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 177 transitions, 3559 flow [2022-12-13 01:58:03,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:03,299 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:03,299 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:03,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 01:58:03,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:03,504 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:03,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:03,504 INFO L85 PathProgramCache]: Analyzing trace with hash -395262950, now seen corresponding path program 2 times [2022-12-13 01:58:03,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:03,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932482257] [2022-12-13 01:58:03,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:03,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:03,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:03,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:03,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932482257] [2022-12-13 01:58:03,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932482257] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:03,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265726162] [2022-12-13 01:58:03,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 01:58:03,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:03,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:03,619 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:58:03,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 01:58:03,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 01:58:03,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:58:03,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 01:58:03,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:03,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:03,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:03,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265726162] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:03,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:03,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 01:58:03,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553903776] [2022-12-13 01:58:03,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:03,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:58:03,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:03,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:58:03,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:58:03,772 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 01:58:03,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 177 transitions, 3559 flow. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:03,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:03,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 01:58:03,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:04,563 INFO L130 PetriNetUnfolder]: 950/2013 cut-off events. [2022-12-13 01:58:04,563 INFO L131 PetriNetUnfolder]: For 72289/72289 co-relation queries the response was YES. [2022-12-13 01:58:04,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17999 conditions, 2013 events. 950/2013 cut-off events. For 72289/72289 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 14181 event pairs, 94 based on Foata normal form. 26/2035 useless extension candidates. Maximal degree in co-relation 16811. Up to 794 conditions per place. [2022-12-13 01:58:04,574 INFO L137 encePairwiseOnDemand]: 16/38 looper letters, 98 selfloop transitions, 137 changer transitions 15/250 dead transitions. [2022-12-13 01:58:04,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 250 transitions, 5048 flow [2022-12-13 01:58:04,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 01:58:04,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 01:58:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 104 transitions. [2022-12-13 01:58:04,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19548872180451127 [2022-12-13 01:58:04,576 INFO L175 Difference]: Start difference. First operand has 123 places, 177 transitions, 3559 flow. Second operand 14 states and 104 transitions. [2022-12-13 01:58:04,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 250 transitions, 5048 flow [2022-12-13 01:58:04,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 250 transitions, 4717 flow, removed 161 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:04,676 INFO L231 Difference]: Finished difference. Result has 137 places, 200 transitions, 4235 flow [2022-12-13 01:58:04,676 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=3278, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4235, PETRI_PLACES=137, PETRI_TRANSITIONS=200} [2022-12-13 01:58:04,676 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 117 predicate places. [2022-12-13 01:58:04,676 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:04,676 INFO L89 Accepts]: Start accepts. Operand has 137 places, 200 transitions, 4235 flow [2022-12-13 01:58:04,678 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:04,678 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:04,678 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 200 transitions, 4235 flow [2022-12-13 01:58:04,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 200 transitions, 4235 flow [2022-12-13 01:58:04,747 INFO L130 PetriNetUnfolder]: 191/793 cut-off events. [2022-12-13 01:58:04,748 INFO L131 PetriNetUnfolder]: For 24670/24677 co-relation queries the response was YES. [2022-12-13 01:58:04,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6483 conditions, 793 events. 191/793 cut-off events. For 24670/24677 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6945 event pairs, 15 based on Foata normal form. 0/785 useless extension candidates. Maximal degree in co-relation 6046. Up to 238 conditions per place. [2022-12-13 01:58:04,755 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 200 transitions, 4235 flow [2022-12-13 01:58:04,755 INFO L226 LiptonReduction]: Number of co-enabled transitions 584 [2022-12-13 01:58:04,757 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:58:04,830 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:04,832 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 156 [2022-12-13 01:58:04,832 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 199 transitions, 4225 flow [2022-12-13 01:58:04,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:04,832 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:04,832 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:04,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 01:58:05,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 01:58:05,033 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:05,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:05,033 INFO L85 PathProgramCache]: Analyzing trace with hash 616479689, now seen corresponding path program 1 times [2022-12-13 01:58:05,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:05,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006479528] [2022-12-13 01:58:05,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:05,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:05,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:05,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006479528] [2022-12-13 01:58:05,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006479528] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:05,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897230655] [2022-12-13 01:58:05,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:05,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:05,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:05,108 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:58:05,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 01:58:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:05,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 01:58:05,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:05,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:05,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897230655] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:05,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:05,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 01:58:05,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445244276] [2022-12-13 01:58:05,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:05,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:58:05,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:05,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:58:05,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:58:05,224 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 01:58:05,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 199 transitions, 4225 flow. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:05,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:05,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 01:58:05,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:05,964 INFO L130 PetriNetUnfolder]: 1000/2106 cut-off events. [2022-12-13 01:58:05,965 INFO L131 PetriNetUnfolder]: For 95243/95243 co-relation queries the response was YES. [2022-12-13 01:58:05,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20102 conditions, 2106 events. 1000/2106 cut-off events. For 95243/95243 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14950 event pairs, 144 based on Foata normal form. 40/2144 useless extension candidates. Maximal degree in co-relation 17483. Up to 880 conditions per place. [2022-12-13 01:58:05,980 INFO L137 encePairwiseOnDemand]: 18/39 looper letters, 138 selfloop transitions, 128 changer transitions 5/271 dead transitions. [2022-12-13 01:58:05,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 271 transitions, 5758 flow [2022-12-13 01:58:05,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:58:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:58:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2022-12-13 01:58:05,981 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20745920745920746 [2022-12-13 01:58:05,981 INFO L175 Difference]: Start difference. First operand has 133 places, 199 transitions, 4225 flow. Second operand 11 states and 89 transitions. [2022-12-13 01:58:05,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 271 transitions, 5758 flow [2022-12-13 01:58:06,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 271 transitions, 5491 flow, removed 131 selfloop flow, removed 2 redundant places. [2022-12-13 01:58:06,146 INFO L231 Difference]: Finished difference. Result has 146 places, 218 transitions, 4829 flow [2022-12-13 01:58:06,146 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3994, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4829, PETRI_PLACES=146, PETRI_TRANSITIONS=218} [2022-12-13 01:58:06,147 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 126 predicate places. [2022-12-13 01:58:06,147 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:06,147 INFO L89 Accepts]: Start accepts. Operand has 146 places, 218 transitions, 4829 flow [2022-12-13 01:58:06,148 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:06,148 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:06,148 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 218 transitions, 4829 flow [2022-12-13 01:58:06,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 218 transitions, 4829 flow [2022-12-13 01:58:06,226 INFO L130 PetriNetUnfolder]: 203/838 cut-off events. [2022-12-13 01:58:06,226 INFO L131 PetriNetUnfolder]: For 24001/24008 co-relation queries the response was YES. [2022-12-13 01:58:06,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6812 conditions, 838 events. 203/838 cut-off events. For 24001/24008 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 7370 event pairs, 15 based on Foata normal form. 0/830 useless extension candidates. Maximal degree in co-relation 6600. Up to 236 conditions per place. [2022-12-13 01:58:06,234 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 218 transitions, 4829 flow [2022-12-13 01:58:06,234 INFO L226 LiptonReduction]: Number of co-enabled transitions 644 [2022-12-13 01:58:06,245 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:06,246 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:06,419 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [354] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (+ v_~counter~0_373 v_~c~0_148))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_151| (ite (< 0 (mod (+ v_~counter~0_373 (* 2 v_~c~0_148)) 4294967296)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_151| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|) (not (= (ite (< 0 (mod .cse0 4294967296)) 1 0) 0)) (= .cse0 v_~counter~0_371) (= 7 |v_thread2Thread1of1ForFork1_~i~1#1_211|) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_191) 4294967296) (mod v_~N~0_135 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151| 0)) (= v_thread1Thread1of1ForFork0_~i~0_191 8))) InVars {~counter~0=v_~counter~0_373, ~c~0=v_~c~0_148, ~N~0=v_~N~0_135} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|, ~counter~0=v_~counter~0_371, ~c~0=v_~c~0_148, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_140|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_191, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_159|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_151|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_211|, ~N~0=v_~N~0_135} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:58:06,541 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [359] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (+ v_~counter~0_403 (* 2 v_~c~0_156)))) (and (= 7 |v_thread2Thread1of1ForFork1_~i~1#1_231|) (= 9 v_thread1Thread1of1ForFork0_~i~0_209) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_167| (ite (< 0 (mod .cse0 4294967296)) 1 0)) (not (= (ite (< 0 (mod (+ v_~counter~0_403 v_~c~0_156) 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_209) 4294967296) (mod v_~N~0_143 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_167| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_167|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_167| 0)) (= v_~counter~0_401 .cse0))) InVars {~counter~0=v_~counter~0_403, ~c~0=v_~c~0_156, ~N~0=v_~N~0_143} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_167|, ~counter~0=v_~counter~0_401, ~c~0=v_~c~0_156, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_156|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_209, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_175|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_167|, ~N~0=v_~N~0_143, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_231|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:06,541 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:06,541 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:06,705 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:58:06,706 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 559 [2022-12-13 01:58:06,706 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 218 transitions, 4888 flow [2022-12-13 01:58:06,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:06,708 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:06,708 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:06,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 01:58:06,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 01:58:06,911 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:06,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:06,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1730702898, now seen corresponding path program 1 times [2022-12-13 01:58:06,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:06,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015795606] [2022-12-13 01:58:06,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:06,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:06,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:06,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015795606] [2022-12-13 01:58:06,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015795606] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:06,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778086438] [2022-12-13 01:58:06,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:06,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:06,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:06,955 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:58:06,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 01:58:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:07,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:58:07,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:07,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:07,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:07,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778086438] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:07,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:07,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 01:58:07,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145709172] [2022-12-13 01:58:07,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:07,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:58:07,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:07,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:58:07,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:58:07,062 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 01:58:07,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 218 transitions, 4888 flow. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:07,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:07,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 01:58:07,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:07,928 INFO L130 PetriNetUnfolder]: 1064/2240 cut-off events. [2022-12-13 01:58:07,928 INFO L131 PetriNetUnfolder]: For 93662/93662 co-relation queries the response was YES. [2022-12-13 01:58:07,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21545 conditions, 2240 events. 1064/2240 cut-off events. For 93662/93662 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 16092 event pairs, 396 based on Foata normal form. 18/2256 useless extension candidates. Maximal degree in co-relation 20435. Up to 1787 conditions per place. [2022-12-13 01:58:07,942 INFO L137 encePairwiseOnDemand]: 14/42 looper letters, 182 selfloop transitions, 79 changer transitions 14/275 dead transitions. [2022-12-13 01:58:07,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 275 transitions, 6362 flow [2022-12-13 01:58:07,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:58:07,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:58:07,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2022-12-13 01:58:07,943 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2653061224489796 [2022-12-13 01:58:07,943 INFO L175 Difference]: Start difference. First operand has 146 places, 218 transitions, 4888 flow. Second operand 7 states and 78 transitions. [2022-12-13 01:58:07,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 275 transitions, 6362 flow [2022-12-13 01:58:08,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 275 transitions, 5817 flow, removed 194 selfloop flow, removed 8 redundant places. [2022-12-13 01:58:08,100 INFO L231 Difference]: Finished difference. Result has 149 places, 232 transitions, 5034 flow [2022-12-13 01:58:08,100 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4439, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5034, PETRI_PLACES=149, PETRI_TRANSITIONS=232} [2022-12-13 01:58:08,100 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 129 predicate places. [2022-12-13 01:58:08,101 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:08,101 INFO L89 Accepts]: Start accepts. Operand has 149 places, 232 transitions, 5034 flow [2022-12-13 01:58:08,102 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:08,102 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:08,102 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 232 transitions, 5034 flow [2022-12-13 01:58:08,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 232 transitions, 5034 flow [2022-12-13 01:58:08,185 INFO L130 PetriNetUnfolder]: 217/923 cut-off events. [2022-12-13 01:58:08,186 INFO L131 PetriNetUnfolder]: For 19036/19043 co-relation queries the response was YES. [2022-12-13 01:58:08,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6834 conditions, 923 events. 217/923 cut-off events. For 19036/19043 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 8440 event pairs, 15 based on Foata normal form. 0/917 useless extension candidates. Maximal degree in co-relation 6607. Up to 248 conditions per place. [2022-12-13 01:58:08,194 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 232 transitions, 5034 flow [2022-12-13 01:58:08,194 INFO L226 LiptonReduction]: Number of co-enabled transitions 696 [2022-12-13 01:58:08,204 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [358] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~counter~0_397 v_~c~0_154) 4294967296)) 1 0))) (and (= v_~counter~0_397 v_~counter~0_395) (= v_thread1Thread1of1ForFork0_~i~0_207 8) (= |v_thread2Thread1of1ForFork1_~i~1#1_227| 8) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_207) 4294967296) (mod v_~N~0_141 4294967296)) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_163| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_163|) (not (= (ite (< 0 (mod (+ v_~counter~0_397 (* 2 v_~c~0_154)) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_163| .cse0))) InVars {~counter~0=v_~counter~0_397, ~c~0=v_~c~0_154, ~N~0=v_~N~0_141} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_163|, ~counter~0=v_~counter~0_395, ~c~0=v_~c~0_154, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_154|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_207, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_171|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_163|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_227|, ~N~0=v_~N~0_141} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:58:08,434 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:08,435 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:11,087 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:11,088 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:15,552 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:58:15,552 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7451 [2022-12-13 01:58:15,553 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 231 transitions, 5059 flow [2022-12-13 01:58:15,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:15,553 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:15,553 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:15,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 01:58:15,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 01:58:15,753 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:15,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:15,754 INFO L85 PathProgramCache]: Analyzing trace with hash -866170140, now seen corresponding path program 1 times [2022-12-13 01:58:15,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:15,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013702818] [2022-12-13 01:58:15,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:15,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:15,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:15,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013702818] [2022-12-13 01:58:15,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013702818] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:15,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475276873] [2022-12-13 01:58:15,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:15,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:15,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:15,865 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:58:15,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 01:58:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:15,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 01:58:15,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:15,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:15,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:15,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475276873] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:15,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:15,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 01:58:15,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475901687] [2022-12-13 01:58:15,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:15,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:58:15,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:15,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:58:15,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:58:15,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 01:58:15,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 231 transitions, 5059 flow. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:15,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:15,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 01:58:15,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:17,018 INFO L130 PetriNetUnfolder]: 1223/2597 cut-off events. [2022-12-13 01:58:17,018 INFO L131 PetriNetUnfolder]: For 77231/77231 co-relation queries the response was YES. [2022-12-13 01:58:17,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23069 conditions, 2597 events. 1223/2597 cut-off events. For 77231/77231 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 19319 event pairs, 156 based on Foata normal form. 20/2615 useless extension candidates. Maximal degree in co-relation 22365. Up to 1003 conditions per place. [2022-12-13 01:58:17,034 INFO L137 encePairwiseOnDemand]: 17/42 looper letters, 113 selfloop transitions, 194 changer transitions 18/325 dead transitions. [2022-12-13 01:58:17,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 325 transitions, 7101 flow [2022-12-13 01:58:17,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 01:58:17,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 01:58:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 114 transitions. [2022-12-13 01:58:17,037 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19387755102040816 [2022-12-13 01:58:17,038 INFO L175 Difference]: Start difference. First operand has 147 places, 231 transitions, 5059 flow. Second operand 14 states and 114 transitions. [2022-12-13 01:58:17,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 325 transitions, 7101 flow [2022-12-13 01:58:17,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 325 transitions, 6950 flow, removed 43 selfloop flow, removed 2 redundant places. [2022-12-13 01:58:17,181 INFO L231 Difference]: Finished difference. Result has 166 places, 268 transitions, 6494 flow [2022-12-13 01:58:17,181 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4910, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6494, PETRI_PLACES=166, PETRI_TRANSITIONS=268} [2022-12-13 01:58:17,184 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 146 predicate places. [2022-12-13 01:58:17,184 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:17,184 INFO L89 Accepts]: Start accepts. Operand has 166 places, 268 transitions, 6494 flow [2022-12-13 01:58:17,188 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:17,188 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:17,188 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 268 transitions, 6494 flow [2022-12-13 01:58:17,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 268 transitions, 6494 flow [2022-12-13 01:58:17,291 INFO L130 PetriNetUnfolder]: 245/1007 cut-off events. [2022-12-13 01:58:17,291 INFO L131 PetriNetUnfolder]: For 31749/31756 co-relation queries the response was YES. [2022-12-13 01:58:17,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8993 conditions, 1007 events. 245/1007 cut-off events. For 31749/31756 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 9286 event pairs, 15 based on Foata normal form. 0/998 useless extension candidates. Maximal degree in co-relation 8779. Up to 285 conditions per place. [2022-12-13 01:58:17,302 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 268 transitions, 6494 flow [2022-12-13 01:58:17,302 INFO L226 LiptonReduction]: Number of co-enabled transitions 792 [2022-12-13 01:58:17,303 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:58:17,304 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:58:17,304 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 268 transitions, 6494 flow [2022-12-13 01:58:17,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:17,305 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:17,305 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:17,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 01:58:17,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 01:58:17,507 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:17,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:17,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1818029431, now seen corresponding path program 1 times [2022-12-13 01:58:17,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:17,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866387055] [2022-12-13 01:58:17,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:17,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:17,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:17,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866387055] [2022-12-13 01:58:17,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866387055] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:17,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043960867] [2022-12-13 01:58:17,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:17,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:17,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:17,643 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:58:17,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 01:58:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:17,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 01:58:17,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:17,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:17,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:17,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:17,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043960867] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:17,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:17,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 01:58:17,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73744295] [2022-12-13 01:58:17,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:17,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:58:17,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:17,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:58:17,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:58:17,792 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 01:58:17,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 268 transitions, 6494 flow. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:17,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:17,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 01:58:17,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:18,598 INFO L130 PetriNetUnfolder]: 1153/2431 cut-off events. [2022-12-13 01:58:18,598 INFO L131 PetriNetUnfolder]: For 107992/107992 co-relation queries the response was YES. [2022-12-13 01:58:18,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24366 conditions, 2431 events. 1153/2431 cut-off events. For 107992/107992 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 17561 event pairs, 236 based on Foata normal form. 72/2501 useless extension candidates. Maximal degree in co-relation 23633. Up to 990 conditions per place. [2022-12-13 01:58:18,617 INFO L137 encePairwiseOnDemand]: 23/42 looper letters, 116 selfloop transitions, 173 changer transitions 0/289 dead transitions. [2022-12-13 01:58:18,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 289 transitions, 7236 flow [2022-12-13 01:58:18,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:58:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:58:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-12-13 01:58:18,618 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2261904761904762 [2022-12-13 01:58:18,618 INFO L175 Difference]: Start difference. First operand has 164 places, 268 transitions, 6494 flow. Second operand 8 states and 76 transitions. [2022-12-13 01:58:18,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 289 transitions, 7236 flow [2022-12-13 01:58:18,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 289 transitions, 6715 flow, removed 211 selfloop flow, removed 3 redundant places. [2022-12-13 01:58:18,848 INFO L231 Difference]: Finished difference. Result has 171 places, 263 transitions, 6504 flow [2022-12-13 01:58:18,848 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5834, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6504, PETRI_PLACES=171, PETRI_TRANSITIONS=263} [2022-12-13 01:58:18,849 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 151 predicate places. [2022-12-13 01:58:18,849 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:18,849 INFO L89 Accepts]: Start accepts. Operand has 171 places, 263 transitions, 6504 flow [2022-12-13 01:58:18,850 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:18,850 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:18,850 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 263 transitions, 6504 flow [2022-12-13 01:58:18,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 263 transitions, 6504 flow [2022-12-13 01:58:18,973 INFO L130 PetriNetUnfolder]: 233/961 cut-off events. [2022-12-13 01:58:18,973 INFO L131 PetriNetUnfolder]: For 31511/31518 co-relation queries the response was YES. [2022-12-13 01:58:18,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8504 conditions, 961 events. 233/961 cut-off events. For 31511/31518 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 8753 event pairs, 15 based on Foata normal form. 0/953 useless extension candidates. Maximal degree in co-relation 8263. Up to 262 conditions per place. [2022-12-13 01:58:18,983 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 263 transitions, 6504 flow [2022-12-13 01:58:18,983 INFO L226 LiptonReduction]: Number of co-enabled transitions 790 [2022-12-13 01:58:18,984 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:58:18,985 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:58:18,985 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 263 transitions, 6504 flow [2022-12-13 01:58:18,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:18,985 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:18,985 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:18,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 01:58:19,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:19,190 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:19,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:19,190 INFO L85 PathProgramCache]: Analyzing trace with hash -902842867, now seen corresponding path program 2 times [2022-12-13 01:58:19,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:19,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624376162] [2022-12-13 01:58:19,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:19,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:19,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:19,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624376162] [2022-12-13 01:58:19,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624376162] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:19,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715728233] [2022-12-13 01:58:19,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 01:58:19,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:19,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:19,264 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:58:19,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 01:58:19,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 01:58:19,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:58:19,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 01:58:19,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:19,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:19,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715728233] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:19,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:19,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 01:58:19,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839471205] [2022-12-13 01:58:19,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:19,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:58:19,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:19,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:58:19,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:58:19,440 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 01:58:19,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 263 transitions, 6504 flow. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:19,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:19,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 01:58:19,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:20,227 INFO L130 PetriNetUnfolder]: 1213/2555 cut-off events. [2022-12-13 01:58:20,227 INFO L131 PetriNetUnfolder]: For 118889/118889 co-relation queries the response was YES. [2022-12-13 01:58:20,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25863 conditions, 2555 events. 1213/2555 cut-off events. For 118889/118889 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 18790 event pairs, 422 based on Foata normal form. 40/2593 useless extension candidates. Maximal degree in co-relation 25019. Up to 1837 conditions per place. [2022-12-13 01:58:20,243 INFO L137 encePairwiseOnDemand]: 18/42 looper letters, 167 selfloop transitions, 151 changer transitions 5/323 dead transitions. [2022-12-13 01:58:20,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 323 transitions, 8154 flow [2022-12-13 01:58:20,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:58:20,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:58:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2022-12-13 01:58:20,244 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21428571428571427 [2022-12-13 01:58:20,245 INFO L175 Difference]: Start difference. First operand has 171 places, 263 transitions, 6504 flow. Second operand 9 states and 81 transitions. [2022-12-13 01:58:20,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 323 transitions, 8154 flow [2022-12-13 01:58:20,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 323 transitions, 7811 flow, removed 15 selfloop flow, removed 6 redundant places. [2022-12-13 01:58:20,449 INFO L231 Difference]: Finished difference. Result has 175 places, 281 transitions, 7054 flow [2022-12-13 01:58:20,449 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6203, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7054, PETRI_PLACES=175, PETRI_TRANSITIONS=281} [2022-12-13 01:58:20,449 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 155 predicate places. [2022-12-13 01:58:20,449 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:20,449 INFO L89 Accepts]: Start accepts. Operand has 175 places, 281 transitions, 7054 flow [2022-12-13 01:58:20,451 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:20,451 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:20,451 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 281 transitions, 7054 flow [2022-12-13 01:58:20,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 281 transitions, 7054 flow [2022-12-13 01:58:20,548 INFO L130 PetriNetUnfolder]: 245/1009 cut-off events. [2022-12-13 01:58:20,549 INFO L131 PetriNetUnfolder]: For 33695/33702 co-relation queries the response was YES. [2022-12-13 01:58:20,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9003 conditions, 1009 events. 245/1009 cut-off events. For 33695/33702 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 9355 event pairs, 15 based on Foata normal form. 0/1002 useless extension candidates. Maximal degree in co-relation 8737. Up to 274 conditions per place. [2022-12-13 01:58:20,559 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 281 transitions, 7054 flow [2022-12-13 01:58:20,559 INFO L226 LiptonReduction]: Number of co-enabled transitions 850 [2022-12-13 01:58:20,560 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:58:20,560 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-13 01:58:20,560 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 281 transitions, 7054 flow [2022-12-13 01:58:20,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:20,561 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:20,561 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:20,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 01:58:20,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-13 01:58:20,765 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:20,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:20,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1340583110, now seen corresponding path program 1 times [2022-12-13 01:58:20,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:20,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817047323] [2022-12-13 01:58:20,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:20,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:20,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:20,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817047323] [2022-12-13 01:58:20,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817047323] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:20,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520190473] [2022-12-13 01:58:20,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:20,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:20,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:20,829 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:58:20,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 01:58:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:20,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:58:20,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:20,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:20,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520190473] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:20,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:20,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 01:58:20,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743002192] [2022-12-13 01:58:20,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:21,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:58:21,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:21,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:58:21,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:58:21,000 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 01:58:21,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 281 transitions, 7054 flow. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:21,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:21,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 01:58:21,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:21,705 INFO L130 PetriNetUnfolder]: 1277/2692 cut-off events. [2022-12-13 01:58:21,706 INFO L131 PetriNetUnfolder]: For 123843/123843 co-relation queries the response was YES. [2022-12-13 01:58:21,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27736 conditions, 2692 events. 1277/2692 cut-off events. For 123843/123843 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 19976 event pairs, 226 based on Foata normal form. 6/2696 useless extension candidates. Maximal degree in co-relation 26899. Up to 2142 conditions per place. [2022-12-13 01:58:21,726 INFO L137 encePairwiseOnDemand]: 20/42 looper letters, 262 selfloop transitions, 66 changer transitions 0/328 dead transitions. [2022-12-13 01:58:21,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 328 transitions, 8435 flow [2022-12-13 01:58:21,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:58:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:58:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-12-13 01:58:21,727 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2585034013605442 [2022-12-13 01:58:21,727 INFO L175 Difference]: Start difference. First operand has 175 places, 281 transitions, 7054 flow. Second operand 7 states and 76 transitions. [2022-12-13 01:58:21,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 328 transitions, 8435 flow [2022-12-13 01:58:21,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 328 transitions, 8169 flow, removed 104 selfloop flow, removed 3 redundant places. [2022-12-13 01:58:21,997 INFO L231 Difference]: Finished difference. Result has 180 places, 286 transitions, 7154 flow [2022-12-13 01:58:21,997 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=6791, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7154, PETRI_PLACES=180, PETRI_TRANSITIONS=286} [2022-12-13 01:58:21,998 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 160 predicate places. [2022-12-13 01:58:21,998 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:21,998 INFO L89 Accepts]: Start accepts. Operand has 180 places, 286 transitions, 7154 flow [2022-12-13 01:58:21,999 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:21,999 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:21,999 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 286 transitions, 7154 flow [2022-12-13 01:58:22,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 286 transitions, 7154 flow [2022-12-13 01:58:22,119 INFO L130 PetriNetUnfolder]: 259/1102 cut-off events. [2022-12-13 01:58:22,119 INFO L131 PetriNetUnfolder]: For 37957/37964 co-relation queries the response was YES. [2022-12-13 01:58:22,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9631 conditions, 1102 events. 259/1102 cut-off events. For 37957/37964 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 10471 event pairs, 21 based on Foata normal form. 0/1096 useless extension candidates. Maximal degree in co-relation 9405. Up to 293 conditions per place. [2022-12-13 01:58:22,130 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 286 transitions, 7154 flow [2022-12-13 01:58:22,130 INFO L226 LiptonReduction]: Number of co-enabled transitions 868 [2022-12-13 01:58:22,148 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:22,148 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:22,148 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:22,275 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:22,276 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:22,276 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:22,362 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:22,362 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:22,362 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:22,479 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:22,480 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:22,480 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:22,575 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:22,576 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:22,576 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:22,673 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:22,673 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:22,673 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:22,770 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:22,770 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:22,770 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:22,864 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:22,864 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:22,865 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:22,961 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:22,961 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:22,961 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:23,057 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L41-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_119 4294967296))) (and (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_171| 1) |v_thread2Thread1of1ForFork1_~i~1#1_170|) (= v_thread1Thread1of1ForFork0_~i~0_157 (+ v_thread1Thread1of1ForFork0_~i~0_158 1)) (= v_~counter~0_317 v_~counter~0_315) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_122|) (< (mod v_thread1Thread1of1ForFork0_~i~0_158 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_122| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_171| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122| (ite (< 0 (mod (+ v_~counter~0_317 v_~c~0_132) 4294967296)) 1 0)))) InVars {~counter~0=v_~counter~0_317, ~c~0=v_~c~0_132, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_158, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_171|, ~N~0=v_~N~0_119} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_122|, ~counter~0=v_~counter~0_315, ~c~0=v_~c~0_132, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_116|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_157, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_130|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_170|, ~N~0=v_~N~0_119} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:23,057 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:23,057 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:23,179 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [327] L51-4-->L41-4: Formula: (let ((.cse0 (mod v_~N~0_99 4294967296))) (and (= |v_thread2Thread1of1ForFork1_~i~1#1_122| (+ |v_thread2Thread1of1ForFork1_~i~1#1_123| 1)) (= (+ v_thread1Thread1of1ForFork0_~i~0_118 1) v_thread1Thread1of1ForFork0_~i~0_117) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_87| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_87|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_87| 0)) (= (ite (< 0 (mod v_~counter~0_246 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_87|) (= v_~counter~0_246 v_~counter~0_244) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_123| 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_118 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_246, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_118, ~N~0=v_~N~0_99, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_123|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_87|, ~counter~0=v_~counter~0_244, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_88|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_117, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_95|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_87|, ~N~0=v_~N~0_99, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_122|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:23,179 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:23,179 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:23,289 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [356] L51-4-->L41-4: Formula: (let ((.cse0 (mod v_~N~0_139 4294967296))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_159| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_221| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159| (ite (< 0 (mod v_~counter~0_388 4294967296)) 1 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_202 4294967296) .cse0) (= v_~counter~0_388 v_~counter~0_386) (= v_thread1Thread1of1ForFork0_~i~0_201 (+ v_thread1Thread1of1ForFork0_~i~0_202 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_159|) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_221| 1) |v_thread2Thread1of1ForFork1_~i~1#1_220|))) InVars {~counter~0=v_~counter~0_388, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_202, ~N~0=v_~N~0_139, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_221|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_159|, ~counter~0=v_~counter~0_386, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_150|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_201, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_167|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159|, ~N~0=v_~N~0_139, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_220|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:23,289 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:23,289 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:23,400 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:23,401 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:23,401 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:23,499 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:23,499 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:23,499 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:23,598 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:23,599 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:23,599 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:23,692 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:23,693 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:23,693 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:23,790 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:23,790 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:23,790 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:23,892 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [337] L41-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_113 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_114| (ite (< 0 (mod (+ v_~counter~0_299 v_~c~0_126) 4294967296)) 1 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_~i~1#1_158| (+ |v_thread2Thread1of1ForFork1_~i~1#1_159| 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_114| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_114|) (= v_~counter~0_299 v_~counter~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_148 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_114| 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_148 1) v_thread1Thread1of1ForFork0_~i~0_147))) InVars {~counter~0=v_~counter~0_299, ~c~0=v_~c~0_126, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_148, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~N~0=v_~N~0_113} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_114|, ~counter~0=v_~counter~0_297, ~c~0=v_~c~0_126, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_110|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_147, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_122|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_114|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_158|, ~N~0=v_~N~0_113} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:23,892 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:23,892 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:24,010 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:24,010 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:24,010 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:24,106 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:24,106 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:24,106 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:24,206 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:24,206 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:24,206 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:24,305 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:24,305 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:24,305 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:24,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:24,406 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:24,406 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:24,506 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:24,507 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:24,507 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:24,604 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:24,604 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:24,604 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:24,704 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:24,704 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:24,704 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:24,804 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:24,804 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:24,804 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:24,900 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:24,901 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:24,901 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,018 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:25,018 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,018 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,094 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:25,094 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,094 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,174 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:25,174 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,174 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,271 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:25,271 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,271 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,369 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:25,370 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,370 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,469 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:25,469 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,469 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,568 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:25,568 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,568 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,668 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:25,668 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,668 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,768 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:25,768 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,768 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,858 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:25,858 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,858 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,955 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:25,955 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:25,955 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:26,057 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:26,057 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:26,057 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:26,158 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:26,159 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:26,159 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:26,273 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:26,273 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4275 [2022-12-13 01:58:26,274 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 309 transitions, 8329 flow [2022-12-13 01:58:26,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:26,274 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:26,274 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:26,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-13 01:58:26,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:26,487 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:26,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:26,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1852557115, now seen corresponding path program 1 times [2022-12-13 01:58:26,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:26,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314229000] [2022-12-13 01:58:26,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:26,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:26,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:26,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314229000] [2022-12-13 01:58:26,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314229000] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:26,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278612059] [2022-12-13 01:58:26,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:26,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:26,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:26,604 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:58:26,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 01:58:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:26,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 01:58:26,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:26,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:26,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:26,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:26,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278612059] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:26,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:26,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-13 01:58:26,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939318010] [2022-12-13 01:58:26,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:26,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 01:58:26,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:26,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 01:58:26,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-12-13 01:58:26,773 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 83 [2022-12-13 01:58:26,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 309 transitions, 8329 flow. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 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-13 01:58:26,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:26,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 83 [2022-12-13 01:58:26,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:28,349 INFO L130 PetriNetUnfolder]: 1268/2739 cut-off events. [2022-12-13 01:58:28,349 INFO L131 PetriNetUnfolder]: For 134460/134460 co-relation queries the response was YES. [2022-12-13 01:58:28,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28003 conditions, 2739 events. 1268/2739 cut-off events. For 134460/134460 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 20765 event pairs, 174 based on Foata normal form. 18/2755 useless extension candidates. Maximal degree in co-relation 27439. Up to 2275 conditions per place. [2022-12-13 01:58:28,372 INFO L137 encePairwiseOnDemand]: 57/83 looper letters, 237 selfloop transitions, 69 changer transitions 47/353 dead transitions. [2022-12-13 01:58:28,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 353 transitions, 8278 flow [2022-12-13 01:58:28,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 01:58:28,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 01:58:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 126 transitions. [2022-12-13 01:58:28,374 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.07590361445783132 [2022-12-13 01:58:28,374 INFO L175 Difference]: Start difference. First operand has 181 places, 309 transitions, 8329 flow. Second operand 20 states and 126 transitions. [2022-12-13 01:58:28,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 353 transitions, 8278 flow [2022-12-13 01:58:28,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 353 transitions, 8180 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:28,691 INFO L231 Difference]: Finished difference. Result has 202 places, 265 transitions, 6549 flow [2022-12-13 01:58:28,691 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=6539, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=6549, PETRI_PLACES=202, PETRI_TRANSITIONS=265} [2022-12-13 01:58:28,691 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 182 predicate places. [2022-12-13 01:58:28,691 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:28,691 INFO L89 Accepts]: Start accepts. Operand has 202 places, 265 transitions, 6549 flow [2022-12-13 01:58:28,693 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:28,693 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:28,694 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 265 transitions, 6549 flow [2022-12-13 01:58:28,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 265 transitions, 6549 flow [2022-12-13 01:58:28,822 INFO L130 PetriNetUnfolder]: 245/1031 cut-off events. [2022-12-13 01:58:28,822 INFO L131 PetriNetUnfolder]: For 42648/42686 co-relation queries the response was YES. [2022-12-13 01:58:28,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9629 conditions, 1031 events. 245/1031 cut-off events. For 42648/42686 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 9649 event pairs, 21 based on Foata normal form. 0/1022 useless extension candidates. Maximal degree in co-relation 9410. Up to 286 conditions per place. [2022-12-13 01:58:28,837 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 265 transitions, 6549 flow [2022-12-13 01:58:28,837 INFO L226 LiptonReduction]: Number of co-enabled transitions 790 [2022-12-13 01:58:28,842 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] L41-4-->thread1EXIT: Formula: (and (not (< (mod v_thread1Thread1of1ForFork0_~i~0_In_1 4294967296) (mod v_~N~0_In_3 4294967296))) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:28,927 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [314] L41-4-->L41-4: Formula: (let ((.cse0 (mod v_~N~0_79 4294967296))) (and (= v_thread1Thread1of1ForFork0_~i~0_77 (+ 2 v_thread1Thread1of1ForFork0_~i~0_79)) (< (mod (+ v_thread1Thread1of1ForFork0_~i~0_79 1) 4294967296) .cse0) (= (+ v_~counter~0_182 (* v_~c~0_92 2)) v_~counter~0_180) (< (mod v_thread1Thread1of1ForFork0_~i~0_79 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_182, ~c~0=v_~c~0_92, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_79, ~N~0=v_~N~0_79} OutVars{~counter~0=v_~counter~0_180, ~c~0=v_~c~0_92, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_60|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_77, ~N~0=v_~N~0_79} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:58:29,026 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:58:29,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:58:29,189 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_55 1) (= v_~counter~0_130 (+ v_~c~0_76 v_~counter~0_131)) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_55) 4294967296) (mod v_~N~0_63 4294967296))) InVars {~counter~0=v_~counter~0_131, ~c~0=v_~c~0_76, ~N~0=v_~N~0_63} OutVars{~counter~0=v_~counter~0_130, ~c~0=v_~c~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_40|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_55, ~N~0=v_~N~0_63} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [450] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (mod v_~N~0_237 4294967296))) (and (< (mod v_thread1Thread1of1ForFork0_~i~0_254 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_253 (+ 2 v_thread1Thread1of1ForFork0_~i~0_254)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_362| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_362| (ite (< 0 (mod v_~counter~0_702 4294967296)) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_519| 1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_362| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_362|) (= v_~counter~0_700 (+ v_~counter~0_702 v_~c~0_250)) (< (mod (+ v_thread1Thread1of1ForFork0_~i~0_254 1) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_702, ~c~0=v_~c~0_250, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_254, ~N~0=v_~N~0_237} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_362|, ~counter~0=v_~counter~0_700, ~c~0=v_~c~0_250, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_186|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_253, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_370|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_362|, ~N~0=v_~N~0_237, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_519|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:29,278 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_55 1) (= v_~counter~0_130 (+ v_~c~0_76 v_~counter~0_131)) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_55) 4294967296) (mod v_~N~0_63 4294967296))) InVars {~counter~0=v_~counter~0_131, ~c~0=v_~c~0_76, ~N~0=v_~N~0_63} OutVars{~counter~0=v_~counter~0_130, ~c~0=v_~c~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_40|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_55, ~N~0=v_~N~0_63} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [451] $Ultimate##0-->L41-4: Formula: (and (< (mod v_thread1Thread1of1ForFork0_~i~0_258 4294967296) (mod v_~N~0_239 4294967296)) (= (+ v_thread1Thread1of1ForFork0_~i~0_258 1) v_thread1Thread1of1ForFork0_~i~0_257) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_364| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_521| 1) (= (ite (< 0 (mod v_~counter~0_708 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_364|) (= v_~counter~0_708 v_~counter~0_706) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_364| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_364|)) InVars {~counter~0=v_~counter~0_708, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_258, ~N~0=v_~N~0_239} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_364|, ~counter~0=v_~counter~0_706, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_188|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_257, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_372|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_364|, ~N~0=v_~N~0_239, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_521|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:29,349 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [306] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_59 3) (= v_~counter~0_140 (+ (* v_~c~0_80 3) v_~counter~0_142)) (< 2 (mod v_~N~0_67 4294967296))) InVars {~counter~0=v_~counter~0_142, ~c~0=v_~c~0_80, ~N~0=v_~N~0_67} OutVars{~counter~0=v_~counter~0_140, ~c~0=v_~c~0_80, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_42|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_59, ~N~0=v_~N~0_67} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [452] $Ultimate##0-->L41-4: Formula: (and (= v_~counter~0_714 v_~counter~0_712) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_366| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_366| (ite (< 0 (mod v_~counter~0_714 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_262 1) v_thread1Thread1of1ForFork0_~i~0_261) (< (mod v_thread1Thread1of1ForFork0_~i~0_262 4294967296) (mod v_~N~0_241 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_366| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_366|) (= |v_thread2Thread1of1ForFork1_~i~1#1_523| 1)) InVars {~counter~0=v_~counter~0_714, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_262, ~N~0=v_~N~0_241} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_366|, ~counter~0=v_~counter~0_712, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_190|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_261, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_374|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_366|, ~N~0=v_~N~0_241, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_523|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:29,425 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:58:29,487 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:58:29,532 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:29,533 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:29,660 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [350] $Ultimate##0-->L51-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_139| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_139|) (= 7 v_thread1Thread1of1ForFork0_~i~0_175) (= v_~counter~0_349 v_~counter~0_347) (not (= (ite (< 0 (mod (+ v_~counter~0_349 (* 2 v_~c~0_142)) 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_175) 4294967296) (mod v_~N~0_129 4294967296)) (= 7 |v_thread2Thread1of1ForFork1_~i~1#1_195|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_139| (ite (< 0 (mod (+ v_~counter~0_349 v_~c~0_142) 4294967296)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_139| 0))) InVars {~counter~0=v_~counter~0_349, ~c~0=v_~c~0_142, ~N~0=v_~N~0_129} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_139|, ~counter~0=v_~counter~0_347, ~c~0=v_~c~0_142, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_126|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_175, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_147|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_139|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_195|, ~N~0=v_~N~0_129} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:58:29,768 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [339] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (+ v_~counter~0_305 v_~c~0_128))) (and (= (ite (< 0 (mod (+ v_~counter~0_303 v_~c~0_128) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_116|) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_151) 4294967296) (mod v_~N~0_115 4294967296)) (= v_~counter~0_303 .cse0) (= 6 v_thread1Thread1of1ForFork0_~i~0_151) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_116| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_116|) (not (= (ite (< 0 (mod (+ v_~counter~0_305 (* 2 v_~c~0_128)) 4294967296)) 1 0) 0)) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_162|) (not (= (ite (< 0 (mod .cse0 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_305, ~c~0=v_~c~0_128, ~N~0=v_~N~0_115} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_116|, ~counter~0=v_~counter~0_303, ~c~0=v_~c~0_128, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_112|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_151, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_124|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_116|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_162|, ~N~0=v_~N~0_115} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:58:29,858 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [456] $Ultimate##0-->L41-4: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374| 0)) (= (ite (< 0 (mod v_~counter~0_738 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_374|) (= (+ v_thread1Thread1of1ForFork0_~i~0_278 1) v_thread1Thread1of1ForFork0_~i~0_277) (= v_~counter~0_738 v_~counter~0_736) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_374| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|) (= |v_thread2Thread1of1ForFork1_~i~1#1_531| 1) (< (mod v_thread1Thread1of1ForFork0_~i~0_278 4294967296) (mod v_~N~0_249 4294967296))) InVars {~counter~0=v_~counter~0_738, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_278, ~N~0=v_~N~0_249} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_374|, ~counter~0=v_~counter~0_736, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_204|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_277, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_382|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_374|, ~N~0=v_~N~0_249, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_531|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:29,858 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:29,858 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:29,928 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [457] $Ultimate##0-->L41-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_376| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_376|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_376| 0)) (= v_~counter~0_742 v_~counter~0_744) (= v_thread1Thread1of1ForFork0_~i~0_281 (+ v_thread1Thread1of1ForFork0_~i~0_282 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_282 4294967296) (mod v_~N~0_251 4294967296)) (= |v_thread2Thread1of1ForFork1_~i~1#1_533| 1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_376| (ite (< 0 (mod v_~counter~0_744 4294967296)) 1 0))) InVars {~counter~0=v_~counter~0_744, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_282, ~N~0=v_~N~0_251} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_376|, ~counter~0=v_~counter~0_742, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_206|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_281, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_384|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_376|, ~N~0=v_~N~0_251, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_533|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:29,928 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:29,928 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:29,999 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:29,999 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:30,120 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [461] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (+ (* 2 v_~c~0_270) v_~counter~0_762))) (and (= v_~counter~0_760 .cse0) (not (= (ite (< 0 (mod .cse0 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_384| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_384|) (= 7 v_thread1Thread1of1ForFork0_~i~0_293) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_384| (ite (< 0 (mod v_~counter~0_760 4294967296)) 1 0)) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_541|) (< 6 (mod v_~N~0_257 4294967296)) (not (= (ite (< 0 (mod (+ v_~counter~0_762 v_~c~0_270) 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_762, ~c~0=v_~c~0_270, ~N~0=v_~N~0_257} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_384|, ~counter~0=v_~counter~0_760, ~c~0=v_~c~0_270, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_216|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_293, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_392|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_384|, ~N~0=v_~N~0_257, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_541|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:30,120 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:30,120 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:30,227 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] L41-4-->thread1EXIT: Formula: (and (not (< (mod v_thread1Thread1of1ForFork0_~i~0_In_1 4294967296) (mod v_~N~0_In_3 4294967296))) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:30,351 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] $Ultimate##0-->L41-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_368| (ite (< 0 (mod (+ v_~counter~0_718 (* 4294967295 v_~c~0_256)) 4294967296)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_368| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_525| 1) (< 2 (mod v_~N~0_243 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_368| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_368|) (= 3 v_thread1Thread1of1ForFork0_~i~0_265) (= (+ v_~counter~0_720 (* 2 v_~c~0_256)) v_~counter~0_718)) InVars {~counter~0=v_~counter~0_720, ~c~0=v_~c~0_256, ~N~0=v_~N~0_243} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_368|, ~counter~0=v_~counter~0_718, ~c~0=v_~c~0_256, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_192|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_265, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_376|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_368|, ~N~0=v_~N~0_243, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_525|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:30,352 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:30,352 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:30,525 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [454] $Ultimate##0-->L41-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_370| (ite (< 0 (mod v_~counter~0_724 4294967296)) 1 0)) (= 2 v_thread1Thread1of1ForFork0_~i~0_269) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_370| 0)) (< 1 (mod v_~N~0_245 4294967296)) (= |v_thread2Thread1of1ForFork1_~i~1#1_527| 1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_370| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_370|) (= v_~counter~0_724 (+ v_~counter~0_726 v_~c~0_258))) InVars {~counter~0=v_~counter~0_726, ~c~0=v_~c~0_258, ~N~0=v_~N~0_245} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_370|, ~counter~0=v_~counter~0_724, ~c~0=v_~c~0_258, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_196|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_269, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_378|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_370|, ~N~0=v_~N~0_245, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_527|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:30,525 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:30,525 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:30,630 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:30,630 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:30,738 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] $Ultimate##0-->L51-4: Formula: (and (= 3 v_thread1Thread1of1ForFork0_~i~0_315) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_406| (ite (< 0 (mod (+ v_~counter~0_800 v_~c~0_284) 4294967296)) 1 0)) (not (= (ite (< 0 (mod v_~counter~0_800 4294967296)) 1 0) 0)) (= v_~counter~0_800 (+ v_~counter~0_802 v_~c~0_284)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_565|) (< 2 (mod v_~N~0_271 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_406| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_406| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_406|)) InVars {~counter~0=v_~counter~0_802, ~c~0=v_~c~0_284, ~N~0=v_~N~0_271} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_406|, ~counter~0=v_~counter~0_800, ~c~0=v_~c~0_284, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_232|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_315, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_414|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_406|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_565|, ~N~0=v_~N~0_271} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:58:30,812 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_55 1) (= v_~counter~0_130 (+ v_~c~0_76 v_~counter~0_131)) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_55) 4294967296) (mod v_~N~0_63 4294967296))) InVars {~counter~0=v_~counter~0_131, ~c~0=v_~c~0_76, ~N~0=v_~N~0_63} OutVars{~counter~0=v_~counter~0_130, ~c~0=v_~c~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_40|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_55, ~N~0=v_~N~0_63} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [295] $Ultimate##0-->L51-4: Formula: (and (= (ite (< 0 (mod v_~counter~0_91 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= 1 |v_thread2Thread1of1ForFork1_~i~1#1_35|) (= (+ v_~c~0_64 v_~counter~0_90) v_~counter~0_91) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (< 0 (mod v_~N~0_51 4294967296))) InVars {~counter~0=v_~counter~0_91, ~c~0=v_~c~0_64, ~N~0=v_~N~0_51} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~counter~0=v_~counter~0_90, ~c~0=v_~c~0_64, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_35|, ~N~0=v_~N~0_51} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:30,885 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [303] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_55 1) (= v_~counter~0_130 (+ v_~c~0_76 v_~counter~0_131)) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_55) 4294967296) (mod v_~N~0_63 4294967296))) InVars {~counter~0=v_~counter~0_131, ~c~0=v_~c~0_76, ~N~0=v_~N~0_63} OutVars{~counter~0=v_~counter~0_130, ~c~0=v_~c~0_76, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_40|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_55, ~N~0=v_~N~0_63} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [465] $Ultimate##0-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod v_~counter~0_774 4294967296)) 1 0)) (.cse0 (mod v_~N~0_261 4294967296))) (and (< 1 .cse0) (not (= .cse1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_302 1) v_thread1Thread1of1ForFork0_~i~0_301) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_547|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_390| .cse1) (< (mod v_thread1Thread1of1ForFork0_~i~0_302 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_390| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_390|) (= v_~counter~0_774 (+ v_~counter~0_772 v_~c~0_274)))) InVars {~counter~0=v_~counter~0_774, ~c~0=v_~c~0_274, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_302, ~N~0=v_~N~0_261} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_390|, ~counter~0=v_~counter~0_772, ~c~0=v_~c~0_274, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_222|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_301, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_398|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_390|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_547|, ~N~0=v_~N~0_261} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:58:30,988 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~counter~0_812 v_~c~0_288) 4294967296)) 1 0))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_571|) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_412| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_412|) (= 2 v_thread1Thread1of1ForFork0_~i~0_321) (= v_~counter~0_814 v_~counter~0_812) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_412| .cse0) (< 1 (mod v_~N~0_275 4294967296)))) InVars {~counter~0=v_~counter~0_814, ~c~0=v_~c~0_288, ~N~0=v_~N~0_275} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_412|, ~counter~0=v_~counter~0_812, ~c~0=v_~c~0_288, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_238|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_321, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_420|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_412|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_571|, ~N~0=v_~N~0_275} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:58:31,075 INFO L241 LiptonReduction]: Total number of compositions: 20 [2022-12-13 01:58:31,075 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2384 [2022-12-13 01:58:31,075 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 257 transitions, 6699 flow [2022-12-13 01:58:31,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 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-13 01:58:31,075 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:31,075 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:31,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-13 01:58:31,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:31,276 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:31,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:31,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1017997240, now seen corresponding path program 1 times [2022-12-13 01:58:31,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:31,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220512188] [2022-12-13 01:58:31,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:31,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:31,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:31,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:31,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220512188] [2022-12-13 01:58:31,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220512188] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:31,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726637715] [2022-12-13 01:58:31,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:31,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:31,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:31,335 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:58:31,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 01:58:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:31,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 01:58:31,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:31,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:31,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:31,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:31,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726637715] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:31,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:31,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 01:58:31,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149468711] [2022-12-13 01:58:31,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:31,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:58:31,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:31,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:58:31,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:58:31,461 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 01:58:31,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 257 transitions, 6699 flow. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:31,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:31,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 01:58:31,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:32,426 INFO L130 PetriNetUnfolder]: 1293/2713 cut-off events. [2022-12-13 01:58:32,426 INFO L131 PetriNetUnfolder]: For 179794/179794 co-relation queries the response was YES. [2022-12-13 01:58:32,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29887 conditions, 2713 events. 1293/2713 cut-off events. For 179794/179794 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 20197 event pairs, 563 based on Foata normal form. 58/2767 useless extension candidates. Maximal degree in co-relation 29373. Up to 2352 conditions per place. [2022-12-13 01:58:32,446 INFO L137 encePairwiseOnDemand]: 24/51 looper letters, 239 selfloop transitions, 77 changer transitions 6/322 dead transitions. [2022-12-13 01:58:32,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 322 transitions, 8569 flow [2022-12-13 01:58:32,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:58:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:58:32,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2022-12-13 01:58:32,447 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20833333333333334 [2022-12-13 01:58:32,447 INFO L175 Difference]: Start difference. First operand has 190 places, 257 transitions, 6699 flow. Second operand 8 states and 85 transitions. [2022-12-13 01:58:32,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 322 transitions, 8569 flow [2022-12-13 01:58:32,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 322 transitions, 8001 flow, removed 192 selfloop flow, removed 16 redundant places. [2022-12-13 01:58:32,710 INFO L231 Difference]: Finished difference. Result has 184 places, 275 transitions, 6970 flow [2022-12-13 01:58:32,710 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=6178, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6970, PETRI_PLACES=184, PETRI_TRANSITIONS=275} [2022-12-13 01:58:32,711 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 164 predicate places. [2022-12-13 01:58:32,711 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:32,711 INFO L89 Accepts]: Start accepts. Operand has 184 places, 275 transitions, 6970 flow [2022-12-13 01:58:32,712 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:32,712 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:32,712 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 275 transitions, 6970 flow [2022-12-13 01:58:32,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 275 transitions, 6970 flow [2022-12-13 01:58:32,826 INFO L130 PetriNetUnfolder]: 264/1060 cut-off events. [2022-12-13 01:58:32,827 INFO L131 PetriNetUnfolder]: For 44554/44572 co-relation queries the response was YES. [2022-12-13 01:58:32,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10035 conditions, 1060 events. 264/1060 cut-off events. For 44554/44572 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 9818 event pairs, 23 based on Foata normal form. 0/1054 useless extension candidates. Maximal degree in co-relation 9684. Up to 292 conditions per place. [2022-12-13 01:58:32,839 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 275 transitions, 6970 flow [2022-12-13 01:58:32,839 INFO L226 LiptonReduction]: Number of co-enabled transitions 840 [2022-12-13 01:58:32,841 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:58:32,841 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 01:58:32,841 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 275 transitions, 6970 flow [2022-12-13 01:58:32,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:32,842 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:32,842 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:32,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-13 01:58:33,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:33,047 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:33,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:33,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1653430944, now seen corresponding path program 1 times [2022-12-13 01:58:33,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:33,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539278735] [2022-12-13 01:58:33,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:33,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:33,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:33,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:33,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539278735] [2022-12-13 01:58:33,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539278735] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:58:33,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573081010] [2022-12-13 01:58:33,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:33,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:58:33,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:58:33,113 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:58:33,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 01:58:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:33,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 01:58:33,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:58:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:33,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:58:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:33,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573081010] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:58:33,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:58:33,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-13 01:58:33,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669013424] [2022-12-13 01:58:33,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:58:33,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:58:33,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:33,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:58:33,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:58:33,228 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:58:33,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 275 transitions, 6970 flow. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:33,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:33,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:58:33,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:34,167 INFO L130 PetriNetUnfolder]: 1336/2797 cut-off events. [2022-12-13 01:58:34,167 INFO L131 PetriNetUnfolder]: For 168403/168403 co-relation queries the response was YES. [2022-12-13 01:58:34,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30536 conditions, 2797 events. 1336/2797 cut-off events. For 168403/168403 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 20898 event pairs, 516 based on Foata normal form. 18/2811 useless extension candidates. Maximal degree in co-relation 29479. Up to 2293 conditions per place. [2022-12-13 01:58:34,189 INFO L137 encePairwiseOnDemand]: 12/46 looper letters, 225 selfloop transitions, 99 changer transitions 6/330 dead transitions. [2022-12-13 01:58:34,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 330 transitions, 8562 flow [2022-12-13 01:58:34,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:58:34,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:58:34,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-13 01:58:34,190 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2608695652173913 [2022-12-13 01:58:34,190 INFO L175 Difference]: Start difference. First operand has 177 places, 275 transitions, 6970 flow. Second operand 7 states and 84 transitions. [2022-12-13 01:58:34,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 330 transitions, 8562 flow [2022-12-13 01:58:34,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 330 transitions, 8314 flow, removed 108 selfloop flow, removed 7 redundant places. [2022-12-13 01:58:34,501 INFO L231 Difference]: Finished difference. Result has 178 places, 288 transitions, 7391 flow [2022-12-13 01:58:34,502 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6775, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7391, PETRI_PLACES=178, PETRI_TRANSITIONS=288} [2022-12-13 01:58:34,502 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 158 predicate places. [2022-12-13 01:58:34,502 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:34,502 INFO L89 Accepts]: Start accepts. Operand has 178 places, 288 transitions, 7391 flow [2022-12-13 01:58:34,503 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:34,503 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:34,503 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 288 transitions, 7391 flow [2022-12-13 01:58:34,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 288 transitions, 7391 flow [2022-12-13 01:58:34,634 INFO L130 PetriNetUnfolder]: 278/1118 cut-off events. [2022-12-13 01:58:34,634 INFO L131 PetriNetUnfolder]: For 43624/43639 co-relation queries the response was YES. [2022-12-13 01:58:34,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10357 conditions, 1118 events. 278/1118 cut-off events. For 43624/43639 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 10563 event pairs, 20 based on Foata normal form. 0/1111 useless extension candidates. Maximal degree in co-relation 10027. Up to 302 conditions per place. [2022-12-13 01:58:34,646 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 288 transitions, 7391 flow [2022-12-13 01:58:34,646 INFO L226 LiptonReduction]: Number of co-enabled transitions 890 [2022-12-13 01:58:34,652 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:34,652 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:46,854 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:46,854 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:58:52,007 WARN L233 SmtUtils]: Spent 5.15s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 01:59:02,763 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:02,764 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:06,508 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:06,509 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32007 [2022-12-13 01:59:06,509 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 289 transitions, 7482 flow [2022-12-13 01:59:06,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:06,509 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:06,509 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:06,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-13 01:59:06,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:59:06,714 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:06,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:06,714 INFO L85 PathProgramCache]: Analyzing trace with hash -440847768, now seen corresponding path program 2 times [2022-12-13 01:59:06,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:06,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961867115] [2022-12-13 01:59:06,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:06,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:06,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:06,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:06,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961867115] [2022-12-13 01:59:06,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961867115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:06,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:06,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:59:06,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988408882] [2022-12-13 01:59:06,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:06,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:59:06,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:06,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:59:06,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:59:06,777 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 01:59:06,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 289 transitions, 7482 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:06,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:06,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 01:59:06,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:08,076 INFO L130 PetriNetUnfolder]: 1377/2918 cut-off events. [2022-12-13 01:59:08,076 INFO L131 PetriNetUnfolder]: For 166432/166432 co-relation queries the response was YES. [2022-12-13 01:59:08,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31904 conditions, 2918 events. 1377/2918 cut-off events. For 166432/166432 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 22211 event pairs, 318 based on Foata normal form. 2/2916 useless extension candidates. Maximal degree in co-relation 30859. Up to 1476 conditions per place. [2022-12-13 01:59:08,098 INFO L137 encePairwiseOnDemand]: 15/48 looper letters, 209 selfloop transitions, 103 changer transitions 5/317 dead transitions. [2022-12-13 01:59:08,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 317 transitions, 8625 flow [2022-12-13 01:59:08,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:08,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-13 01:59:08,099 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.275 [2022-12-13 01:59:08,099 INFO L175 Difference]: Start difference. First operand has 178 places, 289 transitions, 7482 flow. Second operand 5 states and 66 transitions. [2022-12-13 01:59:08,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 317 transitions, 8625 flow [2022-12-13 01:59:08,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 317 transitions, 8519 flow, removed 53 selfloop flow, removed 0 redundant places. [2022-12-13 01:59:08,375 INFO L231 Difference]: Finished difference. Result has 184 places, 292 transitions, 7695 flow [2022-12-13 01:59:08,375 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7323, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7695, PETRI_PLACES=184, PETRI_TRANSITIONS=292} [2022-12-13 01:59:08,376 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 164 predicate places. [2022-12-13 01:59:08,376 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:08,376 INFO L89 Accepts]: Start accepts. Operand has 184 places, 292 transitions, 7695 flow [2022-12-13 01:59:08,379 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:08,379 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:08,381 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 292 transitions, 7695 flow [2022-12-13 01:59:08,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 292 transitions, 7695 flow [2022-12-13 01:59:08,518 INFO L130 PetriNetUnfolder]: 273/1136 cut-off events. [2022-12-13 01:59:08,518 INFO L131 PetriNetUnfolder]: For 50871/50888 co-relation queries the response was YES. [2022-12-13 01:59:08,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11029 conditions, 1136 events. 273/1136 cut-off events. For 50871/50888 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 10858 event pairs, 19 based on Foata normal form. 0/1128 useless extension candidates. Maximal degree in co-relation 10668. Up to 307 conditions per place. [2022-12-13 01:59:08,531 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 292 transitions, 7695 flow [2022-12-13 01:59:08,531 INFO L226 LiptonReduction]: Number of co-enabled transitions 894 [2022-12-13 01:59:08,535 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [478] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~counter~0_820 v_~c~0_290) 4294967296)) 1 0))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_416| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_416|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_416| .cse0) (= 3 v_thread1Thread1of1ForFork0_~i~0_323) (not (= (ite (< 0 (mod (+ v_~counter~0_820 (* 2 v_~c~0_290)) 4294967296)) 1 0) 0)) (not (= .cse0 0)) (= v_~counter~0_820 v_~counter~0_818) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_575|) 4294967296) (mod v_~N~0_277 4294967296)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_575|))) InVars {~counter~0=v_~counter~0_820, ~c~0=v_~c~0_290, ~N~0=v_~N~0_277} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_416|, ~counter~0=v_~counter~0_818, ~c~0=v_~c~0_290, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_240|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_323, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_424|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_416|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_575|, ~N~0=v_~N~0_277} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:59:08,647 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:08,647 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 271 [2022-12-13 01:59:08,647 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 291 transitions, 7689 flow [2022-12-13 01:59:08,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:08,648 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:08,648 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:08,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 01:59:08,648 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:08,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:08,648 INFO L85 PathProgramCache]: Analyzing trace with hash -524828067, now seen corresponding path program 1 times [2022-12-13 01:59:08,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:08,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122794116] [2022-12-13 01:59:08,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:08,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:08,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:08,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122794116] [2022-12-13 01:59:08,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122794116] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:59:08,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275657475] [2022-12-13 01:59:08,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:08,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:59:08,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:59:08,747 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:59:08,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 01:59:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:08,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 01:59:08,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:59:08,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:08,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:59:08,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:08,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275657475] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:59:08,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:59:08,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 01:59:08,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265941877] [2022-12-13 01:59:08,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:59:08,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:59:08,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:08,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:59:08,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:59:08,863 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:59:08,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 291 transitions, 7689 flow. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:08,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:08,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:59:08,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:10,030 INFO L130 PetriNetUnfolder]: 1610/3427 cut-off events. [2022-12-13 01:59:10,030 INFO L131 PetriNetUnfolder]: For 222623/222623 co-relation queries the response was YES. [2022-12-13 01:59:10,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38969 conditions, 3427 events. 1610/3427 cut-off events. For 222623/222623 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 26883 event pairs, 176 based on Foata normal form. 34/3457 useless extension candidates. Maximal degree in co-relation 37897. Up to 1570 conditions per place. [2022-12-13 01:59:10,060 INFO L137 encePairwiseOnDemand]: 12/47 looper letters, 104 selfloop transitions, 250 changer transitions 14/368 dead transitions. [2022-12-13 01:59:10,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 368 transitions, 9772 flow [2022-12-13 01:59:10,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 01:59:10,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 01:59:10,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2022-12-13 01:59:10,061 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1717325227963526 [2022-12-13 01:59:10,061 INFO L175 Difference]: Start difference. First operand has 183 places, 291 transitions, 7689 flow. Second operand 14 states and 113 transitions. [2022-12-13 01:59:10,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 368 transitions, 9772 flow [2022-12-13 01:59:10,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 368 transitions, 9649 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 01:59:10,489 INFO L231 Difference]: Finished difference. Result has 200 places, 320 transitions, 9266 flow [2022-12-13 01:59:10,490 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=7568, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=9266, PETRI_PLACES=200, PETRI_TRANSITIONS=320} [2022-12-13 01:59:10,490 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 180 predicate places. [2022-12-13 01:59:10,490 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:10,490 INFO L89 Accepts]: Start accepts. Operand has 200 places, 320 transitions, 9266 flow [2022-12-13 01:59:10,493 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:10,493 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:10,493 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 320 transitions, 9266 flow [2022-12-13 01:59:10,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 320 transitions, 9266 flow [2022-12-13 01:59:10,678 INFO L130 PetriNetUnfolder]: 316/1318 cut-off events. [2022-12-13 01:59:10,678 INFO L131 PetriNetUnfolder]: For 76960/76960 co-relation queries the response was YES. [2022-12-13 01:59:10,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14525 conditions, 1318 events. 316/1318 cut-off events. For 76960/76960 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 13067 event pairs, 19 based on Foata normal form. 0/1308 useless extension candidates. Maximal degree in co-relation 14139. Up to 395 conditions per place. [2022-12-13 01:59:10,697 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 320 transitions, 9266 flow [2022-12-13 01:59:10,698 INFO L226 LiptonReduction]: Number of co-enabled transitions 974 [2022-12-13 01:59:10,702 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:59:10,762 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] L41-4-->thread1EXIT: Formula: (and (not (< (mod v_thread1Thread1of1ForFork0_~i~0_In_1 4294967296) (mod v_~N~0_In_3 4294967296))) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:10,845 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] L41-4-->thread1EXIT: Formula: (and (not (< (mod v_thread1Thread1of1ForFork0_~i~0_In_1 4294967296) (mod v_~N~0_In_3 4294967296))) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:10,925 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] L41-4-->thread1EXIT: Formula: (and (not (< (mod v_thread1Thread1of1ForFork0_~i~0_In_1 4294967296) (mod v_~N~0_In_3 4294967296))) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:11,021 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:59:11,021 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 531 [2022-12-13 01:59:11,022 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 319 transitions, 9284 flow [2022-12-13 01:59:11,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:11,022 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:11,022 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:11,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-13 01:59:11,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-13 01:59:11,222 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:11,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:11,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1018995036, now seen corresponding path program 1 times [2022-12-13 01:59:11,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:11,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431807239] [2022-12-13 01:59:11,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:11,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:11,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:11,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431807239] [2022-12-13 01:59:11,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431807239] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:59:11,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110319555] [2022-12-13 01:59:11,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:11,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:59:11,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:59:11,307 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:59:11,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 01:59:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:11,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 01:59:11,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:59:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:11,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:59:11,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:11,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110319555] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:59:11,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:59:11,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-13 01:59:11,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417323086] [2022-12-13 01:59:11,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:59:11,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:59:11,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:11,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:59:11,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:59:11,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 01:59:11,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 319 transitions, 9284 flow. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:11,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:11,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 01:59:11,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:12,933 INFO L130 PetriNetUnfolder]: 1671/3535 cut-off events. [2022-12-13 01:59:12,933 INFO L131 PetriNetUnfolder]: For 297086/297086 co-relation queries the response was YES. [2022-12-13 01:59:12,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43898 conditions, 3535 events. 1671/3535 cut-off events. For 297086/297086 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 27832 event pairs, 698 based on Foata normal form. 46/3577 useless extension candidates. Maximal degree in co-relation 42673. Up to 2967 conditions per place. [2022-12-13 01:59:12,968 INFO L137 encePairwiseOnDemand]: 20/51 looper letters, 271 selfloop transitions, 124 changer transitions 7/402 dead transitions. [2022-12-13 01:59:12,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 402 transitions, 11659 flow [2022-12-13 01:59:12,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 01:59:12,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 01:59:12,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 109 transitions. [2022-12-13 01:59:12,969 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15266106442577032 [2022-12-13 01:59:12,969 INFO L175 Difference]: Start difference. First operand has 197 places, 319 transitions, 9284 flow. Second operand 14 states and 109 transitions. [2022-12-13 01:59:12,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 402 transitions, 11659 flow [2022-12-13 01:59:13,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 402 transitions, 11355 flow, removed 143 selfloop flow, removed 2 redundant places. [2022-12-13 01:59:13,711 INFO L231 Difference]: Finished difference. Result has 214 places, 343 transitions, 10135 flow [2022-12-13 01:59:13,711 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=9062, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=10135, PETRI_PLACES=214, PETRI_TRANSITIONS=343} [2022-12-13 01:59:13,711 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 194 predicate places. [2022-12-13 01:59:13,711 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:13,711 INFO L89 Accepts]: Start accepts. Operand has 214 places, 343 transitions, 10135 flow [2022-12-13 01:59:13,713 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:13,713 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:13,713 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 343 transitions, 10135 flow [2022-12-13 01:59:13,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 343 transitions, 10135 flow [2022-12-13 01:59:13,898 INFO L130 PetriNetUnfolder]: 332/1377 cut-off events. [2022-12-13 01:59:13,898 INFO L131 PetriNetUnfolder]: For 81430/81430 co-relation queries the response was YES. [2022-12-13 01:59:13,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15191 conditions, 1377 events. 332/1377 cut-off events. For 81430/81430 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 13719 event pairs, 19 based on Foata normal form. 0/1370 useless extension candidates. Maximal degree in co-relation 14770. Up to 381 conditions per place. [2022-12-13 01:59:13,917 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 343 transitions, 10135 flow [2022-12-13 01:59:13,917 INFO L226 LiptonReduction]: Number of co-enabled transitions 1052 [2022-12-13 01:59:13,928 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [479] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (+ v_~counter~0_826 (* 2 v_~c~0_292)))) (and (= v_thread1Thread1of1ForFork0_~i~0_325 4) (= v_~counter~0_824 .cse0) (not (= (ite (< 0 (mod (+ v_~counter~0_826 v_~c~0_292) 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_579|) (< 3 (mod v_~N~0_279 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_420| (ite (< 0 (mod .cse0 4294967296)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_420| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_420| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_420|))) InVars {~counter~0=v_~counter~0_826, ~c~0=v_~c~0_292, ~N~0=v_~N~0_279} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_420|, ~counter~0=v_~counter~0_824, ~c~0=v_~c~0_292, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_242|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_325, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_428|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_420|, ~N~0=v_~N~0_279, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_579|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:13,928 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:13,928 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:14,277 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [293] L41-4-->thread1EXIT: Formula: (and (not (< (mod v_thread1Thread1of1ForFork0_~i~0_In_1 4294967296) (mod v_~N~0_In_3 4294967296))) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] [2022-12-13 01:59:14,357 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:14,358 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:14,446 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:59:14,447 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 736 [2022-12-13 01:59:14,447 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 342 transitions, 10233 flow [2022-12-13 01:59:14,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:14,447 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:14,447 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:14,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-13 01:59:14,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-13 01:59:14,648 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:14,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:14,648 INFO L85 PathProgramCache]: Analyzing trace with hash 198287905, now seen corresponding path program 1 times [2022-12-13 01:59:14,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:14,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088014354] [2022-12-13 01:59:14,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:14,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:14,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:14,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088014354] [2022-12-13 01:59:14,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088014354] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:59:14,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922933279] [2022-12-13 01:59:14,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:14,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:59:14,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:59:14,719 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:59:14,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-13 01:59:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:14,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 01:59:14,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:59:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:14,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:59:14,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:14,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922933279] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:59:14,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:59:14,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 01:59:14,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306612075] [2022-12-13 01:59:14,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:59:14,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:59:14,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:14,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:59:14,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:59:14,844 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-13 01:59:14,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 342 transitions, 10233 flow. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:14,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:14,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-13 01:59:14,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:16,079 INFO L130 PetriNetUnfolder]: 1776/3720 cut-off events. [2022-12-13 01:59:16,079 INFO L131 PetriNetUnfolder]: For 339425/339425 co-relation queries the response was YES. [2022-12-13 01:59:16,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46578 conditions, 3720 events. 1776/3720 cut-off events. For 339425/339425 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 29345 event pairs, 637 based on Foata normal form. 110/3826 useless extension candidates. Maximal degree in co-relation 45223. Up to 2790 conditions per place. [2022-12-13 01:59:16,115 INFO L137 encePairwiseOnDemand]: 12/55 looper letters, 200 selfloop transitions, 220 changer transitions 14/434 dead transitions. [2022-12-13 01:59:16,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 434 transitions, 13078 flow [2022-12-13 01:59:16,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:59:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:59:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2022-12-13 01:59:16,117 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18 [2022-12-13 01:59:16,117 INFO L175 Difference]: Start difference. First operand has 212 places, 342 transitions, 10233 flow. Second operand 10 states and 99 transitions. [2022-12-13 01:59:16,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 434 transitions, 13078 flow [2022-12-13 01:59:16,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 434 transitions, 12617 flow, removed 181 selfloop flow, removed 5 redundant places. [2022-12-13 01:59:16,801 INFO L231 Difference]: Finished difference. Result has 221 places, 379 transitions, 11571 flow [2022-12-13 01:59:16,801 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=9808, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11571, PETRI_PLACES=221, PETRI_TRANSITIONS=379} [2022-12-13 01:59:16,802 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 201 predicate places. [2022-12-13 01:59:16,802 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:16,802 INFO L89 Accepts]: Start accepts. Operand has 221 places, 379 transitions, 11571 flow [2022-12-13 01:59:16,804 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:16,804 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:16,804 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 379 transitions, 11571 flow [2022-12-13 01:59:16,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 379 transitions, 11571 flow [2022-12-13 01:59:16,990 INFO L130 PetriNetUnfolder]: 356/1436 cut-off events. [2022-12-13 01:59:16,991 INFO L131 PetriNetUnfolder]: For 86799/86799 co-relation queries the response was YES. [2022-12-13 01:59:16,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16308 conditions, 1436 events. 356/1436 cut-off events. For 86799/86799 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 14377 event pairs, 19 based on Foata normal form. 0/1426 useless extension candidates. Maximal degree in co-relation 15866. Up to 391 conditions per place. [2022-12-13 01:59:17,009 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 379 transitions, 11571 flow [2022-12-13 01:59:17,009 INFO L226 LiptonReduction]: Number of co-enabled transitions 1164 [2022-12-13 01:59:17,010 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:59:17,011 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-13 01:59:17,011 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 379 transitions, 11571 flow [2022-12-13 01:59:17,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:17,011 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:17,011 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:17,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-13 01:59:17,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-13 01:59:17,215 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:17,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:17,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2047190432, now seen corresponding path program 1 times [2022-12-13 01:59:17,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:17,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584473966] [2022-12-13 01:59:17,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:17,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:17,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:17,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584473966] [2022-12-13 01:59:17,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584473966] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:59:17,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853012812] [2022-12-13 01:59:17,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:17,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:59:17,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:59:17,297 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:59:17,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-13 01:59:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:17,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 01:59:17,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:59:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:17,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:59:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:17,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853012812] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:59:17,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:59:17,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2022-12-13 01:59:17,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714442053] [2022-12-13 01:59:17,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:59:17,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:59:17,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:17,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:59:17,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:59:17,443 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 01:59:17,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 379 transitions, 11571 flow. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:17,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:17,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 01:59:17,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:19,075 INFO L130 PetriNetUnfolder]: 1842/3847 cut-off events. [2022-12-13 01:59:19,076 INFO L131 PetriNetUnfolder]: For 318301/318301 co-relation queries the response was YES. [2022-12-13 01:59:19,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49584 conditions, 3847 events. 1842/3847 cut-off events. For 318301/318301 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 30389 event pairs, 368 based on Foata normal form. 12/3855 useless extension candidates. Maximal degree in co-relation 48261. Up to 3240 conditions per place. [2022-12-13 01:59:19,109 INFO L137 encePairwiseOnDemand]: 27/53 looper letters, 335 selfloop transitions, 82 changer transitions 28/445 dead transitions. [2022-12-13 01:59:19,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 445 transitions, 13977 flow [2022-12-13 01:59:19,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-12-13 01:59:19,114 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32075471698113206 [2022-12-13 01:59:19,114 INFO L175 Difference]: Start difference. First operand has 220 places, 379 transitions, 11571 flow. Second operand 5 states and 85 transitions. [2022-12-13 01:59:19,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 445 transitions, 13977 flow [2022-12-13 01:59:19,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 445 transitions, 13611 flow, removed 172 selfloop flow, removed 3 redundant places. [2022-12-13 01:59:19,859 INFO L231 Difference]: Finished difference. Result has 224 places, 397 transitions, 12173 flow [2022-12-13 01:59:19,859 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=11207, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=12173, PETRI_PLACES=224, PETRI_TRANSITIONS=397} [2022-12-13 01:59:19,860 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 204 predicate places. [2022-12-13 01:59:19,860 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:19,860 INFO L89 Accepts]: Start accepts. Operand has 224 places, 397 transitions, 12173 flow [2022-12-13 01:59:19,862 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:19,863 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:19,863 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 397 transitions, 12173 flow [2022-12-13 01:59:19,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 224 places, 397 transitions, 12173 flow [2022-12-13 01:59:20,116 INFO L130 PetriNetUnfolder]: 377/1505 cut-off events. [2022-12-13 01:59:20,116 INFO L131 PetriNetUnfolder]: For 93519/93519 co-relation queries the response was YES. [2022-12-13 01:59:20,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17356 conditions, 1505 events. 377/1505 cut-off events. For 93519/93519 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 15186 event pairs, 25 based on Foata normal form. 0/1498 useless extension candidates. Maximal degree in co-relation 16953. Up to 414 conditions per place. [2022-12-13 01:59:20,144 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 397 transitions, 12173 flow [2022-12-13 01:59:20,144 INFO L226 LiptonReduction]: Number of co-enabled transitions 1204 [2022-12-13 01:59:20,145 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [474] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~counter~0_808 v_~c~0_286) 4294967296)) 1 0))) (and (not (= (ite (< 0 (mod (+ v_~counter~0_808 (* 2 v_~c~0_286)) 4294967296)) 1 0) 0)) (= v_~counter~0_806 (+ v_~counter~0_808 (* 3 v_~c~0_286))) (= 9 v_thread1Thread1of1ForFork0_~i~0_317) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_410| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_410|) (< 8 (mod v_~N~0_273 4294967296)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_569|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_410| .cse0))) InVars {~counter~0=v_~counter~0_808, ~c~0=v_~c~0_286, ~N~0=v_~N~0_273} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_410|, ~counter~0=v_~counter~0_806, ~c~0=v_~c~0_286, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_234|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_317, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_418|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_410|, ~N~0=v_~N~0_273, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_569|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:20,145 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:20,145 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:20,311 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [471] $Ultimate##0-->L41-4: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_404| 0)) (= v_~counter~0_794 (+ v_~counter~0_796 (* 3 v_~c~0_282))) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_311) 4294967296) (mod v_~N~0_269 4294967296)) (= v_thread1Thread1of1ForFork0_~i~0_311 4) (= (ite (< 0 (mod (+ v_~counter~0_796 v_~c~0_282) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_404|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_404| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_404|) (= |v_thread2Thread1of1ForFork1_~i~1#1_563| 1)) InVars {~counter~0=v_~counter~0_796, ~c~0=v_~c~0_282, ~N~0=v_~N~0_269} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_404|, ~counter~0=v_~counter~0_794, ~c~0=v_~c~0_282, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_228|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_311, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_412|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_404|, ~N~0=v_~N~0_269, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_563|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:20,311 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:20,311 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:20,416 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [455] $Ultimate##0-->L41-4: Formula: (and (= |v_thread2Thread1of1ForFork1_~i~1#1_529| 1) (= v_thread1Thread1of1ForFork0_~i~0_273 4) (= v_~counter~0_730 (+ v_~counter~0_732 (* 3 v_~c~0_260))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_372| (ite (< 0 (mod v_~counter~0_730 4294967296)) 1 0)) (< 3 (mod v_~N~0_247 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_372| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_372| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_372|)) InVars {~counter~0=v_~counter~0_732, ~c~0=v_~c~0_260, ~N~0=v_~N~0_247} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_372|, ~counter~0=v_~counter~0_730, ~c~0=v_~c~0_260, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_200|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_273, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_380|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_372|, ~N~0=v_~N~0_247, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_529|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:20,416 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:20,416 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:20,504 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~counter~0_916 (* 2 v_~c~0_320)) 4294967296)) 1 0))) (and (= v_thread1Thread1of1ForFork0_~i~0_372 8) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_643|) (= (+ v_~counter~0_916 (* 3 v_~c~0_320)) v_~counter~0_914) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_465| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_465|) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_372) 4294967296) (mod v_~N~0_307 4294967296)) (not (= (ite (< 0 (mod (+ v_~counter~0_916 v_~c~0_320) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_465| .cse0) (not (= .cse0 0)))) InVars {~counter~0=v_~counter~0_916, ~c~0=v_~c~0_320, ~N~0=v_~N~0_307} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_465|, ~counter~0=v_~counter~0_914, ~c~0=v_~c~0_320, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_275|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_372, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_473|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_465|, ~N~0=v_~N~0_307, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_643|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [498] L51-4-->thread1EXIT: Formula: (let ((.cse0 (mod v_~N~0_309 4294967296))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467| 0)) (not (< (mod v_thread1Thread1of1ForFork0_~i~0_376 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_#res.offset_76| 0) (= v_~counter~0_921 (+ v_~counter~0_920 v_~c~0_322)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_646| 4294967296) .cse0) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_646| 1) |v_thread2Thread1of1ForFork1_~i~1#1_645|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467| (ite (< 0 (mod v_~counter~0_921 4294967296)) 1 0)) (= |v_thread1Thread1of1ForFork0_#res.base_76| 0))) InVars {~counter~0=v_~counter~0_921, ~c~0=v_~c~0_322, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_376, ~N~0=v_~N~0_309, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_646|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467|, ~counter~0=v_~counter~0_920, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_76|, ~c~0=v_~c~0_322, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_376, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_76|, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_475|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467|, ~N~0=v_~N~0_309, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_645|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:20,504 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:20,504 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:20,721 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:20,721 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:20,932 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~counter~0_916 (* 2 v_~c~0_320)) 4294967296)) 1 0))) (and (= v_thread1Thread1of1ForFork0_~i~0_372 8) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_643|) (= (+ v_~counter~0_916 (* 3 v_~c~0_320)) v_~counter~0_914) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_465| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_465|) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_372) 4294967296) (mod v_~N~0_307 4294967296)) (not (= (ite (< 0 (mod (+ v_~counter~0_916 v_~c~0_320) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_465| .cse0) (not (= .cse0 0)))) InVars {~counter~0=v_~counter~0_916, ~c~0=v_~c~0_320, ~N~0=v_~N~0_307} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_465|, ~counter~0=v_~counter~0_914, ~c~0=v_~c~0_320, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_275|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_372, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_473|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_465|, ~N~0=v_~N~0_307, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_643|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:20,932 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:20,933 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:21,116 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~counter~0_916 (* 2 v_~c~0_320)) 4294967296)) 1 0))) (and (= v_thread1Thread1of1ForFork0_~i~0_372 8) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_643|) (= (+ v_~counter~0_916 (* 3 v_~c~0_320)) v_~counter~0_914) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_465| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_465|) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_372) 4294967296) (mod v_~N~0_307 4294967296)) (not (= (ite (< 0 (mod (+ v_~counter~0_916 v_~c~0_320) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_465| .cse0) (not (= .cse0 0)))) InVars {~counter~0=v_~counter~0_916, ~c~0=v_~c~0_320, ~N~0=v_~N~0_307} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_465|, ~counter~0=v_~counter~0_914, ~c~0=v_~c~0_320, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_275|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_372, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_473|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_465|, ~N~0=v_~N~0_307, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_643|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [500] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_311 4294967296))) (and (not (= (ite (< 0 (mod v_~counter~0_926 4294967296)) 1 0) 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_651|) |v_thread2Thread1of1ForFork1_~i~1#1_649|) (= v_~counter~0_926 (+ v_~counter~0_924 (* 2 v_~c~0_324))) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_651| 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_649|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_469| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_469|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_469| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_469| (ite (< 0 (mod (+ v_~counter~0_924 v_~c~0_324) 4294967296)) 1 0)))) InVars {~counter~0=v_~counter~0_926, ~c~0=v_~c~0_324, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_651|, ~N~0=v_~N~0_311} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_469|, ~counter~0=v_~counter~0_924, ~c~0=v_~c~0_324, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_477|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_469|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_649|, ~N~0=v_~N~0_311} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:21,117 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:21,117 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:21,360 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 01:59:21,361 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1501 [2022-12-13 01:59:21,361 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 397 transitions, 12330 flow [2022-12-13 01:59:21,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:21,361 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:21,361 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:21,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-13 01:59:21,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-13 01:59:21,566 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:21,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:21,566 INFO L85 PathProgramCache]: Analyzing trace with hash 743260258, now seen corresponding path program 1 times [2022-12-13 01:59:21,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:21,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047403141] [2022-12-13 01:59:21,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:21,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:21,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:21,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047403141] [2022-12-13 01:59:21,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047403141] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:59:21,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223043945] [2022-12-13 01:59:21,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:21,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:59:21,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:59:21,658 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:59:21,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-13 01:59:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:21,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 01:59:21,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:59:21,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:21,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:59:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:21,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223043945] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:59:21,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:59:21,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 01:59:21,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364792899] [2022-12-13 01:59:21,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:59:21,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:59:21,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:21,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:59:21,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:59:21,825 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 01:59:21,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 397 transitions, 12330 flow. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:21,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:21,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 01:59:21,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:23,526 INFO L130 PetriNetUnfolder]: 2080/4360 cut-off events. [2022-12-13 01:59:23,527 INFO L131 PetriNetUnfolder]: For 397659/397659 co-relation queries the response was YES. [2022-12-13 01:59:23,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55045 conditions, 4360 events. 2080/4360 cut-off events. For 397659/397659 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 35514 event pairs, 333 based on Foata normal form. 102/4458 useless extension candidates. Maximal degree in co-relation 53907. Up to 1818 conditions per place. [2022-12-13 01:59:23,575 INFO L137 encePairwiseOnDemand]: 22/60 looper letters, 154 selfloop transitions, 326 changer transitions 13/493 dead transitions. [2022-12-13 01:59:23,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 493 transitions, 15361 flow [2022-12-13 01:59:23,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:59:23,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:59:23,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2022-12-13 01:59:23,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21666666666666667 [2022-12-13 01:59:23,576 INFO L175 Difference]: Start difference. First operand has 224 places, 397 transitions, 12330 flow. Second operand 8 states and 104 transitions. [2022-12-13 01:59:23,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 493 transitions, 15361 flow [2022-12-13 01:59:24,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 493 transitions, 14854 flow, removed 209 selfloop flow, removed 2 redundant places. [2022-12-13 01:59:24,520 INFO L231 Difference]: Finished difference. Result has 232 places, 443 transitions, 14312 flow [2022-12-13 01:59:24,521 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=11831, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=284, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=14312, PETRI_PLACES=232, PETRI_TRANSITIONS=443} [2022-12-13 01:59:24,521 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 212 predicate places. [2022-12-13 01:59:24,521 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:24,521 INFO L89 Accepts]: Start accepts. Operand has 232 places, 443 transitions, 14312 flow [2022-12-13 01:59:24,524 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:24,524 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:24,524 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 232 places, 443 transitions, 14312 flow [2022-12-13 01:59:24,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 443 transitions, 14312 flow [2022-12-13 01:59:24,851 INFO L130 PetriNetUnfolder]: 421/1723 cut-off events. [2022-12-13 01:59:24,852 INFO L131 PetriNetUnfolder]: For 109587/109587 co-relation queries the response was YES. [2022-12-13 01:59:24,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19896 conditions, 1723 events. 421/1723 cut-off events. For 109587/109587 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 17954 event pairs, 25 based on Foata normal form. 0/1716 useless extension candidates. Maximal degree in co-relation 19479. Up to 455 conditions per place. [2022-12-13 01:59:24,886 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 232 places, 443 transitions, 14312 flow [2022-12-13 01:59:24,886 INFO L226 LiptonReduction]: Number of co-enabled transitions 1384 [2022-12-13 01:59:24,888 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:59:24,889 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 368 [2022-12-13 01:59:24,889 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 443 transitions, 14312 flow [2022-12-13 01:59:24,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:24,889 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:24,889 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:24,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-13 01:59:25,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:59:25,094 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:25,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:25,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1018531111, now seen corresponding path program 1 times [2022-12-13 01:59:25,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:25,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16521861] [2022-12-13 01:59:25,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:25,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:25,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:25,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:25,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16521861] [2022-12-13 01:59:25,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16521861] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:59:25,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286015187] [2022-12-13 01:59:25,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:25,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:59:25,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:59:25,213 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:59:25,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-13 01:59:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:25,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 01:59:25,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:59:25,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:25,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:59:25,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:25,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286015187] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:59:25,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:59:25,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2022-12-13 01:59:25,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475001855] [2022-12-13 01:59:25,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:59:25,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:59:25,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:25,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:59:25,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:59:25,357 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-13 01:59:25,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 443 transitions, 14312 flow. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:25,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:25,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-13 01:59:25,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:27,439 INFO L130 PetriNetUnfolder]: 2372/5014 cut-off events. [2022-12-13 01:59:27,439 INFO L131 PetriNetUnfolder]: For 462424/462424 co-relation queries the response was YES. [2022-12-13 01:59:27,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66833 conditions, 5014 events. 2372/5014 cut-off events. For 462424/462424 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 42284 event pairs, 390 based on Foata normal form. 56/5066 useless extension candidates. Maximal degree in co-relation 65645. Up to 2634 conditions per place. [2022-12-13 01:59:27,497 INFO L137 encePairwiseOnDemand]: 31/60 looper letters, 318 selfloop transitions, 176 changer transitions 56/550 dead transitions. [2022-12-13 01:59:27,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 550 transitions, 17944 flow [2022-12-13 01:59:27,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:27,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-13 01:59:27,498 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2966666666666667 [2022-12-13 01:59:27,498 INFO L175 Difference]: Start difference. First operand has 232 places, 443 transitions, 14312 flow. Second operand 5 states and 89 transitions. [2022-12-13 01:59:27,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 550 transitions, 17944 flow [2022-12-13 01:59:28,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 550 transitions, 17556 flow, removed 107 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:28,707 INFO L231 Difference]: Finished difference. Result has 235 places, 450 transitions, 14950 flow [2022-12-13 01:59:28,707 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=14010, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=14950, PETRI_PLACES=235, PETRI_TRANSITIONS=450} [2022-12-13 01:59:28,708 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 215 predicate places. [2022-12-13 01:59:28,708 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:28,708 INFO L89 Accepts]: Start accepts. Operand has 235 places, 450 transitions, 14950 flow [2022-12-13 01:59:28,710 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:28,710 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:28,710 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 450 transitions, 14950 flow [2022-12-13 01:59:28,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 450 transitions, 14950 flow [2022-12-13 01:59:29,070 INFO L130 PetriNetUnfolder]: 458/1937 cut-off events. [2022-12-13 01:59:29,070 INFO L131 PetriNetUnfolder]: For 115323/115323 co-relation queries the response was YES. [2022-12-13 01:59:29,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22255 conditions, 1937 events. 458/1937 cut-off events. For 115323/115323 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 20919 event pairs, 43 based on Foata normal form. 0/1929 useless extension candidates. Maximal degree in co-relation 21846. Up to 533 conditions per place. [2022-12-13 01:59:29,095 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 235 places, 450 transitions, 14950 flow [2022-12-13 01:59:29,095 INFO L226 LiptonReduction]: Number of co-enabled transitions 1390 [2022-12-13 01:59:29,098 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:59:29,099 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 391 [2022-12-13 01:59:29,099 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 450 transitions, 14950 flow [2022-12-13 01:59:29,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:29,099 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:29,099 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:29,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-13 01:59:29,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-12-13 01:59:29,303 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:29,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:29,303 INFO L85 PathProgramCache]: Analyzing trace with hash -425387957, now seen corresponding path program 1 times [2022-12-13 01:59:29,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:29,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235975707] [2022-12-13 01:59:29,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:29,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:29,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:29,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235975707] [2022-12-13 01:59:29,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235975707] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:59:29,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303438174] [2022-12-13 01:59:29,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:29,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:59:29,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:59:29,399 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:59:29,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-13 01:59:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:29,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 01:59:29,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:59:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:29,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:59:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:29,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303438174] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:59:29,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:59:29,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 01:59:29,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146424656] [2022-12-13 01:59:29,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:59:29,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:59:29,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:29,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:59:29,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:59:29,535 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-13 01:59:29,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 450 transitions, 14950 flow. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:29,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:29,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-13 01:59:29,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:31,639 INFO L130 PetriNetUnfolder]: 2306/4881 cut-off events. [2022-12-13 01:59:31,639 INFO L131 PetriNetUnfolder]: For 401812/401812 co-relation queries the response was YES. [2022-12-13 01:59:31,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64675 conditions, 4881 events. 2306/4881 cut-off events. For 401812/401812 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 41231 event pairs, 228 based on Foata normal form. 20/4897 useless extension candidates. Maximal degree in co-relation 63531. Up to 2233 conditions per place. [2022-12-13 01:59:31,684 INFO L137 encePairwiseOnDemand]: 15/58 looper letters, 143 selfloop transitions, 362 changer transitions 19/524 dead transitions. [2022-12-13 01:59:31,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 524 transitions, 17608 flow [2022-12-13 01:59:31,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 01:59:31,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 01:59:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 118 transitions. [2022-12-13 01:59:31,686 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14532019704433496 [2022-12-13 01:59:31,686 INFO L175 Difference]: Start difference. First operand has 235 places, 450 transitions, 14950 flow. Second operand 14 states and 118 transitions. [2022-12-13 01:59:31,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 524 transitions, 17608 flow [2022-12-13 01:59:32,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 524 transitions, 17329 flow, removed 96 selfloop flow, removed 1 redundant places. [2022-12-13 01:59:32,573 INFO L231 Difference]: Finished difference. Result has 250 places, 470 transitions, 16409 flow [2022-12-13 01:59:32,574 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=14748, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=343, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=16409, PETRI_PLACES=250, PETRI_TRANSITIONS=470} [2022-12-13 01:59:32,574 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 230 predicate places. [2022-12-13 01:59:32,574 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:32,574 INFO L89 Accepts]: Start accepts. Operand has 250 places, 470 transitions, 16409 flow [2022-12-13 01:59:32,577 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:32,577 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:32,577 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 250 places, 470 transitions, 16409 flow [2022-12-13 01:59:32,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 470 transitions, 16409 flow [2022-12-13 01:59:32,856 INFO L130 PetriNetUnfolder]: 459/1902 cut-off events. [2022-12-13 01:59:32,857 INFO L131 PetriNetUnfolder]: For 126348/126348 co-relation queries the response was YES. [2022-12-13 01:59:32,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23300 conditions, 1902 events. 459/1902 cut-off events. For 126348/126348 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 20422 event pairs, 34 based on Foata normal form. 0/1893 useless extension candidates. Maximal degree in co-relation 22872. Up to 542 conditions per place. [2022-12-13 01:59:32,883 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 470 transitions, 16409 flow [2022-12-13 01:59:32,883 INFO L226 LiptonReduction]: Number of co-enabled transitions 1446 [2022-12-13 01:59:32,885 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:59:32,885 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 311 [2022-12-13 01:59:32,885 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 470 transitions, 16409 flow [2022-12-13 01:59:32,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:32,885 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:32,885 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:32,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-13 01:59:33,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:59:33,090 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:33,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:33,090 INFO L85 PathProgramCache]: Analyzing trace with hash -758014299, now seen corresponding path program 2 times [2022-12-13 01:59:33,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:33,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757718141] [2022-12-13 01:59:33,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:33,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:33,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:33,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757718141] [2022-12-13 01:59:33,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757718141] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:59:33,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038004188] [2022-12-13 01:59:33,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 01:59:33,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:59:33,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:59:33,161 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:59:33,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-13 01:59:33,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 01:59:33,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:59:33,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 01:59:33,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:59:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:33,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:59:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:33,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038004188] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:59:33,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:59:33,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 01:59:33,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522774668] [2022-12-13 01:59:33,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:59:33,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:59:33,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:33,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:59:33,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:59:33,337 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-13 01:59:33,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 470 transitions, 16409 flow. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:33,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:33,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-13 01:59:33,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:35,606 INFO L130 PetriNetUnfolder]: 2438/5107 cut-off events. [2022-12-13 01:59:35,607 INFO L131 PetriNetUnfolder]: For 469554/469554 co-relation queries the response was YES. [2022-12-13 01:59:35,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69894 conditions, 5107 events. 2438/5107 cut-off events. For 469554/469554 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 43129 event pairs, 399 based on Foata normal form. 20/5123 useless extension candidates. Maximal degree in co-relation 68699. Up to 2495 conditions per place. [2022-12-13 01:59:35,660 INFO L137 encePairwiseOnDemand]: 16/58 looper letters, 286 selfloop transitions, 296 changer transitions 7/589 dead transitions. [2022-12-13 01:59:35,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 589 transitions, 20302 flow [2022-12-13 01:59:35,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 01:59:35,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 01:59:35,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 115 transitions. [2022-12-13 01:59:35,661 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15251989389920426 [2022-12-13 01:59:35,662 INFO L175 Difference]: Start difference. First operand has 248 places, 470 transitions, 16409 flow. Second operand 13 states and 115 transitions. [2022-12-13 01:59:35,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 589 transitions, 20302 flow [2022-12-13 01:59:37,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 589 transitions, 19914 flow, removed 194 selfloop flow, removed 0 redundant places. [2022-12-13 01:59:37,042 INFO L231 Difference]: Finished difference. Result has 264 places, 516 transitions, 18484 flow [2022-12-13 01:59:37,042 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=16085, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=253, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=18484, PETRI_PLACES=264, PETRI_TRANSITIONS=516} [2022-12-13 01:59:37,042 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 244 predicate places. [2022-12-13 01:59:37,042 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:37,043 INFO L89 Accepts]: Start accepts. Operand has 264 places, 516 transitions, 18484 flow [2022-12-13 01:59:37,046 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:37,046 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:37,046 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 264 places, 516 transitions, 18484 flow [2022-12-13 01:59:37,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 264 places, 516 transitions, 18484 flow [2022-12-13 01:59:37,378 INFO L130 PetriNetUnfolder]: 492/2004 cut-off events. [2022-12-13 01:59:37,378 INFO L131 PetriNetUnfolder]: For 134369/134369 co-relation queries the response was YES. [2022-12-13 01:59:37,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24987 conditions, 2004 events. 492/2004 cut-off events. For 134369/134369 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 21595 event pairs, 34 based on Foata normal form. 0/1997 useless extension candidates. Maximal degree in co-relation 24542. Up to 537 conditions per place. [2022-12-13 01:59:37,407 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 264 places, 516 transitions, 18484 flow [2022-12-13 01:59:37,407 INFO L226 LiptonReduction]: Number of co-enabled transitions 1606 [2022-12-13 01:59:37,409 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:59:37,410 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 368 [2022-12-13 01:59:37,410 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 516 transitions, 18484 flow [2022-12-13 01:59:37,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:37,410 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:37,410 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:37,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-12-13 01:59:37,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:59:37,614 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:37,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:37,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1259272218, now seen corresponding path program 1 times [2022-12-13 01:59:37,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:37,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044402795] [2022-12-13 01:59:37,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:37,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:37,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:37,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:37,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044402795] [2022-12-13 01:59:37,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044402795] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:59:37,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127135557] [2022-12-13 01:59:37,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:37,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:59:37,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:59:37,700 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:59:37,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-13 01:59:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:37,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 01:59:37,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:59:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:37,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:59:37,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:37,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127135557] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:59:37,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:59:37,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-12-13 01:59:37,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113444956] [2022-12-13 01:59:37,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:59:37,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:59:37,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:37,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:59:37,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:59:37,877 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-13 01:59:37,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 516 transitions, 18484 flow. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:37,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:37,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-13 01:59:37,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:42,025 INFO L130 PetriNetUnfolder]: 3820/8025 cut-off events. [2022-12-13 01:59:42,025 INFO L131 PetriNetUnfolder]: For 773232/773232 co-relation queries the response was YES. [2022-12-13 01:59:42,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113943 conditions, 8025 events. 3820/8025 cut-off events. For 773232/773232 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 72443 event pairs, 550 based on Foata normal form. 152/8173 useless extension candidates. Maximal degree in co-relation 112047. Up to 2873 conditions per place. [2022-12-13 01:59:42,109 INFO L137 encePairwiseOnDemand]: 18/58 looper letters, 447 selfloop transitions, 376 changer transitions 65/888 dead transitions. [2022-12-13 01:59:42,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 888 transitions, 31685 flow [2022-12-13 01:59:42,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:59:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:59:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-12-13 01:59:42,110 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31896551724137934 [2022-12-13 01:59:42,110 INFO L175 Difference]: Start difference. First operand has 264 places, 516 transitions, 18484 flow. Second operand 6 states and 111 transitions. [2022-12-13 01:59:42,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 888 transitions, 31685 flow [2022-12-13 01:59:44,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 888 transitions, 30862 flow, removed 400 selfloop flow, removed 3 redundant places. [2022-12-13 01:59:44,733 INFO L231 Difference]: Finished difference. Result has 270 places, 697 transitions, 26252 flow [2022-12-13 01:59:44,733 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=18073, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=26252, PETRI_PLACES=270, PETRI_TRANSITIONS=697} [2022-12-13 01:59:44,734 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 250 predicate places. [2022-12-13 01:59:44,734 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:44,734 INFO L89 Accepts]: Start accepts. Operand has 270 places, 697 transitions, 26252 flow [2022-12-13 01:59:44,738 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:44,738 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:44,738 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 270 places, 697 transitions, 26252 flow [2022-12-13 01:59:44,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 270 places, 697 transitions, 26252 flow [2022-12-13 01:59:45,348 INFO L130 PetriNetUnfolder]: 718/2996 cut-off events. [2022-12-13 01:59:45,349 INFO L131 PetriNetUnfolder]: For 194295/194295 co-relation queries the response was YES. [2022-12-13 01:59:45,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38252 conditions, 2996 events. 718/2996 cut-off events. For 194295/194295 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 35163 event pairs, 58 based on Foata normal form. 0/2983 useless extension candidates. Maximal degree in co-relation 37671. Up to 815 conditions per place. [2022-12-13 01:59:45,397 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 270 places, 697 transitions, 26252 flow [2022-12-13 01:59:45,397 INFO L226 LiptonReduction]: Number of co-enabled transitions 2316 [2022-12-13 01:59:45,400 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:59:45,401 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 667 [2022-12-13 01:59:45,401 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 697 transitions, 26252 flow [2022-12-13 01:59:45,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:45,401 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:45,401 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:45,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-13 01:59:45,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-13 01:59:45,602 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:45,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:45,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1852777122, now seen corresponding path program 1 times [2022-12-13 01:59:45,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:45,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210538382] [2022-12-13 01:59:45,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:45,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:45,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:45,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:45,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210538382] [2022-12-13 01:59:45,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210538382] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:59:45,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454427642] [2022-12-13 01:59:45,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:45,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:59:45,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:59:45,716 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:59:45,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-13 01:59:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:45,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 01:59:45,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:59:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:45,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:59:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:45,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454427642] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:59:45,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:59:45,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-13 01:59:45,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940695295] [2022-12-13 01:59:45,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:59:45,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:59:45,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:45,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:59:45,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:59:45,850 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-13 01:59:45,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 697 transitions, 26252 flow. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:45,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:45,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-13 01:59:45,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:49,525 INFO L130 PetriNetUnfolder]: 3646/7625 cut-off events. [2022-12-13 01:59:49,525 INFO L131 PetriNetUnfolder]: For 665147/665147 co-relation queries the response was YES. [2022-12-13 01:59:49,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109508 conditions, 7625 events. 3646/7625 cut-off events. For 665147/665147 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 68114 event pairs, 484 based on Foata normal form. 10/7631 useless extension candidates. Maximal degree in co-relation 107834. Up to 6754 conditions per place. [2022-12-13 01:59:49,608 INFO L137 encePairwiseOnDemand]: 18/58 looper letters, 549 selfloop transitions, 195 changer transitions 4/748 dead transitions. [2022-12-13 01:59:49,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 748 transitions, 28634 flow [2022-12-13 01:59:49,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:59:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:59:49,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-12-13 01:59:49,609 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.18199233716475097 [2022-12-13 01:59:49,610 INFO L175 Difference]: Start difference. First operand has 270 places, 697 transitions, 26252 flow. Second operand 9 states and 95 transitions. [2022-12-13 01:59:49,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 748 transitions, 28634 flow [2022-12-13 01:59:51,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 748 transitions, 27920 flow, removed 357 selfloop flow, removed 0 redundant places. [2022-12-13 01:59:51,842 INFO L231 Difference]: Finished difference. Result has 279 places, 700 transitions, 26209 flow [2022-12-13 01:59:51,842 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=25622, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=192, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=26209, PETRI_PLACES=279, PETRI_TRANSITIONS=700} [2022-12-13 01:59:51,842 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 259 predicate places. [2022-12-13 01:59:51,842 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:51,842 INFO L89 Accepts]: Start accepts. Operand has 279 places, 700 transitions, 26209 flow [2022-12-13 01:59:51,847 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:51,847 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:51,847 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 279 places, 700 transitions, 26209 flow [2022-12-13 01:59:51,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 279 places, 700 transitions, 26209 flow [2022-12-13 01:59:52,490 INFO L130 PetriNetUnfolder]: 720/3043 cut-off events. [2022-12-13 01:59:52,490 INFO L131 PetriNetUnfolder]: For 200647/200647 co-relation queries the response was YES. [2022-12-13 01:59:52,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37682 conditions, 3043 events. 720/3043 cut-off events. For 200647/200647 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 36017 event pairs, 58 based on Foata normal form. 0/3038 useless extension candidates. Maximal degree in co-relation 37147. Up to 816 conditions per place. [2022-12-13 01:59:52,543 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 279 places, 700 transitions, 26209 flow [2022-12-13 01:59:52,543 INFO L226 LiptonReduction]: Number of co-enabled transitions 2330 [2022-12-13 01:59:52,648 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:52,648 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:52,648 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:52,750 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:52,750 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:52,750 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:52,847 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:52,848 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:52,848 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:52,948 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:52,948 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:52,948 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:53,034 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:53,034 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:53,034 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:53,241 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:53,242 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:53,242 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:53,338 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:53,338 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:53,338 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:53,424 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:53,424 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:53,424 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:53,514 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:53,514 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:53,514 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:53,621 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:53,621 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:53,621 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:53,711 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:53,711 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:53,711 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:53,797 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [327] L51-4-->L41-4: Formula: (let ((.cse0 (mod v_~N~0_99 4294967296))) (and (= |v_thread2Thread1of1ForFork1_~i~1#1_122| (+ |v_thread2Thread1of1ForFork1_~i~1#1_123| 1)) (= (+ v_thread1Thread1of1ForFork0_~i~0_118 1) v_thread1Thread1of1ForFork0_~i~0_117) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_87| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_87|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_87| 0)) (= (ite (< 0 (mod v_~counter~0_246 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_87|) (= v_~counter~0_246 v_~counter~0_244) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_123| 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_118 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_246, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_118, ~N~0=v_~N~0_99, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_123|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_87|, ~counter~0=v_~counter~0_244, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_88|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_117, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_95|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_87|, ~N~0=v_~N~0_99, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_122|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:53,797 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:53,797 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:53,952 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [341] L41-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_119 4294967296))) (and (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_171| 1) |v_thread2Thread1of1ForFork1_~i~1#1_170|) (= v_thread1Thread1of1ForFork0_~i~0_157 (+ v_thread1Thread1of1ForFork0_~i~0_158 1)) (= v_~counter~0_317 v_~counter~0_315) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_122|) (< (mod v_thread1Thread1of1ForFork0_~i~0_158 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_122| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_171| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122| (ite (< 0 (mod (+ v_~counter~0_317 v_~c~0_132) 4294967296)) 1 0)))) InVars {~counter~0=v_~counter~0_317, ~c~0=v_~c~0_132, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_158, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_171|, ~N~0=v_~N~0_119} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_122|, ~counter~0=v_~counter~0_315, ~c~0=v_~c~0_132, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_116|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_157, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_130|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_122|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_170|, ~N~0=v_~N~0_119} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:53,953 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:53,953 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:54,144 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [490] L51-4-->L41-4: Formula: (let ((.cse0 (mod v_~N~0_295 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_448| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_448|) (= v_thread1Thread1of1ForFork0_~i~0_354 (+ v_thread1Thread1of1ForFork0_~i~0_355 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_448| 0)) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_617| 1) |v_thread2Thread1of1ForFork1_~i~1#1_616|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_448| (ite (< 0 (mod v_~counter~0_882 4294967296)) 1 0)) (= v_~counter~0_882 v_~counter~0_880) (< (mod v_thread1Thread1of1ForFork0_~i~0_355 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_617| 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_882, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_355, ~N~0=v_~N~0_295, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_617|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_448|, ~counter~0=v_~counter~0_880, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_265|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_354, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_456|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_448|, ~N~0=v_~N~0_295, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_616|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:54,144 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:54,144 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:54,352 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:54,352 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:54,352 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:54,445 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:54,446 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:54,446 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:54,547 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [337] L41-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_113 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_114| (ite (< 0 (mod (+ v_~counter~0_299 v_~c~0_126) 4294967296)) 1 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_~i~1#1_158| (+ |v_thread2Thread1of1ForFork1_~i~1#1_159| 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_114| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_114|) (= v_~counter~0_299 v_~counter~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_148 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_114| 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_148 1) v_thread1Thread1of1ForFork0_~i~0_147))) InVars {~counter~0=v_~counter~0_299, ~c~0=v_~c~0_126, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_148, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~N~0=v_~N~0_113} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_114|, ~counter~0=v_~counter~0_297, ~c~0=v_~c~0_126, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_110|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_147, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_122|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_114|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_158|, ~N~0=v_~N~0_113} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:54,547 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:54,547 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:54,757 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:54,757 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:54,757 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:54,830 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:54,830 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:54,831 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:54,968 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:54,969 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:54,969 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,043 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:55,043 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,043 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,116 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:55,116 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,116 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,189 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:55,190 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,190 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,259 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:55,260 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,260 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,331 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:55,331 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,331 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,401 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:55,401 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,402 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,473 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:55,473 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,473 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,547 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:55,547 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,547 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,621 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:55,622 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,622 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,697 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:55,698 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,698 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,767 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:55,767 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,767 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,861 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:55,861 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,861 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,934 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:55,935 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:55,935 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,004 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:56,004 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,004 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,068 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:56,069 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,069 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,137 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:56,137 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,138 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,206 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:56,206 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,206 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,274 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:56,275 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,275 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,340 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:56,340 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,340 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,407 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:56,407 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,407 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,476 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:56,476 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,477 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,543 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:56,543 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,543 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,618 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:56,618 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,619 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,733 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:56,733 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,733 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,832 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:56,832 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,832 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,934 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:56,935 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:56,935 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:57,033 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:57,033 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:57,033 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:57,132 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:57,133 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:57,133 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:57,227 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:57,227 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:57,227 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:57,324 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:57,324 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:57,324 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:57,421 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:57,422 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:57,422 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:57,516 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:57,516 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:57,516 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:57,612 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:57,612 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:57,613 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:57,713 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:57,713 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:57,714 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:57,811 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:57,812 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:57,812 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:57,908 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:57,909 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:57,909 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,002 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:58,002 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,002 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,098 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:58,098 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,099 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,189 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:58,189 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,189 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,290 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:58,291 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,291 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,363 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:58,363 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,363 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,436 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:58,436 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,437 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,512 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:58,512 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,512 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,596 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:58,597 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,597 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,662 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:58,662 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,662 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,774 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:58,775 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,775 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,876 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [500] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_311 4294967296))) (and (not (= (ite (< 0 (mod v_~counter~0_926 4294967296)) 1 0) 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_651|) |v_thread2Thread1of1ForFork1_~i~1#1_649|) (= v_~counter~0_926 (+ v_~counter~0_924 (* 2 v_~c~0_324))) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_651| 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_649|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_469| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_469|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_469| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_469| (ite (< 0 (mod (+ v_~counter~0_924 v_~c~0_324) 4294967296)) 1 0)))) InVars {~counter~0=v_~counter~0_926, ~c~0=v_~c~0_324, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_651|, ~N~0=v_~N~0_311} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_469|, ~counter~0=v_~counter~0_924, ~c~0=v_~c~0_324, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_477|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_469|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_649|, ~N~0=v_~N~0_311} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:58,876 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:58,876 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:59,145 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:59,145 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:59,145 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:59,237 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:59,238 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:59,238 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:59,331 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:59,331 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:59,331 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:59,425 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:59,425 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:59,425 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:59,520 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:59,520 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:59,521 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:59,618 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:59,619 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:59,619 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:59,715 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:59,715 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:59,715 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:59,799 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:59,799 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:59,799 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:59,869 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:59,869 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:59,869 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:59,936 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:59:59,936 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 01:59:59,936 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,012 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:00,012 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,012 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,088 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:00,088 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,088 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,166 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:00,167 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,167 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,255 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:00,255 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,255 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,343 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:00,344 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,344 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,413 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:00,413 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,413 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,480 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:00,480 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,480 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,548 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:00,548 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,548 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,618 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:00,618 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,618 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,687 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:00,687 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,687 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,756 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:00,756 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,756 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,823 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:00,824 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,824 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,890 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:00,890 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,890 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,961 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:00,961 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:00,961 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:01,031 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:01,031 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:01,031 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:01,107 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:01,107 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:01,107 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:01,189 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:01,190 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:01,190 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:01,266 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:01,266 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:01,266 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:01,342 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:01,342 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:01,342 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:01,420 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:01,421 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:01,421 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:01,500 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:01,500 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:01,501 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:01,584 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:01,584 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:01,585 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:01,739 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:01,739 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:01,739 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:01,885 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:01,885 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:01,885 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,007 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:02,007 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,007 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,110 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:02,110 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,110 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,215 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:02,215 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,215 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,312 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:02,312 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,312 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,420 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:02,420 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,420 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,521 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:02,521 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,521 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,636 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:02,636 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,636 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,708 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:02,708 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,708 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,781 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:02,781 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,781 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,850 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:02,850 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,850 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,917 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:02,917 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,917 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,985 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:02,985 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:02,985 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:03,056 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:03,056 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:03,056 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:03,128 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:03,128 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:03,129 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:03,197 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:03,197 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:03,197 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:03,298 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:03,298 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:03,298 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:03,407 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:03,407 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:03,407 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:03,513 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:03,514 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:03,514 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:03,610 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:03,610 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:03,611 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:03,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:03,718 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:03,718 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:03,818 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:03,819 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:03,819 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:03,928 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:03,928 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:03,928 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:04,009 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:04,014 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:04,014 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:04,082 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:04,082 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:04,082 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:04,149 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:04,149 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:04,150 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:04,219 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:04,219 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:04,219 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:04,329 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [519] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_331 4294967296))) (and (= v_thread1Thread1of1ForFork0_~i~0_417 (+ v_thread1Thread1of1ForFork0_~i~0_418 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_528| (ite (< 0 (mod (+ v_~c~0_344 v_~counter~0_1020) 4294967296)) 1 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_418 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_717|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_1022 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_528| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_528|) (not (= (ite (< 0 (mod (+ v_~counter~0_1022 (* 4294967295 v_~c~0_344)) 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_717|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_719| 4294967296) .cse0) (= v_~counter~0_1022 (+ (* 2 v_~c~0_344) v_~counter~0_1020)))) InVars {~counter~0=v_~counter~0_1022, ~c~0=v_~c~0_344, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_418, ~N~0=v_~N~0_331, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_719|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_528|, ~counter~0=v_~counter~0_1020, ~c~0=v_~c~0_344, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_316|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_417, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_536|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_528|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_717|, ~N~0=v_~N~0_331} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:04,446 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [523] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_348 v_~counter~0_1032) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_335 4294967296))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_729|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_536| .cse1) (not (= (ite (< 0 (mod v_~counter~0_1034 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_425 (+ v_thread1Thread1of1ForFork0_~i~0_426 1)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_729|) (< (mod v_thread1Thread1of1ForFork0_~i~0_426 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_536| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_536|) (not (= .cse1 0)) (= (+ v_~counter~0_1032 (* 2 v_~c~0_348)) v_~counter~0_1034) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_731| 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_1034, ~c~0=v_~c~0_348, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_426, ~N~0=v_~N~0_335, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_731|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_536|, ~counter~0=v_~counter~0_1032, ~c~0=v_~c~0_348, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_320|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_425, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_544|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_536|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_729|, ~N~0=v_~N~0_335} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:04,543 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [525] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_337 4294967296)) (.cse1 (ite (< 0 (mod (+ v_~c~0_350 v_~counter~0_1038) 4294967296)) 1 0))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_735|) (= v_thread1Thread1of1ForFork0_~i~0_429 (+ v_thread1Thread1of1ForFork0_~i~0_430 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_430 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_540| .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_540| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_540|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_737| 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_735|) 4294967296) .cse0) (not (= .cse1 0)) (not (= 0 (ite (< 0 (mod v_~counter~0_1040 4294967296)) 1 0))) (= (+ v_~counter~0_1038 (* 2 v_~c~0_350)) v_~counter~0_1040))) InVars {~counter~0=v_~counter~0_1040, ~c~0=v_~c~0_350, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_430, ~N~0=v_~N~0_337, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_737|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_540|, ~counter~0=v_~counter~0_1038, ~c~0=v_~c~0_350, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_322|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_429, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_548|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_540|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_735|, ~N~0=v_~N~0_337} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:04,634 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [527] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_352 v_~counter~0_1044) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_339 4294967296))) (and (not (= (ite (< 0 (mod v_~counter~0_1046 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_741|) 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_741|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_544| .cse1) (= (+ v_thread1Thread1of1ForFork0_~i~0_434 1) v_thread1Thread1of1ForFork0_~i~0_433) (not (= .cse1 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_434 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_743| 4294967296) .cse0) (= v_~counter~0_1046 (+ v_~counter~0_1044 (* 2 v_~c~0_352))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_544| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_544|))) InVars {~counter~0=v_~counter~0_1046, ~c~0=v_~c~0_352, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_434, ~N~0=v_~N~0_339, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_743|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_544|, ~counter~0=v_~counter~0_1044, ~c~0=v_~c~0_352, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_324|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_433, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_552|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_544|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_741|, ~N~0=v_~N~0_339} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:04,728 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [533] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_345 4294967296))) (and (= (+ v_~counter~0_1062 (* 2 v_~c~0_358)) v_~counter~0_1064) (< (mod v_thread1Thread1of1ForFork0_~i~0_446 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_358) v_~counter~0_1064) 4294967296)) 1 0) 0)) (not (= 0 (ite (< 0 (mod v_~counter~0_1064 4294967296)) 1 0))) (= v_thread1Thread1of1ForFork0_~i~0_445 (+ v_thread1Thread1of1ForFork0_~i~0_446 1)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_759|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_556| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_556|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_556| (ite (< 0 (mod (+ v_~c~0_358 v_~counter~0_1062) 4294967296)) 1 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_761| 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_759|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_1064, ~c~0=v_~c~0_358, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_446, ~N~0=v_~N~0_345, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_761|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_556|, ~counter~0=v_~counter~0_1062, ~c~0=v_~c~0_358, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_330|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_445, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_564|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_556|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_759|, ~N~0=v_~N~0_345} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:04,823 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [535] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_347 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_560| (ite (< 0 (mod (+ v_~c~0_360 v_~counter~0_1068) 4294967296)) 1 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_765|) (< (mod v_thread1Thread1of1ForFork0_~i~0_450 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_765|) 4294967296) .cse0) (= (+ v_~counter~0_1068 (* 2 v_~c~0_360)) v_~counter~0_1070) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_560| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_560|) (not (= (ite (< 0 (mod v_~counter~0_1070 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_360) v_~counter~0_1070) 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_767| 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_449 (+ v_thread1Thread1of1ForFork0_~i~0_450 1)))) InVars {~counter~0=v_~counter~0_1070, ~c~0=v_~c~0_360, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_450, ~N~0=v_~N~0_347, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_767|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_560|, ~counter~0=v_~counter~0_1068, ~c~0=v_~c~0_360, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_332|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_449, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_568|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_560|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_765|, ~N~0=v_~N~0_347} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:04,936 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [543] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_355 4294967296)) (.cse1 (+ v_~c~0_368 v_~counter~0_1092))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_576| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_576|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_791| 4294967296) .cse0) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_469) 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_471 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_1094 4294967296)) 1 0) 0)) (= (ite (< 0 (mod .cse1 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_576|) (= .cse1 v_~counter~0_1094) (= v_thread1Thread1of1ForFork0_~i~0_469 (+ 2 v_thread1Thread1of1ForFork0_~i~0_471)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_789|))) InVars {~counter~0=v_~counter~0_1094, ~c~0=v_~c~0_368, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_471, ~N~0=v_~N~0_355, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_791|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_576|, ~counter~0=v_~counter~0_1092, ~c~0=v_~c~0_368, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_344|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_469, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_584|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_576|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_789|, ~N~0=v_~N~0_355} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:05,023 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [551] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_363 4294967296))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_813|) (not (= (ite (< 0 (mod v_~counter~0_1118 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_592| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_592|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_815| 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_376) v_~counter~0_1118) 4294967296)) 1 0) 0)) (= v_~counter~0_1118 (+ v_~counter~0_1116 (* 2 v_~c~0_376))) (= v_thread1Thread1of1ForFork0_~i~0_489 (+ v_thread1Thread1of1ForFork0_~i~0_490 1)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_813|) 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_490 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_592| (ite (< 0 (mod (+ v_~c~0_376 v_~counter~0_1116) 4294967296)) 1 0)))) InVars {~counter~0=v_~counter~0_1118, ~c~0=v_~c~0_376, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_490, ~N~0=v_~N~0_363, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_815|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_592|, ~counter~0=v_~counter~0_1116, ~c~0=v_~c~0_376, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_356|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_489, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_600|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_592|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_813|, ~N~0=v_~N~0_363} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:05,116 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [553] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_378 v_~counter~0_1122) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_365 4294967296))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_819|) 4294967296) .cse0) (= v_~counter~0_1124 (+ (* 2 v_~c~0_378) v_~counter~0_1122)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_596| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_596|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_596| .cse1) (not (= .cse1 0)) (not (= (ite (< 0 (mod v_~counter~0_1124 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_494 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_819|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_821| 4294967296) .cse0) (= (+ v_thread1Thread1of1ForFork0_~i~0_494 1) v_thread1Thread1of1ForFork0_~i~0_493))) InVars {~counter~0=v_~counter~0_1124, ~c~0=v_~c~0_378, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_494, ~N~0=v_~N~0_365, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_821|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_596|, ~counter~0=v_~counter~0_1122, ~c~0=v_~c~0_378, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_358|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_493, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_604|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_596|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_819|, ~N~0=v_~N~0_365} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:05,206 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [561] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_386 v_~counter~0_1146) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_373 4294967296))) (and (= (+ (* 2 v_~c~0_386) v_~counter~0_1146) v_~counter~0_1148) (not (= (ite (< 0 (mod v_~counter~0_1148 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_509 (+ v_thread1Thread1of1ForFork0_~i~0_510 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_612| .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_843|) 4294967296) .cse1) (not (= .cse0 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_843|) (< (mod v_thread1Thread1of1ForFork0_~i~0_510 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_612| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_612|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_845| 4294967296) .cse1))) InVars {~counter~0=v_~counter~0_1148, ~c~0=v_~c~0_386, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_510, ~N~0=v_~N~0_373, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_845|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_612|, ~counter~0=v_~counter~0_1146, ~c~0=v_~c~0_386, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_366|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_509, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_620|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_612|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_843|, ~N~0=v_~N~0_373} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:05,302 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [563] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_375 4294967296))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_849|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_1154 4294967296)) 1 0) 0)) (= (+ (* 2 v_~c~0_388) v_~counter~0_1152) v_~counter~0_1154) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_851| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_616| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_616|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_849|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_388) v_~counter~0_1154) 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_513 (+ v_thread1Thread1of1ForFork0_~i~0_514 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_616| (ite (< 0 (mod (+ v_~c~0_388 v_~counter~0_1152) 4294967296)) 1 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_514 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_1154, ~c~0=v_~c~0_388, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_514, ~N~0=v_~N~0_375, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_851|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_616|, ~counter~0=v_~counter~0_1152, ~c~0=v_~c~0_388, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_368|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_513, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_624|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_616|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_849|, ~N~0=v_~N~0_375} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:05,399 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [565] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_390 v_~counter~0_1158) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_377 4294967296))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_855|) (= (+ (* 2 v_~c~0_390) v_~counter~0_1158) v_~counter~0_1160) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_620| .cse0) (not (= .cse0 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_855|) 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_620| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_620|) (not (= (ite (< 0 (mod v_~counter~0_1160 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_518 4294967296) .cse1) (= v_thread1Thread1of1ForFork0_~i~0_517 (+ v_thread1Thread1of1ForFork0_~i~0_518 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_857| 4294967296) .cse1))) InVars {~counter~0=v_~counter~0_1160, ~c~0=v_~c~0_390, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_518, ~N~0=v_~N~0_377, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_857|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_620|, ~counter~0=v_~counter~0_1158, ~c~0=v_~c~0_390, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_370|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_517, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_628|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_620|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_855|, ~N~0=v_~N~0_377} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:05,483 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [567] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_379 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_624| (ite (< 0 (mod (+ v_~c~0_392 v_~counter~0_1164) 4294967296)) 1 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_861|) (not (= (ite (< 0 (mod v_~counter~0_1166 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_521 (+ v_thread1Thread1of1ForFork0_~i~0_522 1)) (= v_~counter~0_1166 (+ v_~counter~0_1164 (* 2 v_~c~0_392))) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_863| 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_861|) 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_522 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_624| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_624|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_392) v_~counter~0_1166) 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_1166, ~c~0=v_~c~0_392, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_522, ~N~0=v_~N~0_379, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_863|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_624|, ~counter~0=v_~counter~0_1164, ~c~0=v_~c~0_392, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_372|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_521, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_632|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_624|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_861|, ~N~0=v_~N~0_379} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:05,585 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [571] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_383 4294967296))) (and (< (mod v_thread1Thread1of1ForFork0_~i~0_530 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_396) v_~counter~0_1178) 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_873|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_875| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_632| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_632|) (= (+ v_thread1Thread1of1ForFork0_~i~0_530 1) v_thread1Thread1of1ForFork0_~i~0_529) (not (= (ite (< 0 (mod v_~counter~0_1178 4294967296)) 1 0) 0)) (= (+ (* 2 v_~c~0_396) v_~counter~0_1176) v_~counter~0_1178) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_632| (ite (< 0 (mod (+ v_~c~0_396 v_~counter~0_1176) 4294967296)) 1 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_873|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_1178, ~c~0=v_~c~0_396, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_530, ~N~0=v_~N~0_383, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_875|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_632|, ~counter~0=v_~counter~0_1176, ~c~0=v_~c~0_396, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_376|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_529, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_640|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_632|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_873|, ~N~0=v_~N~0_383} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:05,677 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [573] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_385 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_881| 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_398) v_~counter~0_1184) 4294967296)) 1 0) 0)) (= (+ (* 2 v_~c~0_398) v_~counter~0_1182) v_~counter~0_1184) (not (= (ite (< 0 (mod v_~counter~0_1184 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_534 4294967296) .cse0) (= (+ v_thread1Thread1of1ForFork0_~i~0_534 1) v_thread1Thread1of1ForFork0_~i~0_533) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_879|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_879|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_636| (ite (< 0 (mod (+ v_~c~0_398 v_~counter~0_1182) 4294967296)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_636| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_636|))) InVars {~counter~0=v_~counter~0_1184, ~c~0=v_~c~0_398, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_534, ~N~0=v_~N~0_385, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_881|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_636|, ~counter~0=v_~counter~0_1182, ~c~0=v_~c~0_398, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_378|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_533, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_644|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_636|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_879|, ~N~0=v_~N~0_385} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:05,773 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [577] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_402 v_~counter~0_1194) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_389 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_644| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_644|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_893| 4294967296) .cse0) (= (+ (* 2 v_~c~0_402) v_~counter~0_1194) v_~counter~0_1196) (not (= (ite (< 0 (mod v_~counter~0_1196 4294967296)) 1 0) 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_542 1) v_thread1Thread1of1ForFork0_~i~0_541) (not (= .cse1 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_891|) 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_891|) (= .cse1 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_644|) (< (mod v_thread1Thread1of1ForFork0_~i~0_542 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_1196, ~c~0=v_~c~0_402, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_542, ~N~0=v_~N~0_389, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_893|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_644|, ~counter~0=v_~counter~0_1194, ~c~0=v_~c~0_402, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_382|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_541, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_652|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_644|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_891|, ~N~0=v_~N~0_389} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:05,861 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [579] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_391 4294967296))) (and (< (mod v_thread1Thread1of1ForFork0_~i~0_546 4294967296) .cse0) (= (ite (< 0 (mod (+ v_~c~0_404 v_~counter~0_1200) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_648|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_404) v_~counter~0_1202) 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_899| 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_1202 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_648| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_648|) (= (+ v_thread1Thread1of1ForFork0_~i~0_546 1) v_thread1Thread1of1ForFork0_~i~0_545) (= v_~counter~0_1202 (+ (* 2 v_~c~0_404) v_~counter~0_1200)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_897|) 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_897|))) InVars {~counter~0=v_~counter~0_1202, ~c~0=v_~c~0_404, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_546, ~N~0=v_~N~0_391, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_899|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_648|, ~counter~0=v_~counter~0_1200, ~c~0=v_~c~0_404, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_384|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_545, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_656|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_648|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_897|, ~N~0=v_~N~0_391} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:05,971 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [581] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_393 4294967296)) (.cse1 (ite (< 0 (mod (+ v_~c~0_406 v_~counter~0_1206) 4294967296)) 1 0))) (and (= (+ (* 2 v_~c~0_406) v_~counter~0_1206) v_~counter~0_1208) (< (mod v_thread1Thread1of1ForFork0_~i~0_550 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_903|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_652| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_652|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_905| 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_903|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_652| .cse1) (not (= .cse1 0)) (= v_thread1Thread1of1ForFork0_~i~0_549 (+ v_thread1Thread1of1ForFork0_~i~0_550 1)) (not (= (ite (< 0 (mod v_~counter~0_1208 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_1208, ~c~0=v_~c~0_406, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_550, ~N~0=v_~N~0_393, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_905|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_652|, ~counter~0=v_~counter~0_1206, ~c~0=v_~c~0_406, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_386|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_549, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_660|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_652|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_903|, ~N~0=v_~N~0_393} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:06,056 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [585] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_410 v_~counter~0_1218) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_397 4294967296))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_915|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_660| .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_917| 4294967296) .cse1) (not (= (ite (< 0 (mod v_~counter~0_1220 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_660| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_660|) (= v_thread1Thread1of1ForFork0_~i~0_557 (+ v_thread1Thread1of1ForFork0_~i~0_558 1)) (not (= .cse0 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_915|) 4294967296) .cse1) (= v_~counter~0_1220 (+ v_~counter~0_1218 (* 2 v_~c~0_410))) (< (mod v_thread1Thread1of1ForFork0_~i~0_558 4294967296) .cse1))) InVars {~counter~0=v_~counter~0_1220, ~c~0=v_~c~0_410, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_558, ~N~0=v_~N~0_397, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_917|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_660|, ~counter~0=v_~counter~0_1218, ~c~0=v_~c~0_410, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_390|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_557, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_668|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_660|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_915|, ~N~0=v_~N~0_397} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:06,193 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [587] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_399 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_664| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_664|) (not (= (ite (< 0 (mod v_~counter~0_1226 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_923| 4294967296) .cse0) (= (+ (* 2 v_~c~0_412) v_~counter~0_1224) v_~counter~0_1226) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_921|) (< (mod v_thread1Thread1of1ForFork0_~i~0_562 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_412) v_~counter~0_1226) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_664| (ite (< 0 (mod (+ v_~c~0_412 v_~counter~0_1224) 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_562 1) v_thread1Thread1of1ForFork0_~i~0_561) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_921|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_1226, ~c~0=v_~c~0_412, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_562, ~N~0=v_~N~0_399, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_923|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_664|, ~counter~0=v_~counter~0_1224, ~c~0=v_~c~0_412, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_392|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_561, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_672|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_664|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_921|, ~N~0=v_~N~0_399} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:06,291 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [589] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_401 4294967296))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_927|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_927|) 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_414) v_~counter~0_1232) 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_929| 4294967296) .cse0) (= (+ (* 2 v_~c~0_414) v_~counter~0_1230) v_~counter~0_1232) (not (= (ite (< 0 (mod v_~counter~0_1232 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_566 4294967296) .cse0) (= (ite (< 0 (mod (+ v_~c~0_414 v_~counter~0_1230) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_668|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_668| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_668|) (= v_thread1Thread1of1ForFork0_~i~0_565 (+ v_thread1Thread1of1ForFork0_~i~0_566 1)))) InVars {~counter~0=v_~counter~0_1232, ~c~0=v_~c~0_414, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_566, ~N~0=v_~N~0_401, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_929|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_668|, ~counter~0=v_~counter~0_1230, ~c~0=v_~c~0_414, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_394|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_565, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_676|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_668|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_927|, ~N~0=v_~N~0_401} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:06,387 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [591] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_416 v_~counter~0_1236) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_403 4294967296))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_933|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_672| .cse1) (not (= 0 (ite (< 0 (mod v_~counter~0_1238 4294967296)) 1 0))) (not (= .cse1 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_570 4294967296) .cse0) (= v_~counter~0_1238 (+ v_~counter~0_1236 (* 2 v_~c~0_416))) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_935| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_672| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_672|) (= v_thread1Thread1of1ForFork0_~i~0_569 (+ v_thread1Thread1of1ForFork0_~i~0_570 1)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_933|))) InVars {~counter~0=v_~counter~0_1238, ~c~0=v_~c~0_416, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_570, ~N~0=v_~N~0_403, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_935|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_672|, ~counter~0=v_~counter~0_1236, ~c~0=v_~c~0_416, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_396|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_569, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_680|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_672|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_933|, ~N~0=v_~N~0_403} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:06,476 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [595] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_407 4294967296)) (.cse1 (ite (< 0 (mod (+ v_~c~0_420 v_~counter~0_1248) 4294967296)) 1 0))) (and (= (+ (* 2 v_~c~0_420) v_~counter~0_1248) v_~counter~0_1250) (< (mod v_thread1Thread1of1ForFork0_~i~0_578 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_945|) 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_945|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_947| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_680| .cse1) (not (= (ite (< 0 (mod v_~counter~0_1250 4294967296)) 1 0) 0)) (not (= .cse1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_578 1) v_thread1Thread1of1ForFork0_~i~0_577) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_680| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_680|))) InVars {~counter~0=v_~counter~0_1250, ~c~0=v_~c~0_420, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_578, ~N~0=v_~N~0_407, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_947|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_680|, ~counter~0=v_~counter~0_1248, ~c~0=v_~c~0_420, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_400|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_577, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_688|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_680|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_945|, ~N~0=v_~N~0_407} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:06,564 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [597] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_422 v_~counter~0_1254) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_409 4294967296))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_951|) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_684| .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_951|) 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_684| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_684|) (= (+ (* 2 v_~c~0_422) v_~counter~0_1254) v_~counter~0_1256) (< (mod v_thread1Thread1of1ForFork0_~i~0_582 4294967296) .cse1) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_953| 4294967296) .cse1) (= v_thread1Thread1of1ForFork0_~i~0_581 (+ v_thread1Thread1of1ForFork0_~i~0_582 1)) (not (= (ite (< 0 (mod v_~counter~0_1256 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_1256, ~c~0=v_~c~0_422, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_582, ~N~0=v_~N~0_409, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_953|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_684|, ~counter~0=v_~counter~0_1254, ~c~0=v_~c~0_422, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_402|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_581, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_692|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_684|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_951|, ~N~0=v_~N~0_409} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:06,649 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [599] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_424 v_~counter~0_1260) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_411 4294967296))) (and (not (= (ite (< 0 (mod v_~counter~0_1262 4294967296)) 1 0) 0)) (not (= .cse0 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_586 1) v_thread1Thread1of1ForFork0_~i~0_585) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_957|) 4294967296) .cse1) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_957|) (= (+ (* 2 v_~c~0_424) v_~counter~0_1260) v_~counter~0_1262) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_688| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_688|) (< (mod v_thread1Thread1of1ForFork0_~i~0_586 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_688| .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_959| 4294967296) .cse1))) InVars {~counter~0=v_~counter~0_1262, ~c~0=v_~c~0_424, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_586, ~N~0=v_~N~0_411, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_959|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_688|, ~counter~0=v_~counter~0_1260, ~c~0=v_~c~0_424, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_404|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_585, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_696|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_688|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_957|, ~N~0=v_~N~0_411} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:06,733 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [601] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_413 4294967296))) (and (= v_thread1Thread1of1ForFork0_~i~0_589 (+ v_thread1Thread1of1ForFork0_~i~0_590 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_590 4294967296) .cse0) (not (= 0 (ite (< 0 (mod v_~counter~0_1268 4294967296)) 1 0))) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_963|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_692| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_692|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_965| 4294967296) .cse0) (not (= (ite (< 0 (mod (+ v_~counter~0_1268 (* 4294967295 v_~c~0_426)) 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_963|) 4294967296) .cse0) (= v_~counter~0_1268 (+ v_~counter~0_1266 (* 2 v_~c~0_426))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_692| (ite (< 0 (mod (+ v_~c~0_426 v_~counter~0_1266) 4294967296)) 1 0)))) InVars {~counter~0=v_~counter~0_1268, ~c~0=v_~c~0_426, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_590, ~N~0=v_~N~0_413, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_965|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_692|, ~counter~0=v_~counter~0_1266, ~c~0=v_~c~0_426, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_406|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_589, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_700|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_692|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_963|, ~N~0=v_~N~0_413} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:06,823 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [603] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_428 v_~counter~0_1272) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_415 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_696| .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_594 4294967296) .cse1) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_971| 4294967296) .cse1) (not (= .cse0 0)) (= v_~counter~0_1274 (+ (* 2 v_~c~0_428) v_~counter~0_1272)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_969|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_696| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_696|) (not (= (ite (< 0 (mod v_~counter~0_1274 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_969|) 4294967296) .cse1) (= (+ v_thread1Thread1of1ForFork0_~i~0_594 1) v_thread1Thread1of1ForFork0_~i~0_593))) InVars {~counter~0=v_~counter~0_1274, ~c~0=v_~c~0_428, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_594, ~N~0=v_~N~0_415, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_971|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_696|, ~counter~0=v_~counter~0_1272, ~c~0=v_~c~0_428, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_408|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_593, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_704|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_696|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_969|, ~N~0=v_~N~0_415} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:06,919 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [607] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_419 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_704| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_704|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_981|) (= (+ v_thread1Thread1of1ForFork0_~i~0_602 1) v_thread1Thread1of1ForFork0_~i~0_601) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_981|) 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_602 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_432) v_~counter~0_1286) 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_983| 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_1286 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_704| (ite (< 0 (mod (+ v_~c~0_432 v_~counter~0_1284) 4294967296)) 1 0)) (= (+ (* 2 v_~c~0_432) v_~counter~0_1284) v_~counter~0_1286))) InVars {~counter~0=v_~counter~0_1286, ~c~0=v_~c~0_432, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_602, ~N~0=v_~N~0_419, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_983|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_704|, ~counter~0=v_~counter~0_1284, ~c~0=v_~c~0_432, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_412|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_601, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_712|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_704|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_981|, ~N~0=v_~N~0_419} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:07,110 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [613] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_438 v_~counter~0_1302) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_425 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1001| 4294967296) .cse0) (= v_~counter~0_1304 (+ (* 2 v_~c~0_438) v_~counter~0_1302)) (not (= .cse1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_716| .cse1) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_999|) 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_613 (+ v_thread1Thread1of1ForFork0_~i~0_614 1)) (not (= (ite (< 0 (mod v_~counter~0_1304 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_716| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_716|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_999|) (< (mod v_thread1Thread1of1ForFork0_~i~0_614 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_1304, ~c~0=v_~c~0_438, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_614, ~N~0=v_~N~0_425, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1001|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_716|, ~counter~0=v_~counter~0_1302, ~c~0=v_~c~0_438, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_418|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_613, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_724|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_716|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_999|, ~N~0=v_~N~0_425} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:07,211 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [615] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_440 v_~counter~0_1308) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_427 4294967296))) (and (not (= .cse0 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_618 4294967296) .cse1) (= (+ v_thread1Thread1of1ForFork0_~i~0_618 1) v_thread1Thread1of1ForFork0_~i~0_617) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_720| .cse0) (= v_~counter~0_1310 (+ (* 2 v_~c~0_440) v_~counter~0_1308)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1007| 4294967296) .cse1) (not (= (ite (< 0 (mod v_~counter~0_1310 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1005|) 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_720| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_720|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1005|))) InVars {~counter~0=v_~counter~0_1310, ~c~0=v_~c~0_440, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_618, ~N~0=v_~N~0_427, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1007|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_720|, ~counter~0=v_~counter~0_1308, ~c~0=v_~c~0_440, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_420|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_617, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_728|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_720|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1005|, ~N~0=v_~N~0_427} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:07,297 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [617] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_442 v_~counter~0_1314) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_429 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1013| 4294967296) .cse0) (not (= .cse1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_724| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_724|) (< (mod v_thread1Thread1of1ForFork0_~i~0_622 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_621 (+ v_thread1Thread1of1ForFork0_~i~0_622 1)) (not (= (ite (< 0 (mod v_~counter~0_1316 4294967296)) 1 0) 0)) (= (+ (* 2 v_~c~0_442) v_~counter~0_1314) v_~counter~0_1316) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_724| .cse1) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1011|) 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1011|))) InVars {~counter~0=v_~counter~0_1316, ~c~0=v_~c~0_442, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_622, ~N~0=v_~N~0_429, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1013|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_724|, ~counter~0=v_~counter~0_1314, ~c~0=v_~c~0_442, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_422|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_621, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_732|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_724|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1011|, ~N~0=v_~N~0_429} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:07,382 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [621] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_433 4294967296))) (and (not (= (ite (< 0 (mod v_~counter~0_1328 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1023|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_732| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_732|) (not (= 0 (ite (< 0 (mod (+ (* 4294967295 v_~c~0_446) v_~counter~0_1328) 4294967296)) 1 0))) (= (+ v_thread1Thread1of1ForFork0_~i~0_630 1) v_thread1Thread1of1ForFork0_~i~0_629) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1025| 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1023|) 4294967296) .cse0) (= (+ (* 2 v_~c~0_446) v_~counter~0_1326) v_~counter~0_1328) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_732| (ite (< 0 (mod (+ v_~c~0_446 v_~counter~0_1326) 4294967296)) 1 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_630 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_1328, ~c~0=v_~c~0_446, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_630, ~N~0=v_~N~0_433, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1025|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_732|, ~counter~0=v_~counter~0_1326, ~c~0=v_~c~0_446, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_426|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_629, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_740|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_732|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1023|, ~N~0=v_~N~0_433} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:07,478 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [623] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_448 v_~counter~0_1332) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_435 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_736| .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1029|) 4294967296) .cse1) (< (mod v_thread1Thread1of1ForFork0_~i~0_634 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_736| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_736|) (= (+ v_~counter~0_1332 (* 2 v_~c~0_448)) v_~counter~0_1334) (= v_thread1Thread1of1ForFork0_~i~0_633 (+ v_thread1Thread1of1ForFork0_~i~0_634 1)) (not (= (ite (< 0 (mod v_~counter~0_1334 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1029|) (not (= .cse0 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1031| 4294967296) .cse1))) InVars {~counter~0=v_~counter~0_1334, ~c~0=v_~c~0_448, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_634, ~N~0=v_~N~0_435, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1031|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_736|, ~counter~0=v_~counter~0_1332, ~c~0=v_~c~0_448, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_428|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_633, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_744|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_736|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1029|, ~N~0=v_~N~0_435} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:07,567 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [625] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_437 4294967296)) (.cse1 (ite (< 0 (mod (+ v_~c~0_450 v_~counter~0_1338) 4294967296)) 1 0))) (and (< (mod v_thread1Thread1of1ForFork0_~i~0_638 4294967296) .cse0) (= v_~counter~0_1340 (+ (* 2 v_~c~0_450) v_~counter~0_1338)) (not (= (ite (< 0 (mod v_~counter~0_1340 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_740| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_740|) (not (= .cse1 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1035|) 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1035|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1037| 4294967296) .cse0) (= .cse1 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_740|) (= (+ v_thread1Thread1of1ForFork0_~i~0_638 1) v_thread1Thread1of1ForFork0_~i~0_637))) InVars {~counter~0=v_~counter~0_1340, ~c~0=v_~c~0_450, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_638, ~N~0=v_~N~0_437, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1037|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_740|, ~counter~0=v_~counter~0_1338, ~c~0=v_~c~0_450, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_430|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_637, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_748|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_740|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1035|, ~N~0=v_~N~0_437} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:07,655 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [629] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_441 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_748| (ite (< 0 (mod (+ v_~c~0_454 v_~counter~0_1350) 4294967296)) 1 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_646 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_1352 4294967296)) 1 0) 0)) (= (+ v_~counter~0_1350 (* 2 v_~c~0_454)) v_~counter~0_1352) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_454) v_~counter~0_1352) 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1047|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_748| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_748|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1047|) (= (+ v_thread1Thread1of1ForFork0_~i~0_646 1) v_thread1Thread1of1ForFork0_~i~0_645) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1049| 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_1352, ~c~0=v_~c~0_454, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_646, ~N~0=v_~N~0_441, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1049|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_748|, ~counter~0=v_~counter~0_1350, ~c~0=v_~c~0_454, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_434|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_645, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_756|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_748|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1047|, ~N~0=v_~N~0_441} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:07,742 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [635] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_447 4294967296)) (.cse1 (ite (< 0 (mod (+ v_~c~0_460 v_~counter~0_1368) 4294967296)) 1 0))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1065|) 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1067| 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_658 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_1370 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1065|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_760| .cse1) (= (+ v_~counter~0_1368 (* 2 v_~c~0_460)) v_~counter~0_1370) (not (= .cse1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_760| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_760|) (= v_thread1Thread1of1ForFork0_~i~0_657 (+ v_thread1Thread1of1ForFork0_~i~0_658 1)))) InVars {~counter~0=v_~counter~0_1370, ~c~0=v_~c~0_460, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_658, ~N~0=v_~N~0_447, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1067|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_760|, ~counter~0=v_~counter~0_1368, ~c~0=v_~c~0_460, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_440|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_657, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_768|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_760|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1065|, ~N~0=v_~N~0_447} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:07,823 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [637] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_462 v_~counter~0_1374) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_449 4294967296))) (and (not (= .cse0 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1071|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_764| .cse0) (not (= (ite (< 0 (mod v_~counter~0_1376 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_662 4294967296) .cse1) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1073| 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_764| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_764|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1071|) 4294967296) .cse1) (= (+ (* 2 v_~c~0_462) v_~counter~0_1374) v_~counter~0_1376) (= v_thread1Thread1of1ForFork0_~i~0_661 (+ v_thread1Thread1of1ForFork0_~i~0_662 1)))) InVars {~counter~0=v_~counter~0_1376, ~c~0=v_~c~0_462, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_662, ~N~0=v_~N~0_449, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1073|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_764|, ~counter~0=v_~counter~0_1374, ~c~0=v_~c~0_462, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_442|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_661, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_772|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_764|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1071|, ~N~0=v_~N~0_449} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:07,906 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [639] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_451 4294967296))) (and (< (mod v_thread1Thread1of1ForFork0_~i~0_666 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_768| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_768|) (= (+ v_~counter~0_1380 (* 2 v_~c~0_464)) v_~counter~0_1382) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1077|) 4294967296) .cse0) (not (= 0 (ite (< 0 (mod v_~counter~0_1382 4294967296)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_768| (ite (< 0 (mod (+ v_~c~0_464 v_~counter~0_1380) 4294967296)) 1 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1077|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1079| 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_464) v_~counter~0_1382) 4294967296)) 1 0) 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_666 1) v_thread1Thread1of1ForFork0_~i~0_665))) InVars {~counter~0=v_~counter~0_1382, ~c~0=v_~c~0_464, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_666, ~N~0=v_~N~0_451, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1079|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_768|, ~counter~0=v_~counter~0_1380, ~c~0=v_~c~0_464, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_444|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_665, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_776|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_768|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1077|, ~N~0=v_~N~0_451} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:07,996 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [643] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_455 4294967296)) (.cse1 (ite (< 0 (mod (+ v_~c~0_468 v_~counter~0_1392) 4294967296)) 1 0))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1091| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_776| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_776|) (not (= (ite (< 0 (mod v_~counter~0_1394 4294967296)) 1 0) 0)) (not (= .cse1 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_674 4294967296) .cse0) (= (+ v_~counter~0_1392 (* 2 v_~c~0_468)) v_~counter~0_1394) (= v_thread1Thread1of1ForFork0_~i~0_673 (+ v_thread1Thread1of1ForFork0_~i~0_674 1)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1089|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_776| .cse1) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1089|))) InVars {~counter~0=v_~counter~0_1394, ~c~0=v_~c~0_468, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_674, ~N~0=v_~N~0_455, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1091|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_776|, ~counter~0=v_~counter~0_1392, ~c~0=v_~c~0_468, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_448|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_673, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_784|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_776|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1089|, ~N~0=v_~N~0_455} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:08,086 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [645] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_457 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_780| (ite (< 0 (mod (+ v_~c~0_470 v_~counter~0_1398) 4294967296)) 1 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1097| 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1095|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_470) v_~counter~0_1400) 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1095|) 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_678 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_780| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_780|) (= (+ v_~counter~0_1398 (* 2 v_~c~0_470)) v_~counter~0_1400) (= (+ v_thread1Thread1of1ForFork0_~i~0_678 1) v_thread1Thread1of1ForFork0_~i~0_677) (not (= (ite (< 0 (mod v_~counter~0_1400 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_1400, ~c~0=v_~c~0_470, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_678, ~N~0=v_~N~0_457, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1097|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_780|, ~counter~0=v_~counter~0_1398, ~c~0=v_~c~0_470, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_450|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_677, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_788|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_780|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1095|, ~N~0=v_~N~0_457} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:08,186 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [647] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_459 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1103| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_784| (ite (< 0 (mod (+ v_~c~0_472 v_~counter~0_1404) 4294967296)) 1 0)) (not (= (ite (< 0 (mod v_~counter~0_1406 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1101|) (= v_thread1Thread1of1ForFork0_~i~0_681 (+ v_thread1Thread1of1ForFork0_~i~0_682 1)) (= (+ (* 2 v_~c~0_472) v_~counter~0_1404) v_~counter~0_1406) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1101|) 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_682 4294967296) .cse0) (not (= (ite (< 0 (mod (+ v_~counter~0_1406 (* 4294967295 v_~c~0_472)) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_784| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_784|))) InVars {~counter~0=v_~counter~0_1406, ~c~0=v_~c~0_472, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_682, ~N~0=v_~N~0_459, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1103|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_784|, ~counter~0=v_~counter~0_1404, ~c~0=v_~c~0_472, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_452|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_681, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_792|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_784|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1101|, ~N~0=v_~N~0_459} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:08,284 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [651] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_476 v_~counter~0_1416) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_463 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_792| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_792|) (= (+ v_~counter~0_1416 (* 2 v_~c~0_476)) v_~counter~0_1418) (not (= .cse0 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1115| 4294967296) .cse1) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1113|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1113|) 4294967296) .cse1) (= v_thread1Thread1of1ForFork0_~i~0_689 (+ v_thread1Thread1of1ForFork0_~i~0_690 1)) (not (= (ite (< 0 (mod v_~counter~0_1418 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_792| .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_690 4294967296) .cse1))) InVars {~counter~0=v_~counter~0_1418, ~c~0=v_~c~0_476, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_690, ~N~0=v_~N~0_463, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1115|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_792|, ~counter~0=v_~counter~0_1416, ~c~0=v_~c~0_476, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_456|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_689, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_800|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_792|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1113|, ~N~0=v_~N~0_463} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:08,372 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [653] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_465 4294967296))) (and (not (= (ite (< 0 (mod v_~counter~0_1424 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_796| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_796|) (= (+ (* 2 v_~c~0_478) v_~counter~0_1422) v_~counter~0_1424) (< (mod v_thread1Thread1of1ForFork0_~i~0_694 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_478) v_~counter~0_1424) 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1121| 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1119|) 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1119|) (= v_thread1Thread1of1ForFork0_~i~0_693 (+ v_thread1Thread1of1ForFork0_~i~0_694 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_796| (ite (< 0 (mod (+ v_~c~0_478 v_~counter~0_1422) 4294967296)) 1 0)))) InVars {~counter~0=v_~counter~0_1424, ~c~0=v_~c~0_478, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_694, ~N~0=v_~N~0_465, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1121|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_796|, ~counter~0=v_~counter~0_1422, ~c~0=v_~c~0_478, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_458|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_693, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_804|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_796|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1119|, ~N~0=v_~N~0_465} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:08,459 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [657] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_469 4294967296)) (.cse1 (ite (< 0 (mod (+ v_~c~0_482 v_~counter~0_1434) 4294967296)) 1 0))) (and (not (= (ite (< 0 (mod v_~counter~0_1436 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1131|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_804| .cse1) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1133| 4294967296) .cse0) (= (+ v_~counter~0_1434 (* 2 v_~c~0_482)) v_~counter~0_1436) (< (mod v_thread1Thread1of1ForFork0_~i~0_702 4294967296) .cse0) (not (= .cse1 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1131|) (= v_thread1Thread1of1ForFork0_~i~0_701 (+ v_thread1Thread1of1ForFork0_~i~0_702 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_804| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_804|))) InVars {~counter~0=v_~counter~0_1436, ~c~0=v_~c~0_482, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_702, ~N~0=v_~N~0_469, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1133|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_804|, ~counter~0=v_~counter~0_1434, ~c~0=v_~c~0_482, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_462|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_701, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_812|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_804|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1131|, ~N~0=v_~N~0_469} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:08,541 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [659] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_471 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_808| (ite (< 0 (mod (+ v_~c~0_484 v_~counter~0_1440) 4294967296)) 1 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1139| 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1137|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_484) v_~counter~0_1442) 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod v_~counter~0_1442 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_705 (+ v_thread1Thread1of1ForFork0_~i~0_706 1)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1137|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_808| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_808|) (= (+ (* 2 v_~c~0_484) v_~counter~0_1440) v_~counter~0_1442) (< (mod v_thread1Thread1of1ForFork0_~i~0_706 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_1442, ~c~0=v_~c~0_484, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_706, ~N~0=v_~N~0_471, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1139|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_808|, ~counter~0=v_~counter~0_1440, ~c~0=v_~c~0_484, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_464|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_705, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_816|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_808|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1137|, ~N~0=v_~N~0_471} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:08,633 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [663] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_475 4294967296))) (and (= v_~counter~0_1454 (+ (* 2 v_~c~0_488) v_~counter~0_1452)) (= v_thread1Thread1of1ForFork0_~i~0_713 (+ v_thread1Thread1of1ForFork0_~i~0_714 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_714 4294967296) .cse0) (= (ite (< 0 (mod (+ v_~c~0_488 v_~counter~0_1452) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_816|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1151| 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_1454 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1149|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_488) v_~counter~0_1454) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_816| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_816|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1149|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_1454, ~c~0=v_~c~0_488, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_714, ~N~0=v_~N~0_475, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1151|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_816|, ~counter~0=v_~counter~0_1452, ~c~0=v_~c~0_488, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_468|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_713, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_824|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_816|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1149|, ~N~0=v_~N~0_475} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:08,725 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [665] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_477 4294967296))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1155|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_1460 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_717 (+ v_thread1Thread1of1ForFork0_~i~0_718 1)) (= (+ (* 2 v_~c~0_490) v_~counter~0_1458) v_~counter~0_1460) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_490) v_~counter~0_1460) 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_718 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1157| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_820| (ite (< 0 (mod (+ v_~c~0_490 v_~counter~0_1458) 4294967296)) 1 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1155|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_820| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_820|))) InVars {~counter~0=v_~counter~0_1460, ~c~0=v_~c~0_490, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_718, ~N~0=v_~N~0_477, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1157|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_820|, ~counter~0=v_~counter~0_1458, ~c~0=v_~c~0_490, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_470|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_717, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_828|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_820|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1155|, ~N~0=v_~N~0_477} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:08,822 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [667] L51-4-->L51-4: Formula: (let ((.cse1 (mod v_~N~0_479 4294967296)) (.cse0 (ite (< 0 (mod (+ v_~c~0_492 v_~counter~0_1464) 4294967296)) 1 0))) (and (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_824|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1163| 4294967296) .cse1) (= (+ v_thread1Thread1of1ForFork0_~i~0_722 1) v_thread1Thread1of1ForFork0_~i~0_721) (= (+ (* 2 v_~c~0_492) v_~counter~0_1464) v_~counter~0_1466) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1161|) (not (= 0 (ite (< 0 (mod v_~counter~0_1466 4294967296)) 1 0))) (< (mod v_thread1Thread1of1ForFork0_~i~0_722 4294967296) .cse1) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1161|) 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_824| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_824|) (not (= .cse0 0)))) InVars {~counter~0=v_~counter~0_1466, ~c~0=v_~c~0_492, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_722, ~N~0=v_~N~0_479, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1163|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_824|, ~counter~0=v_~counter~0_1464, ~c~0=v_~c~0_492, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_472|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_721, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_832|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_824|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1161|, ~N~0=v_~N~0_479} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:08,908 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [671] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_483 4294967296))) (and (= (+ v_thread1Thread1of1ForFork0_~i~0_730 1) v_thread1Thread1of1ForFork0_~i~0_729) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_832| (ite (< 0 (mod (+ v_~c~0_496 v_~counter~0_1476) 4294967296)) 1 0)) (= (+ (* 2 v_~c~0_496) v_~counter~0_1476) v_~counter~0_1478) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1173|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1175| 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_730 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_832| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_832|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1173|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_1478 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_496) v_~counter~0_1478) 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_1478, ~c~0=v_~c~0_496, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_730, ~N~0=v_~N~0_483, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1175|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_832|, ~counter~0=v_~counter~0_1476, ~c~0=v_~c~0_496, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_476|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_729, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_840|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_832|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1173|, ~N~0=v_~N~0_483} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:09,000 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [687] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_499 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1223| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_864| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_864|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1221|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_864| (ite (< 0 (mod (+ v_~c~0_512 v_~counter~0_1524) 4294967296)) 1 0)) (= (+ v_~counter~0_1524 (* 2 v_~c~0_512)) v_~counter~0_1526) (not (= (ite (< 0 (mod v_~counter~0_1526 4294967296)) 1 0) 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_762 1) v_thread1Thread1of1ForFork0_~i~0_761) (< (mod v_thread1Thread1of1ForFork0_~i~0_762 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1221|) 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_512) v_~counter~0_1526) 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_1526, ~c~0=v_~c~0_512, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_762, ~N~0=v_~N~0_499, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1223|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_864|, ~counter~0=v_~counter~0_1524, ~c~0=v_~c~0_512, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_492|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_761, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_872|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_864|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1221|, ~N~0=v_~N~0_499} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:09,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [693] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_505 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_876| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_876|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_876| (ite (< 0 (mod (+ v_~c~0_518 v_~counter~0_1542) 4294967296)) 1 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1241| 4294967296) .cse0) (not (= (ite (< 0 (mod (+ v_~counter~0_1544 (* 4294967295 v_~c~0_518)) 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod v_~counter~0_1544 4294967296)) 1 0) 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_774 1) v_thread1Thread1of1ForFork0_~i~0_773) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1239|) 4294967296) .cse0) (= (+ v_~counter~0_1542 (* 2 v_~c~0_518)) v_~counter~0_1544) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1239|) (< (mod v_thread1Thread1of1ForFork0_~i~0_774 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_1544, ~c~0=v_~c~0_518, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_774, ~N~0=v_~N~0_505, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1241|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_876|, ~counter~0=v_~counter~0_1542, ~c~0=v_~c~0_518, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_498|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_773, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_884|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_876|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1239|, ~N~0=v_~N~0_505} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:09,194 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [695] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_507 4294967296))) (and (= (+ (* 2 v_~c~0_520) v_~counter~0_1548) v_~counter~0_1550) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1247| 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_1550 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_880| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_880|) (not (= (ite (< 0 (mod (+ v_~counter~0_1550 (* 4294967295 v_~c~0_520)) 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_778 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_880| (ite (< 0 (mod (+ v_~c~0_520 v_~counter~0_1548) 4294967296)) 1 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1245|) (= (+ v_thread1Thread1of1ForFork0_~i~0_778 1) v_thread1Thread1of1ForFork0_~i~0_777) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1245|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_1550, ~c~0=v_~c~0_520, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_778, ~N~0=v_~N~0_507, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1247|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_880|, ~counter~0=v_~counter~0_1548, ~c~0=v_~c~0_520, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_500|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_777, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_888|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_880|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1245|, ~N~0=v_~N~0_507} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:09,309 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [699] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_511 4294967296)) (.cse1 (ite (< 0 (mod (+ v_~c~0_524 v_~counter~0_1560) 4294967296)) 1 0))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1259| 4294967296) .cse0) (not (= .cse1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_786 1) v_thread1Thread1of1ForFork0_~i~0_785) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_888| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_888|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1257|) 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_786 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1257|) (= (+ (* 2 v_~c~0_524) v_~counter~0_1560) v_~counter~0_1562) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_888| .cse1) (not (= (ite (< 0 (mod v_~counter~0_1562 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_1562, ~c~0=v_~c~0_524, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_786, ~N~0=v_~N~0_511, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1259|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_888|, ~counter~0=v_~counter~0_1560, ~c~0=v_~c~0_524, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_504|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_785, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_896|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_888|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1257|, ~N~0=v_~N~0_511} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:09,400 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [705] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_517 4294967296))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1275|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_900| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_900|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1275|) 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_798 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1277| 4294967296) .cse0) (= v_~counter~0_1580 (+ (* 2 v_~c~0_530) v_~counter~0_1578)) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_530) v_~counter~0_1580) 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod v_~counter~0_1580 4294967296)) 1 0) 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_798 1) v_thread1Thread1of1ForFork0_~i~0_797) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_900| (ite (< 0 (mod (+ v_~c~0_530 v_~counter~0_1578) 4294967296)) 1 0)))) InVars {~counter~0=v_~counter~0_1580, ~c~0=v_~c~0_530, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_798, ~N~0=v_~N~0_517, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1277|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_900|, ~counter~0=v_~counter~0_1578, ~c~0=v_~c~0_530, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_510|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_797, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_908|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_900|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1275|, ~N~0=v_~N~0_517} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:09,488 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [707] L51-4-->L51-4: Formula: (let ((.cse1 (mod v_~N~0_519 4294967296)) (.cse0 (ite (< 0 (mod (+ v_~c~0_532 v_~counter~0_1584) 4294967296)) 1 0))) (and (not (= (ite (< 0 (mod v_~counter~0_1586 4294967296)) 1 0) 0)) (= (+ (* 2 v_~c~0_532) v_~counter~0_1584) v_~counter~0_1586) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_904| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_904|) (not (= .cse0 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1283| 4294967296) .cse1) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1281|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1281|) 4294967296) .cse1) (< (mod v_thread1Thread1of1ForFork0_~i~0_802 4294967296) .cse1) (= (+ v_thread1Thread1of1ForFork0_~i~0_802 1) v_thread1Thread1of1ForFork0_~i~0_801) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_904|))) InVars {~counter~0=v_~counter~0_1586, ~c~0=v_~c~0_532, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_802, ~N~0=v_~N~0_519, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1283|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_904|, ~counter~0=v_~counter~0_1584, ~c~0=v_~c~0_532, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_512|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_801, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_912|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_904|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1281|, ~N~0=v_~N~0_519} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:09,574 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [709] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_534 v_~counter~0_1590) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_521 4294967296))) (and (= v_~counter~0_1592 (+ (* 2 v_~c~0_534) v_~counter~0_1590)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_908| .cse0) (= (+ v_thread1Thread1of1ForFork0_~i~0_806 1) v_thread1Thread1of1ForFork0_~i~0_805) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_908| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_908|) (not (= (ite (< 0 (mod v_~counter~0_1592 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_806 4294967296) .cse1) (not (= .cse0 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1287|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1289| 4294967296) .cse1) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1287|) 4294967296) .cse1))) InVars {~counter~0=v_~counter~0_1592, ~c~0=v_~c~0_534, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_806, ~N~0=v_~N~0_521, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1289|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_908|, ~counter~0=v_~counter~0_1590, ~c~0=v_~c~0_534, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_514|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_805, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_916|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_908|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1287|, ~N~0=v_~N~0_521} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:09,668 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [713] L51-4-->L51-4: Formula: (let ((.cse1 (mod v_~N~0_525 4294967296)) (.cse0 (ite (< 0 (mod (+ v_~c~0_538 v_~counter~0_1602) 4294967296)) 1 0))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_916| .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1299|) (< (mod v_thread1Thread1of1ForFork0_~i~0_814 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_916| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_916|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1301| 4294967296) .cse1) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1299|) 4294967296) .cse1) (not (= (ite (< 0 (mod v_~counter~0_1604 4294967296)) 1 0) 0)) (not (= .cse0 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_814 1) v_thread1Thread1of1ForFork0_~i~0_813) (= v_~counter~0_1604 (+ (* 2 v_~c~0_538) v_~counter~0_1602)))) InVars {~counter~0=v_~counter~0_1604, ~c~0=v_~c~0_538, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_814, ~N~0=v_~N~0_525, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1301|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_916|, ~counter~0=v_~counter~0_1602, ~c~0=v_~c~0_538, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_518|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_813, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_924|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_916|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1299|, ~N~0=v_~N~0_525} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:09,789 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [715] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_527 4294967296))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1305|) 4294967296) .cse0) (= (+ v_~counter~0_1608 (* 2 v_~c~0_540)) v_~counter~0_1610) (= (ite (< 0 (mod (+ v_~c~0_540 v_~counter~0_1608) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_920|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1307| 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_540) v_~counter~0_1610) 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod v_~counter~0_1610 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_818 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_920| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_920|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1305|) (= (+ v_thread1Thread1of1ForFork0_~i~0_818 1) v_thread1Thread1of1ForFork0_~i~0_817))) InVars {~counter~0=v_~counter~0_1610, ~c~0=v_~c~0_540, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_818, ~N~0=v_~N~0_527, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1307|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_920|, ~counter~0=v_~counter~0_1608, ~c~0=v_~c~0_540, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_520|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_817, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_928|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_920|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1305|, ~N~0=v_~N~0_527} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:09,920 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [717] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_542 v_~counter~0_1614) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_529 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1313| 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_821 (+ v_thread1Thread1of1ForFork0_~i~0_822 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_924| .cse1) (not (= .cse1 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_822 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1311|) 4294967296) .cse0) (= v_~counter~0_1616 (+ (* 2 v_~c~0_542) v_~counter~0_1614)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_924| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_924|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1311|) (not (= (ite (< 0 (mod v_~counter~0_1616 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_1616, ~c~0=v_~c~0_542, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_822, ~N~0=v_~N~0_529, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1313|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_924|, ~counter~0=v_~counter~0_1614, ~c~0=v_~c~0_542, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_522|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_821, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_932|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_924|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1311|, ~N~0=v_~N~0_529} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:10,038 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [723] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_535 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_936| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_936|) (= v_~counter~0_1634 (+ v_~counter~0_1632 (* 2 v_~c~0_548))) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1329|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1329|) 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_833 (+ v_thread1Thread1of1ForFork0_~i~0_834 1)) (not (= (ite (< 0 (mod v_~counter~0_1634 4294967296)) 1 0) 0)) (not (= 0 (ite (< 0 (mod (+ (* 4294967295 v_~c~0_548) v_~counter~0_1634) 4294967296)) 1 0))) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1331| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_936| (ite (< 0 (mod (+ v_~c~0_548 v_~counter~0_1632) 4294967296)) 1 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_834 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_1634, ~c~0=v_~c~0_548, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_834, ~N~0=v_~N~0_535, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1331|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_936|, ~counter~0=v_~counter~0_1632, ~c~0=v_~c~0_548, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_528|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_833, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_944|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_936|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1329|, ~N~0=v_~N~0_535} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:10,177 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [727] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_539 4294967296)) (.cse1 (ite (< 0 (mod (+ v_~c~0_552 v_~counter~0_1644) 4294967296)) 1 0))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1343| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_944| .cse1) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1341|) 4294967296) .cse0) (= v_~counter~0_1646 (+ (* 2 v_~c~0_552) v_~counter~0_1644)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1341|) (= v_thread1Thread1of1ForFork0_~i~0_841 (+ v_thread1Thread1of1ForFork0_~i~0_842 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_842 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_944| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_944|) (not (= .cse1 0)) (not (= (ite (< 0 (mod v_~counter~0_1646 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_1646, ~c~0=v_~c~0_552, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_842, ~N~0=v_~N~0_539, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1343|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_944|, ~counter~0=v_~counter~0_1644, ~c~0=v_~c~0_552, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_532|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_841, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_952|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_944|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1341|, ~N~0=v_~N~0_539} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:10,267 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [729] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_554 v_~counter~0_1650) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_541 4294967296))) (and (not (= (ite (< 0 (mod v_~counter~0_1652 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1349| 4294967296) .cse0) (= (+ (* 2 v_~c~0_554) v_~counter~0_1650) v_~counter~0_1652) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1347|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_948| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_948|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_948| .cse1) (not (= .cse1 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1347|) 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_846 4294967296) .cse0) (= (+ v_thread1Thread1of1ForFork0_~i~0_846 1) v_thread1Thread1of1ForFork0_~i~0_845))) InVars {~counter~0=v_~counter~0_1652, ~c~0=v_~c~0_554, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_846, ~N~0=v_~N~0_541, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1349|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_948|, ~counter~0=v_~counter~0_1650, ~c~0=v_~c~0_554, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_534|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_845, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_956|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_948|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1347|, ~N~0=v_~N~0_541} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:10,361 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [731] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_556 v_~counter~0_1656) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_543 4294967296))) (and (= (+ v_thread1Thread1of1ForFork0_~i~0_850 1) v_thread1Thread1of1ForFork0_~i~0_849) (not (= (ite (< 0 (mod v_~counter~0_1658 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_952| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_952|) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_952| .cse0) (= (+ (* 2 v_~c~0_556) v_~counter~0_1656) v_~counter~0_1658) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1353|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1353|) 4294967296) .cse1) (< (mod v_thread1Thread1of1ForFork0_~i~0_850 4294967296) .cse1) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1355| 4294967296) .cse1))) InVars {~counter~0=v_~counter~0_1658, ~c~0=v_~c~0_556, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_850, ~N~0=v_~N~0_543, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1355|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_952|, ~counter~0=v_~counter~0_1656, ~c~0=v_~c~0_556, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_536|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_849, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_960|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_952|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1353|, ~N~0=v_~N~0_543} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:10,453 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [733] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_558 v_~counter~0_1662) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_545 4294967296))) (and (not (= .cse0 0)) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_956|) (< (mod v_thread1Thread1of1ForFork0_~i~0_854 4294967296) .cse1) (= v_~counter~0_1664 (+ v_~counter~0_1662 (* 2 v_~c~0_558))) (= (+ v_thread1Thread1of1ForFork0_~i~0_854 1) v_thread1Thread1of1ForFork0_~i~0_853) (not (= (ite (< 0 (mod v_~counter~0_1664 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1359|) 4294967296) .cse1) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1361| 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_956| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_956|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1359|))) InVars {~counter~0=v_~counter~0_1664, ~c~0=v_~c~0_558, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_854, ~N~0=v_~N~0_545, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1361|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_956|, ~counter~0=v_~counter~0_1662, ~c~0=v_~c~0_558, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_538|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_853, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_964|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_956|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1359|, ~N~0=v_~N~0_545} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:10,540 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [737] L51-4-->L51-4: Formula: (let ((.cse1 (mod v_~N~0_549 4294967296)) (.cse0 (ite (< 0 (mod (+ v_~c~0_562 v_~counter~0_1674) 4294967296)) 1 0))) (and (not (= .cse0 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_862 4294967296) .cse1) (= (+ v_thread1Thread1of1ForFork0_~i~0_862 1) v_thread1Thread1of1ForFork0_~i~0_861) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_964| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_964|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1373| 4294967296) .cse1) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1371|) 4294967296) .cse1) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1371|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_964| .cse0) (not (= (ite (< 0 (mod v_~counter~0_1676 4294967296)) 1 0) 0)) (= (+ v_~counter~0_1674 (* 2 v_~c~0_562)) v_~counter~0_1676))) InVars {~counter~0=v_~counter~0_1676, ~c~0=v_~c~0_562, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_862, ~N~0=v_~N~0_549, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1373|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_964|, ~counter~0=v_~counter~0_1674, ~c~0=v_~c~0_562, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_542|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_861, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_972|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_964|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1371|, ~N~0=v_~N~0_549} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:10,634 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [741] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_553 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1385| 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_566) v_~counter~0_1688) 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod v_~counter~0_1688 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_870 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_972| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_972|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1383|) (= (+ v_~counter~0_1686 (* 2 v_~c~0_566)) v_~counter~0_1688) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1383|) 4294967296) .cse0) (= (+ v_thread1Thread1of1ForFork0_~i~0_870 1) v_thread1Thread1of1ForFork0_~i~0_869) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_972| (ite (< 0 (mod (+ v_~c~0_566 v_~counter~0_1686) 4294967296)) 1 0)))) InVars {~counter~0=v_~counter~0_1688, ~c~0=v_~c~0_566, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_870, ~N~0=v_~N~0_553, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1385|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_972|, ~counter~0=v_~counter~0_1686, ~c~0=v_~c~0_566, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_546|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_869, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_980|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_972|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1383|, ~N~0=v_~N~0_553} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:10,725 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [743] L51-4-->L51-4: Formula: (let ((.cse1 (mod v_~N~0_555 4294967296)) (.cse0 (ite (< 0 (mod (+ v_~c~0_568 v_~counter~0_1692) 4294967296)) 1 0))) (and (= (+ (* 2 v_~c~0_568) v_~counter~0_1692) v_~counter~0_1694) (= (+ v_thread1Thread1of1ForFork0_~i~0_874 1) v_thread1Thread1of1ForFork0_~i~0_873) (not (= .cse0 0)) (not (= (ite (< 0 (mod v_~counter~0_1694 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1389|) 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_976| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_976|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1391| 4294967296) .cse1) (< (mod v_thread1Thread1of1ForFork0_~i~0_874 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_976| .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1389|))) InVars {~counter~0=v_~counter~0_1694, ~c~0=v_~c~0_568, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_874, ~N~0=v_~N~0_555, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1391|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_976|, ~counter~0=v_~counter~0_1692, ~c~0=v_~c~0_568, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_548|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_873, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_984|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_976|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1389|, ~N~0=v_~N~0_555} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:10,811 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [745] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_557 4294967296))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1395|) (= (+ (* 2 v_~c~0_570) v_~counter~0_1698) v_~counter~0_1700) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1395|) 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_878 4294967296) .cse0) (= (+ v_thread1Thread1of1ForFork0_~i~0_878 1) v_thread1Thread1of1ForFork0_~i~0_877) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_980| (ite (< 0 (mod (+ v_~c~0_570 v_~counter~0_1698) 4294967296)) 1 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1397| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_980| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_980|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_570) v_~counter~0_1700) 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod v_~counter~0_1700 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_1700, ~c~0=v_~c~0_570, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_878, ~N~0=v_~N~0_557, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1397|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_980|, ~counter~0=v_~counter~0_1698, ~c~0=v_~c~0_570, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_550|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_877, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_988|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_980|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1395|, ~N~0=v_~N~0_557} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:10,900 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [747] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_572 v_~counter~0_1704) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_559 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1403| 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_881 (+ v_thread1Thread1of1ForFork0_~i~0_882 1)) (not (= .cse1 0)) (= v_~counter~0_1706 (+ (* 2 v_~c~0_572) v_~counter~0_1704)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_984| .cse1) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1401|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1401|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_1706 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_882 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_984| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_984|))) InVars {~counter~0=v_~counter~0_1706, ~c~0=v_~c~0_572, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_882, ~N~0=v_~N~0_559, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1403|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_984|, ~counter~0=v_~counter~0_1704, ~c~0=v_~c~0_572, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_552|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_881, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_992|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_984|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1401|, ~N~0=v_~N~0_559} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:10,985 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [749] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_561 4294967296))) (and (= v_~counter~0_1712 (+ (* 2 v_~c~0_574) v_~counter~0_1710)) (not (= (ite (< 0 (mod v_~counter~0_1712 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_574) v_~counter~0_1712) 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_886 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_988| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_988|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_988| (ite (< 0 (mod (+ v_~c~0_574 v_~counter~0_1710) 4294967296)) 1 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1407|) (= (+ v_thread1Thread1of1ForFork0_~i~0_886 1) v_thread1Thread1of1ForFork0_~i~0_885) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1409| 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1407|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_1712, ~c~0=v_~c~0_574, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_886, ~N~0=v_~N~0_561, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1409|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_988|, ~counter~0=v_~counter~0_1710, ~c~0=v_~c~0_574, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_554|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_885, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_996|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_988|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1407|, ~N~0=v_~N~0_561} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:11,080 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [751] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_563 4294967296))) (and (< (mod v_thread1Thread1of1ForFork0_~i~0_890 4294967296) .cse0) (= (ite (< 0 (mod (+ v_~c~0_576 v_~counter~0_1716) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_992|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1413|) 4294967296) .cse0) (= v_~counter~0_1718 (+ (* 2 v_~c~0_576) v_~counter~0_1716)) (= (+ v_thread1Thread1of1ForFork0_~i~0_890 1) v_thread1Thread1of1ForFork0_~i~0_889) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1415| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_992| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_992|) (not (= (ite (< 0 (mod (+ v_~counter~0_1718 (* 4294967295 v_~c~0_576)) 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod v_~counter~0_1718 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1413|))) InVars {~counter~0=v_~counter~0_1718, ~c~0=v_~c~0_576, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_890, ~N~0=v_~N~0_563, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1415|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_992|, ~counter~0=v_~counter~0_1716, ~c~0=v_~c~0_576, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_556|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_889, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1000|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_992|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1413|, ~N~0=v_~N~0_563} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:11,181 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [755] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_580 v_~counter~0_1728) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_567 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1000| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1000|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1000| .cse0) (not (= .cse0 0)) (= v_~counter~0_1730 (+ (* 2 v_~c~0_580) v_~counter~0_1728)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1425|) (= (+ v_thread1Thread1of1ForFork0_~i~0_898 1) v_thread1Thread1of1ForFork0_~i~0_897) (< (mod v_thread1Thread1of1ForFork0_~i~0_898 4294967296) .cse1) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1425|) 4294967296) .cse1) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1427| 4294967296) .cse1) (not (= (ite (< 0 (mod v_~counter~0_1730 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_1730, ~c~0=v_~c~0_580, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_898, ~N~0=v_~N~0_567, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1427|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1000|, ~counter~0=v_~counter~0_1728, ~c~0=v_~c~0_580, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_560|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_897, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1008|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1000|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1425|, ~N~0=v_~N~0_567} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:11,277 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [757] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_569 4294967296))) (and (= (ite (< 0 (mod (+ v_~c~0_582 v_~counter~0_1734) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1004|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_582) v_~counter~0_1736) 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1431|) 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1431|) (< (mod v_thread1Thread1of1ForFork0_~i~0_902 4294967296) .cse0) (= (+ v_thread1Thread1of1ForFork0_~i~0_902 1) v_thread1Thread1of1ForFork0_~i~0_901) (= v_~counter~0_1736 (+ v_~counter~0_1734 (* 2 v_~c~0_582))) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1433| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1004| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1004|) (not (= (ite (< 0 (mod v_~counter~0_1736 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_1736, ~c~0=v_~c~0_582, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_902, ~N~0=v_~N~0_569, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1433|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1004|, ~counter~0=v_~counter~0_1734, ~c~0=v_~c~0_582, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_562|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_901, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1012|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1004|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1431|, ~N~0=v_~N~0_569} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:11,369 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [761] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_573 4294967296))) (and (not (= (ite (< 0 (mod v_~counter~0_1748 4294967296)) 1 0) 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_910 1) v_thread1Thread1of1ForFork0_~i~0_909) (= (+ (* 2 v_~c~0_586) v_~counter~0_1746) v_~counter~0_1748) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1443|) 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_910 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1445| 4294967296) .cse0) (= (ite (< 0 (mod (+ v_~c~0_586 v_~counter~0_1746) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1012|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_586) v_~counter~0_1748) 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1443|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1012| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1012|))) InVars {~counter~0=v_~counter~0_1748, ~c~0=v_~c~0_586, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_910, ~N~0=v_~N~0_573, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1445|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1012|, ~counter~0=v_~counter~0_1746, ~c~0=v_~c~0_586, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_566|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_909, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1020|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1012|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1443|, ~N~0=v_~N~0_573} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:11,461 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [767] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_592 v_~counter~0_1764) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_579 4294967296))) (and (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1024|) (= (+ v_thread1Thread1of1ForFork0_~i~0_922 1) v_thread1Thread1of1ForFork0_~i~0_921) (< (mod v_thread1Thread1of1ForFork0_~i~0_922 4294967296) .cse1) (not (= (ite (< 0 (mod v_~counter~0_1766 4294967296)) 1 0) 0)) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1024| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1024|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1463| 4294967296) .cse1) (= (+ v_~counter~0_1764 (* 2 v_~c~0_592)) v_~counter~0_1766) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1461|) 4294967296) .cse1) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1461|))) InVars {~counter~0=v_~counter~0_1766, ~c~0=v_~c~0_592, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_922, ~N~0=v_~N~0_579, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1463|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1024|, ~counter~0=v_~counter~0_1764, ~c~0=v_~c~0_592, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_572|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_921, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1032|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1024|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1461|, ~N~0=v_~N~0_579} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:11,587 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 02:00:11,588 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19746 [2022-12-13 02:00:11,588 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 751 transitions, 30804 flow [2022-12-13 02:00:11,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:11,588 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:11,588 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:11,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-13 02:00:11,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-13 02:00:11,793 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:11,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:11,794 INFO L85 PathProgramCache]: Analyzing trace with hash 721679600, now seen corresponding path program 1 times [2022-12-13 02:00:11,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:11,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7265376] [2022-12-13 02:00:11,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:11,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:11,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:11,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:11,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7265376] [2022-12-13 02:00:11,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7265376] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:00:11,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800047836] [2022-12-13 02:00:11,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:11,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:00:11,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:00:11,860 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:00:11,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-13 02:00:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:11,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 02:00:11,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:00:11,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:11,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:00:12,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:12,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800047836] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:00:12,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:00:12,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-13 02:00:12,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327008443] [2022-12-13 02:00:12,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:00:12,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:00:12,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:12,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:00:12,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:00:12,025 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 133 [2022-12-13 02:00:12,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 751 transitions, 30804 flow. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:12,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:12,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 133 [2022-12-13 02:00:12,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:15,432 INFO L130 PetriNetUnfolder]: 3741/7882 cut-off events. [2022-12-13 02:00:15,432 INFO L131 PetriNetUnfolder]: For 800112/800112 co-relation queries the response was YES. [2022-12-13 02:00:15,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111124 conditions, 7882 events. 3741/7882 cut-off events. For 800112/800112 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 71554 event pairs, 1456 based on Foata normal form. 136/8014 useless extension candidates. Maximal degree in co-relation 109542. Up to 6540 conditions per place. [2022-12-13 02:00:15,526 INFO L137 encePairwiseOnDemand]: 95/133 looper letters, 521 selfloop transitions, 231 changer transitions 39/791 dead transitions. [2022-12-13 02:00:15,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 791 transitions, 29626 flow [2022-12-13 02:00:15,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 02:00:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 02:00:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 120 transitions. [2022-12-13 02:00:15,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.05639097744360902 [2022-12-13 02:00:15,528 INFO L175 Difference]: Start difference. First operand has 280 places, 751 transitions, 30804 flow. Second operand 16 states and 120 transitions. [2022-12-13 02:00:15,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 791 transitions, 29626 flow [2022-12-13 02:00:18,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 791 transitions, 29411 flow, removed 60 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:18,056 INFO L231 Difference]: Finished difference. Result has 292 places, 689 transitions, 26524 flow [2022-12-13 02:00:18,057 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=25167, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=26524, PETRI_PLACES=292, PETRI_TRANSITIONS=689} [2022-12-13 02:00:18,057 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 272 predicate places. [2022-12-13 02:00:18,057 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:18,057 INFO L89 Accepts]: Start accepts. Operand has 292 places, 689 transitions, 26524 flow [2022-12-13 02:00:18,062 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:18,062 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:18,062 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 292 places, 689 transitions, 26524 flow [2022-12-13 02:00:18,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 288 places, 689 transitions, 26524 flow [2022-12-13 02:00:18,634 INFO L130 PetriNetUnfolder]: 732/3075 cut-off events. [2022-12-13 02:00:18,634 INFO L131 PetriNetUnfolder]: For 223402/223405 co-relation queries the response was YES. [2022-12-13 02:00:18,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38892 conditions, 3075 events. 732/3075 cut-off events. For 223402/223405 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 36205 event pairs, 58 based on Foata normal form. 0/3070 useless extension candidates. Maximal degree in co-relation 38316. Up to 832 conditions per place. [2022-12-13 02:00:18,699 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 288 places, 689 transitions, 26524 flow [2022-12-13 02:00:18,700 INFO L226 LiptonReduction]: Number of co-enabled transitions 2276 [2022-12-13 02:00:18,709 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:18,709 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:18,932 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [512] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (+ v_~counter~0_971 (* 2 v_~c~0_336)))) (and (= v_thread1Thread1of1ForFork0_~i~0_392 8) (not (= (ite (< 0 (mod (+ v_~counter~0_971 v_~c~0_336) 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod .cse0 4294967296)) 1 0) 0)) (= v_~counter~0_969 .cse0) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_682|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_499| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_499|) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_392) 4294967296) (mod v_~N~0_323 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_499| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_499| (ite (< 0 (mod (+ v_~counter~0_969 v_~c~0_336) 4294967296)) 1 0)))) InVars {~counter~0=v_~counter~0_971, ~c~0=v_~c~0_336, ~N~0=v_~N~0_323} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_499|, ~counter~0=v_~counter~0_969, ~c~0=v_~c~0_336, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_293|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_392, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_507|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_499|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_682|, ~N~0=v_~N~0_323} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 02:00:19,110 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:00:19,112 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1055 [2022-12-13 02:00:19,112 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 687 transitions, 26474 flow [2022-12-13 02:00:19,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:19,112 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:19,113 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:19,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-13 02:00:19,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-12-13 02:00:19,316 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:19,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:19,317 INFO L85 PathProgramCache]: Analyzing trace with hash 968070200, now seen corresponding path program 1 times [2022-12-13 02:00:19,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:19,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359758967] [2022-12-13 02:00:19,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:19,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:19,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:19,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:19,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359758967] [2022-12-13 02:00:19,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359758967] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:00:19,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134735275] [2022-12-13 02:00:19,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:19,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:00:19,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:00:19,397 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:00:19,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-13 02:00:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:19,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 02:00:19,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:00:19,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:19,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:00:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:19,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134735275] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:00:19,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:00:19,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-13 02:00:19,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436237170] [2022-12-13 02:00:19,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:00:19,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 02:00:19,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:19,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 02:00:19,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-13 02:00:19,647 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-13 02:00:19,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 687 transitions, 26474 flow. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:19,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:19,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-13 02:00:19,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:24,744 INFO L130 PetriNetUnfolder]: 4143/8727 cut-off events. [2022-12-13 02:00:24,744 INFO L131 PetriNetUnfolder]: For 907124/907124 co-relation queries the response was YES. [2022-12-13 02:00:24,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127651 conditions, 8727 events. 4143/8727 cut-off events. For 907124/907124 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 80219 event pairs, 989 based on Foata normal form. 10/8733 useless extension candidates. Maximal degree in co-relation 125903. Up to 5302 conditions per place. [2022-12-13 02:00:24,863 INFO L137 encePairwiseOnDemand]: 18/58 looper letters, 660 selfloop transitions, 227 changer transitions 21/908 dead transitions. [2022-12-13 02:00:24,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 908 transitions, 34450 flow [2022-12-13 02:00:24,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 02:00:24,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 02:00:24,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 130 transitions. [2022-12-13 02:00:24,865 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16009852216748768 [2022-12-13 02:00:24,865 INFO L175 Difference]: Start difference. First operand has 286 places, 687 transitions, 26474 flow. Second operand 14 states and 130 transitions. [2022-12-13 02:00:24,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 908 transitions, 34450 flow [2022-12-13 02:00:28,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 908 transitions, 33881 flow, removed 277 selfloop flow, removed 1 redundant places. [2022-12-13 02:00:28,077 INFO L231 Difference]: Finished difference. Result has 302 places, 697 transitions, 26804 flow [2022-12-13 02:00:28,077 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=25947, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=217, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=26804, PETRI_PLACES=302, PETRI_TRANSITIONS=697} [2022-12-13 02:00:28,078 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 282 predicate places. [2022-12-13 02:00:28,078 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:28,078 INFO L89 Accepts]: Start accepts. Operand has 302 places, 697 transitions, 26804 flow [2022-12-13 02:00:28,083 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:28,083 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:28,083 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 302 places, 697 transitions, 26804 flow [2022-12-13 02:00:28,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 302 places, 697 transitions, 26804 flow [2022-12-13 02:00:28,805 INFO L130 PetriNetUnfolder]: 811/3438 cut-off events. [2022-12-13 02:00:28,805 INFO L131 PetriNetUnfolder]: For 271655/271677 co-relation queries the response was YES. [2022-12-13 02:00:28,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44220 conditions, 3438 events. 811/3438 cut-off events. For 271655/271677 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 41394 event pairs, 79 based on Foata normal form. 0/3430 useless extension candidates. Maximal degree in co-relation 43635. Up to 955 conditions per place. [2022-12-13 02:00:28,862 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 302 places, 697 transitions, 26804 flow [2022-12-13 02:00:28,862 INFO L226 LiptonReduction]: Number of co-enabled transitions 2304 [2022-12-13 02:00:28,868 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:29,251 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:29,251 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:29,252 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:29,351 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:29,351 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:29,352 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:29,427 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:29,427 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:29,427 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:29,498 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:29,498 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:29,498 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:29,564 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:29,564 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:29,564 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:29,633 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:29,633 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:29,633 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:29,700 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:29,700 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:29,700 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:29,769 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:29,769 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:29,769 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:29,839 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:29,839 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:29,840 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:29,906 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:29,906 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:29,906 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,004 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:30,004 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,004 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:30,103 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,103 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,201 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:30,201 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,201 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,299 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:30,300 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,300 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,403 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:30,404 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,404 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,491 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:30,492 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,492 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,560 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:30,561 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,561 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,638 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:30,639 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,639 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,705 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:30,706 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,706 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,782 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:30,782 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,782 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,851 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:30,851 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,851 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,923 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:30,924 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,924 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,994 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:30,994 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:30,994 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,061 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:31,061 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,061 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,133 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:31,134 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,134 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,219 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:31,219 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,219 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,294 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:31,295 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,295 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,370 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:31,370 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,370 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,441 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:31,441 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,442 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,512 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:31,512 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,513 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,585 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:31,585 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,585 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,657 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:31,658 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,658 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,732 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:31,732 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,732 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,803 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:31,803 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,803 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,877 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:31,877 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,877 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,946 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:31,946 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:31,946 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,014 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:32,014 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,014 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,092 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:32,092 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,092 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,163 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:32,164 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,164 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,234 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:32,235 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,235 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,305 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:32,305 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,305 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,377 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:32,377 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,378 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,448 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:32,448 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,448 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,523 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:32,523 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,524 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,590 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:32,591 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,591 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,667 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [337] L41-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_113 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_114| (ite (< 0 (mod (+ v_~counter~0_299 v_~c~0_126) 4294967296)) 1 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_~i~1#1_158| (+ |v_thread2Thread1of1ForFork1_~i~1#1_159| 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_114| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_114|) (= v_~counter~0_299 v_~counter~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_148 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_114| 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_148 1) v_thread1Thread1of1ForFork0_~i~0_147))) InVars {~counter~0=v_~counter~0_299, ~c~0=v_~c~0_126, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_148, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~N~0=v_~N~0_113} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_114|, ~counter~0=v_~counter~0_297, ~c~0=v_~c~0_126, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_110|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_147, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_122|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_114|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_158|, ~N~0=v_~N~0_113} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:32,668 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,668 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,840 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:32,841 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,841 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,914 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:32,914 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,914 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,990 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:32,990 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:32,990 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:33,059 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:33,060 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:33,060 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:33,169 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:33,256 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:33,340 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:33,340 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:33,340 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:33,408 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:33,408 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:33,409 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:33,476 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:33,477 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:33,477 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:33,545 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:33,545 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:33,545 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:33,610 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:33,611 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:33,611 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:33,681 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:33,681 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:33,682 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:33,750 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:33,837 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:33,838 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:33,838 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:33,914 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:33,914 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:33,914 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:33,985 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:34,076 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:34,076 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,076 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,145 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:34,145 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,145 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,223 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:34,223 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,223 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,289 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:34,290 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,290 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,364 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:34,372 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,372 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,445 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:34,445 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,445 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,521 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:34,521 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,523 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,589 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:34,590 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,590 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,658 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:34,659 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,659 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,726 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:34,727 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,727 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,792 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:34,792 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,792 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,861 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:34,862 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,862 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,954 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:34,954 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:34,955 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:35,050 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:35,050 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:35,050 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:35,146 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:35,146 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:35,146 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:35,244 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:35,245 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:35,245 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:35,344 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:35,344 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:35,345 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:35,447 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:35,448 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:35,448 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:35,545 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:35,546 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:35,546 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:35,643 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:35,643 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:35,643 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:35,740 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:35,741 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:35,741 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:35,843 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:35,843 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:35,843 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:35,942 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:35,942 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:35,943 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,041 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:36,041 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,041 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,149 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:36,149 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,149 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,251 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:36,252 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,252 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,351 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:36,351 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,352 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,447 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:36,447 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,447 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,526 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:36,527 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,527 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,634 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:36,635 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,635 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,710 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:36,710 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,710 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,776 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:36,776 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,776 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,850 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:36,851 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,851 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,931 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:36,931 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:36,931 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:37,032 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:37,033 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:37,033 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:37,131 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:37,131 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:37,131 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:37,236 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:37,236 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:37,236 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:37,341 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:37,342 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:37,342 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:37,443 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:37,443 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:37,443 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:37,557 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:37,557 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:37,557 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:37,661 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:37,662 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:37,662 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:37,766 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:37,766 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:37,766 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:37,868 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:37,868 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:37,868 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:37,970 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:37,970 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:37,970 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,074 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:38,075 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,075 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,183 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:38,184 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,184 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,291 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:38,291 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,291 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,387 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:38,387 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,387 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,487 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:38,487 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,487 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,590 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:38,590 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,591 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,678 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:38,678 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,678 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,747 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:38,747 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,748 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,813 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:38,813 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,814 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,883 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:38,884 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,884 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,982 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:38,982 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:38,982 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:39,088 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:39,088 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:39,088 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:39,193 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:39,193 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:39,193 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:39,301 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:39,301 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:39,301 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:39,411 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:39,411 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:39,411 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:39,516 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:39,516 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:39,516 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:00:39,642 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [852] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_743 4294967296))) (and (not (= (ite (< 0 (mod v_~counter~0_2266 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1796|) (= (ite (< 0 (mod (+ v_~c~0_756 v_~counter~0_2264) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1201|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1252 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_1251 (+ v_thread1Thread1of1ForFork0_~i~0_1252 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1798| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1201| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1201|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1796|) 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_756) v_~counter~0_2266) 4294967296)) 1 0) 0)) (= (+ v_~counter~0_2264 (* 2 v_~c~0_756)) v_~counter~0_2266))) InVars {~counter~0=v_~counter~0_2266, ~c~0=v_~c~0_756, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1252, ~N~0=v_~N~0_743, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1798|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1201|, ~counter~0=v_~counter~0_2264, ~c~0=v_~c~0_756, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_898|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1251, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1209|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1201|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1796|, ~N~0=v_~N~0_743} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:39,766 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [854] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_745 4294967296))) (and (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_758) v_~counter~0_2272) 4294967296)) 1 0) 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_1256 1) v_thread1Thread1of1ForFork0_~i~0_1255) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1205| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1205|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1802|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1802|) 4294967296) .cse0) (= (+ (* 2 v_~c~0_758) v_~counter~0_2270) v_~counter~0_2272) (< (mod v_thread1Thread1of1ForFork0_~i~0_1256 4294967296) .cse0) (= (ite (< 0 (mod (+ v_~c~0_758 v_~counter~0_2270) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1205|) (not (= (ite (< 0 (mod v_~counter~0_2272 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1804| 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2272, ~c~0=v_~c~0_758, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1256, ~N~0=v_~N~0_745, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1804|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1205|, ~counter~0=v_~counter~0_2270, ~c~0=v_~c~0_758, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_900|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1255, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1213|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1205|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1802|, ~N~0=v_~N~0_745} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:39,902 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [856] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_747 4294967296))) (and (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_760) v_~counter~0_2278) 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_1259 (+ v_thread1Thread1of1ForFork0_~i~0_1260 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1810| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1209| (ite (< 0 (mod (+ v_~c~0_760 v_~counter~0_2276) 4294967296)) 1 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1808|) 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1808|) (= (+ (* 2 v_~c~0_760) v_~counter~0_2276) v_~counter~0_2278) (< (mod v_thread1Thread1of1ForFork0_~i~0_1260 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2278 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1209| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1209|))) InVars {~counter~0=v_~counter~0_2278, ~c~0=v_~c~0_760, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1260, ~N~0=v_~N~0_747, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1810|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1209|, ~counter~0=v_~counter~0_2276, ~c~0=v_~c~0_760, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_902|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1259, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1217|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1209|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1808|, ~N~0=v_~N~0_747} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:40,035 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [858] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_749 4294967296))) (and (not (= (ite (< 0 (mod v_~counter~0_2284 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1814|) 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1814|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1264 4294967296) .cse0) (= (+ (* 2 v_~c~0_762) v_~counter~0_2282) v_~counter~0_2284) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1213| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1213|) (= (+ v_thread1Thread1of1ForFork0_~i~0_1264 1) v_thread1Thread1of1ForFork0_~i~0_1263) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1816| 4294967296) .cse0) (= (ite (< 0 (mod (+ v_~c~0_762 v_~counter~0_2282) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1213|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_762) v_~counter~0_2284) 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_2284, ~c~0=v_~c~0_762, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1264, ~N~0=v_~N~0_749, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1816|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1213|, ~counter~0=v_~counter~0_2282, ~c~0=v_~c~0_762, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_904|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1263, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1221|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1213|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1814|, ~N~0=v_~N~0_749} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:40,164 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [862] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_766 v_~counter~0_2294) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_753 4294967296))) (and (< (mod v_thread1Thread1of1ForFork0_~i~0_1272 4294967296) .cse0) (= (+ (* 2 v_~c~0_766) v_~counter~0_2294) v_~counter~0_2296) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1826|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1828| 4294967296) .cse0) (= .cse1 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1221|) (not (= .cse1 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1826|) 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_1271 (+ v_thread1Thread1of1ForFork0_~i~0_1272 1)) (not (= (ite (< 0 (mod v_~counter~0_2296 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1221| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1221|))) InVars {~counter~0=v_~counter~0_2296, ~c~0=v_~c~0_766, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1272, ~N~0=v_~N~0_753, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1828|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1221|, ~counter~0=v_~counter~0_2294, ~c~0=v_~c~0_766, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_908|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1271, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1229|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1221|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1826|, ~N~0=v_~N~0_753} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:40,285 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [866] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_757 4294967296))) (and (= (+ v_~counter~0_2306 (* 2 v_~c~0_770)) v_~counter~0_2308) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_770) v_~counter~0_2308) 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1840| 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2308 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1280 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1838|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1229| (ite (< 0 (mod (+ v_~c~0_770 v_~counter~0_2306) 4294967296)) 1 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1838|) (= v_thread1Thread1of1ForFork0_~i~0_1279 (+ v_thread1Thread1of1ForFork0_~i~0_1280 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1229| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1229|))) InVars {~counter~0=v_~counter~0_2308, ~c~0=v_~c~0_770, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1280, ~N~0=v_~N~0_757, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1840|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1229|, ~counter~0=v_~counter~0_2306, ~c~0=v_~c~0_770, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_912|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1279, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1237|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1229|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1838|, ~N~0=v_~N~0_757} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:40,424 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [868] L51-4-->L51-4: Formula: (let ((.cse1 (mod v_~N~0_759 4294967296)) (.cse0 (ite (< 0 (mod (+ v_~c~0_772 v_~counter~0_2312) 4294967296)) 1 0))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1233| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1233|) (= (+ (* 2 v_~c~0_772) v_~counter~0_2312) v_~counter~0_2314) (= v_thread1Thread1of1ForFork0_~i~0_1283 (+ v_thread1Thread1of1ForFork0_~i~0_1284 1)) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1233|) (not (= (ite (< 0 (mod v_~counter~0_2314 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1844|) 4294967296) .cse1) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1844|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1284 4294967296) .cse1) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1846| 4294967296) .cse1) (not (= .cse0 0)))) InVars {~counter~0=v_~counter~0_2314, ~c~0=v_~c~0_772, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1284, ~N~0=v_~N~0_759, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1846|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1233|, ~counter~0=v_~counter~0_2312, ~c~0=v_~c~0_772, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_914|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1283, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1241|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1233|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1844|, ~N~0=v_~N~0_759} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:40,510 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [870] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_761 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1237| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1237|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1288 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_774) v_~counter~0_2320) 4294967296)) 1 0) 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_1288 1) v_thread1Thread1of1ForFork0_~i~0_1287) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1852| 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1850|) (not (= (ite (< 0 (mod v_~counter~0_2320 4294967296)) 1 0) 0)) (= (ite (< 0 (mod (+ v_~c~0_774 v_~counter~0_2318) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1237|) (= v_~counter~0_2320 (+ v_~counter~0_2318 (* 2 v_~c~0_774))) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1850|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2320, ~c~0=v_~c~0_774, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1288, ~N~0=v_~N~0_761, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1852|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1237|, ~counter~0=v_~counter~0_2318, ~c~0=v_~c~0_774, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_916|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1287, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1245|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1237|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1850|, ~N~0=v_~N~0_761} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:40,610 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [872] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_763 4294967296)) (.cse1 (ite (< 0 (mod (+ v_~c~0_776 v_~counter~0_2324) 4294967296)) 1 0))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1856|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1241| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1241|) (= v_thread1Thread1of1ForFork0_~i~0_1291 (+ v_thread1Thread1of1ForFork0_~i~0_1292 1)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1856|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1292 4294967296) .cse0) (= .cse1 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1241|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1858| 4294967296) .cse0) (= (+ (* 2 v_~c~0_776) v_~counter~0_2324) v_~counter~0_2326) (not (= (ite (< 0 (mod v_~counter~0_2326 4294967296)) 1 0) 0)) (not (= .cse1 0)))) InVars {~counter~0=v_~counter~0_2326, ~c~0=v_~c~0_776, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1292, ~N~0=v_~N~0_763, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1858|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1241|, ~counter~0=v_~counter~0_2324, ~c~0=v_~c~0_776, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_918|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1291, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1249|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1241|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1856|, ~N~0=v_~N~0_763} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:40,697 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [874] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_778 v_~counter~0_2330) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_765 4294967296))) (and (not (= 0 .cse0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1245| .cse0) (= v_thread1Thread1of1ForFork0_~i~0_1295 (+ v_thread1Thread1of1ForFork0_~i~0_1296 1)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1862|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1862|) 4294967296) .cse1) (not (= (ite (< 0 (mod v_~counter~0_2332 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1245| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1245|) (= (+ v_~counter~0_2330 (* 2 v_~c~0_778)) v_~counter~0_2332) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1864| 4294967296) .cse1) (< (mod v_thread1Thread1of1ForFork0_~i~0_1296 4294967296) .cse1))) InVars {~counter~0=v_~counter~0_2332, ~c~0=v_~c~0_778, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1296, ~N~0=v_~N~0_765, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1864|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1245|, ~counter~0=v_~counter~0_2330, ~c~0=v_~c~0_778, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_920|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1295, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1253|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1245|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1862|, ~N~0=v_~N~0_765} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:40,787 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [876] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_780 v_~counter~0_2336) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_767 4294967296))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1868|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1249| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1249|) (= v_thread1Thread1of1ForFork0_~i~0_1299 (+ v_thread1Thread1of1ForFork0_~i~0_1300 1)) (not (= (ite (< 0 (mod v_~counter~0_2338 4294967296)) 1 0) 0)) (= .cse1 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1249|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1870| 4294967296) .cse0) (= (+ (* 2 v_~c~0_780) v_~counter~0_2336) v_~counter~0_2338) (not (= .cse1 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1868|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1300 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2338, ~c~0=v_~c~0_780, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1300, ~N~0=v_~N~0_767, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1870|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1249|, ~counter~0=v_~counter~0_2336, ~c~0=v_~c~0_780, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_922|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1299, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1257|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1249|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1868|, ~N~0=v_~N~0_767} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:40,879 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [878] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_769 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1253| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1253|) (= v_thread1Thread1of1ForFork0_~i~0_1303 (+ v_thread1Thread1of1ForFork0_~i~0_1304 1)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1874|) 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_1304 4294967296) .cse0) (= (ite (< 0 (mod (+ v_~c~0_782 v_~counter~0_2342) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1253|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1874|) (not (= 0 (ite (< 0 (mod (+ v_~counter~0_2344 (* 4294967295 v_~c~0_782)) 4294967296)) 1 0))) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1876| 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2344 4294967296)) 1 0) 0)) (= (+ (* 2 v_~c~0_782) v_~counter~0_2342) v_~counter~0_2344))) InVars {~counter~0=v_~counter~0_2344, ~c~0=v_~c~0_782, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1304, ~N~0=v_~N~0_769, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1876|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1253|, ~counter~0=v_~counter~0_2342, ~c~0=v_~c~0_782, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_924|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1303, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1261|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1253|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1874|, ~N~0=v_~N~0_769} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:40,990 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [880] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_771 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1257| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1257|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1880|) (= v_thread1Thread1of1ForFork0_~i~0_1307 (+ v_thread1Thread1of1ForFork0_~i~0_1308 1)) (= (+ v_~counter~0_2348 (* 2 v_~c~0_784)) v_~counter~0_2350) (< (mod v_thread1Thread1of1ForFork0_~i~0_1308 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1257| (ite (< 0 (mod (+ v_~c~0_784 v_~counter~0_2348) 4294967296)) 1 0)) (not (= (ite (< 0 (mod v_~counter~0_2350 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_784) v_~counter~0_2350) 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1882| 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1880|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2350, ~c~0=v_~c~0_784, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1308, ~N~0=v_~N~0_771, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1882|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1257|, ~counter~0=v_~counter~0_2348, ~c~0=v_~c~0_784, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_926|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1307, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1265|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1257|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1880|, ~N~0=v_~N~0_771} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:41,118 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [882] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_786 v_~counter~0_2354) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_773 4294967296))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1886|) 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_1311 (+ v_thread1Thread1of1ForFork0_~i~0_1312 1)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1886|) (not (= (ite (< 0 (mod v_~counter~0_2356 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1261| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1261|) (= (+ (* 2 v_~c~0_786) v_~counter~0_2354) v_~counter~0_2356) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1888| 4294967296) .cse0) (= .cse1 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1261|) (not (= .cse1 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1312 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2356, ~c~0=v_~c~0_786, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1312, ~N~0=v_~N~0_773, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1888|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1261|, ~counter~0=v_~counter~0_2354, ~c~0=v_~c~0_786, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_928|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1311, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1269|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1261|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1886|, ~N~0=v_~N~0_773} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:41,269 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [884] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_775 4294967296))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1892|) 4294967296) .cse0) (= v_~counter~0_2362 (+ v_~counter~0_2360 (* 2 v_~c~0_788))) (= v_thread1Thread1of1ForFork0_~i~0_1315 (+ v_thread1Thread1of1ForFork0_~i~0_1316 1)) (= (ite (< 0 (mod (+ v_~c~0_788 v_~counter~0_2360) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1265|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1892|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1316 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2362 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_788) v_~counter~0_2362) 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1894| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1265| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1265|))) InVars {~counter~0=v_~counter~0_2362, ~c~0=v_~c~0_788, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1316, ~N~0=v_~N~0_775, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1894|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1265|, ~counter~0=v_~counter~0_2360, ~c~0=v_~c~0_788, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_930|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1315, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1273|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1265|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1892|, ~N~0=v_~N~0_775} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:41,403 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [886] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_777 4294967296))) (and (= (+ (* 2 v_~c~0_790) v_~counter~0_2366) v_~counter~0_2368) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1898|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2368 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1898|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1269| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1269|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1320 4294967296) .cse0) (not (= (ite (< 0 (mod (+ v_~counter~0_2368 (* 4294967295 v_~c~0_790)) 4294967296)) 1 0) 0)) (= (ite (< 0 (mod (+ v_~c~0_790 v_~counter~0_2366) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1269|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1900| 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_1319 (+ v_thread1Thread1of1ForFork0_~i~0_1320 1)))) InVars {~counter~0=v_~counter~0_2368, ~c~0=v_~c~0_790, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1320, ~N~0=v_~N~0_777, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1900|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1269|, ~counter~0=v_~counter~0_2366, ~c~0=v_~c~0_790, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_932|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1319, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1277|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1269|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1898|, ~N~0=v_~N~0_777} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:41,539 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [888] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_779 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1906| 4294967296) .cse0) (not (= (ite (< 0 (mod (+ v_~counter~0_2374 (* 4294967295 v_~c~0_792)) 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod v_~counter~0_2374 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_1323 (+ v_thread1Thread1of1ForFork0_~i~0_1324 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1273| (ite (< 0 (mod (+ v_~c~0_792 v_~counter~0_2372) 4294967296)) 1 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1904|) 4294967296) .cse0) (= (+ (* 2 v_~c~0_792) v_~counter~0_2372) v_~counter~0_2374) (< (mod v_thread1Thread1of1ForFork0_~i~0_1324 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1273| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1273|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1904|))) InVars {~counter~0=v_~counter~0_2374, ~c~0=v_~c~0_792, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1324, ~N~0=v_~N~0_779, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1906|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1273|, ~counter~0=v_~counter~0_2372, ~c~0=v_~c~0_792, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_934|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1323, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1281|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1273|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1904|, ~N~0=v_~N~0_779} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:41,670 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [890] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_794 v_~counter~0_2378) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_781 4294967296))) (and (= v_thread1Thread1of1ForFork0_~i~0_1327 (+ v_thread1Thread1of1ForFork0_~i~0_1328 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1912| 4294967296) .cse0) (not (= .cse1 0)) (not (= (ite (< 0 (mod v_~counter~0_2380 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1328 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1910|) (= (+ (* 2 v_~c~0_794) v_~counter~0_2378) v_~counter~0_2380) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1277| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1277|) (= .cse1 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1277|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1910|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2380, ~c~0=v_~c~0_794, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1328, ~N~0=v_~N~0_781, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1912|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1277|, ~counter~0=v_~counter~0_2378, ~c~0=v_~c~0_794, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_936|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1327, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1285|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1277|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1910|, ~N~0=v_~N~0_781} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:41,793 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [892] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_783 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1918| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1281| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1281|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1916|) (not (= (ite (< 0 (mod v_~counter~0_2386 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1916|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1281| (ite (< 0 (mod (+ v_~c~0_796 v_~counter~0_2384) 4294967296)) 1 0)) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_796) v_~counter~0_2386) 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1332 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_1331 (+ v_thread1Thread1of1ForFork0_~i~0_1332 1)) (= (+ (* 2 v_~c~0_796) v_~counter~0_2384) v_~counter~0_2386))) InVars {~counter~0=v_~counter~0_2386, ~c~0=v_~c~0_796, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1332, ~N~0=v_~N~0_783, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1918|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1281|, ~counter~0=v_~counter~0_2384, ~c~0=v_~c~0_796, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_938|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1331, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1289|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1281|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1916|, ~N~0=v_~N~0_783} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:41,929 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [894] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_798 v_~counter~0_2390) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_785 4294967296))) (and (= v_~counter~0_2392 (+ (* 2 v_~c~0_798) v_~counter~0_2390)) (= (+ v_thread1Thread1of1ForFork0_~i~0_1336 1) v_thread1Thread1of1ForFork0_~i~0_1335) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1922|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1922|) 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1924| 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2392 4294967296)) 1 0) 0)) (not (= .cse1 0)) (= .cse1 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1285|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1285| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1285|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1336 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2392, ~c~0=v_~c~0_798, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1336, ~N~0=v_~N~0_785, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1924|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1285|, ~counter~0=v_~counter~0_2390, ~c~0=v_~c~0_798, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_940|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1335, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1293|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1285|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1922|, ~N~0=v_~N~0_785} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:42,060 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [896] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_787 4294967296)) (.cse1 (ite (< 0 (mod (+ v_~c~0_800 v_~counter~0_2396) 4294967296)) 1 0))) (and (= v_thread1Thread1of1ForFork0_~i~0_1339 (+ v_thread1Thread1of1ForFork0_~i~0_1340 1)) (= (+ v_~counter~0_2396 (* 2 v_~c~0_800)) v_~counter~0_2398) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1930| 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_1340 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1928|) 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1928|) (not (= (ite (< 0 (mod v_~counter~0_2398 4294967296)) 1 0) 0)) (= .cse1 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1289|) (not (= .cse1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1289| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1289|))) InVars {~counter~0=v_~counter~0_2398, ~c~0=v_~c~0_800, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1340, ~N~0=v_~N~0_787, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1930|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1289|, ~counter~0=v_~counter~0_2396, ~c~0=v_~c~0_800, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_942|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1339, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1297|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1289|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1928|, ~N~0=v_~N~0_787} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:42,181 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [898] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_789 4294967296))) (and (= (+ (* 2 v_~c~0_802) v_~counter~0_2402) v_~counter~0_2404) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1936| 4294967296) .cse0) (not (= 0 (ite (< 0 (mod v_~counter~0_2404 4294967296)) 1 0))) (= v_thread1Thread1of1ForFork0_~i~0_1343 (+ v_thread1Thread1of1ForFork0_~i~0_1344 1)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1934|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_802) v_~counter~0_2404) 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1934|) 4294967296) .cse0) (= (ite (< 0 (mod (+ v_~c~0_802 v_~counter~0_2402) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1293|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1344 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1293| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1293|))) InVars {~counter~0=v_~counter~0_2404, ~c~0=v_~c~0_802, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1344, ~N~0=v_~N~0_789, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1936|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1293|, ~counter~0=v_~counter~0_2402, ~c~0=v_~c~0_802, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_944|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1343, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1301|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1293|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1934|, ~N~0=v_~N~0_789} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:42,311 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [900] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_791 4294967296))) (and (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_804) v_~counter~0_2410) 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1940|) 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_1348 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2410 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1940|) (= (+ v_~counter~0_2408 (* 2 v_~c~0_804)) v_~counter~0_2410) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1942| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1297| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1297|) (= v_thread1Thread1of1ForFork0_~i~0_1347 (+ v_thread1Thread1of1ForFork0_~i~0_1348 1)) (= (ite (< 0 (mod (+ v_~c~0_804 v_~counter~0_2408) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1297|))) InVars {~counter~0=v_~counter~0_2410, ~c~0=v_~c~0_804, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1348, ~N~0=v_~N~0_791, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1942|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1297|, ~counter~0=v_~counter~0_2408, ~c~0=v_~c~0_804, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_946|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1347, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1305|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1297|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1940|, ~N~0=v_~N~0_791} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:42,443 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [904] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_795 4294967296))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1952|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1356 4294967296) .cse0) (= (ite (< 0 (mod (+ v_~c~0_808 v_~counter~0_2420) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1305|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_808) v_~counter~0_2422) 4294967296)) 1 0) 0)) (= (+ v_~counter~0_2420 (* 2 v_~c~0_808)) v_~counter~0_2422) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1305| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1305|) (= (+ v_thread1Thread1of1ForFork0_~i~0_1356 1) v_thread1Thread1of1ForFork0_~i~0_1355) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1952|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2422 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1954| 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2422, ~c~0=v_~c~0_808, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1356, ~N~0=v_~N~0_795, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1954|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1305|, ~counter~0=v_~counter~0_2420, ~c~0=v_~c~0_808, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_950|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1355, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1313|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1305|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1952|, ~N~0=v_~N~0_795} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:42,575 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [906] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_810 v_~counter~0_2426) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_797 4294967296))) (and (not (= (ite (< 0 (mod v_~counter~0_2428 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1309| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1309|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1360 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_1359 (+ v_thread1Thread1of1ForFork0_~i~0_1360 1)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1958|) (= .cse1 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1309|) (not (= .cse1 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1958|) 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1960| 4294967296) .cse0) (= (+ (* 2 v_~c~0_810) v_~counter~0_2426) v_~counter~0_2428))) InVars {~counter~0=v_~counter~0_2428, ~c~0=v_~c~0_810, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1360, ~N~0=v_~N~0_797, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1960|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1309|, ~counter~0=v_~counter~0_2426, ~c~0=v_~c~0_810, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_952|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1359, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1317|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1309|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1958|, ~N~0=v_~N~0_797} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:42,699 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [908] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_812 v_~counter~0_2432) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_799 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1966| 4294967296) .cse0) (= (+ v_~counter~0_2432 (* 2 v_~c~0_812)) v_~counter~0_2434) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1313| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1313|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1964|) (not (= (ite (< 0 (mod v_~counter~0_2434 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_1363 (+ v_thread1Thread1of1ForFork0_~i~0_1364 1)) (not (= .cse1 0)) (= .cse1 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1313|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1364 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1964|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2434, ~c~0=v_~c~0_812, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1364, ~N~0=v_~N~0_799, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1966|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1313|, ~counter~0=v_~counter~0_2432, ~c~0=v_~c~0_812, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_954|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1363, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1321|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1313|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1964|, ~N~0=v_~N~0_799} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:42,827 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [910] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_801 4294967296)) (.cse1 (ite (< 0 (mod (+ v_~c~0_814 v_~counter~0_2438) 4294967296)) 1 0))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1972| 4294967296) .cse0) (= .cse1 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1317|) (not (= (ite (< 0 (mod v_~counter~0_2440 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1970|) 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_1368 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1970|) (not (= .cse1 0)) (= v_thread1Thread1of1ForFork0_~i~0_1367 (+ v_thread1Thread1of1ForFork0_~i~0_1368 1)) (= (+ (* 2 v_~c~0_814) v_~counter~0_2438) v_~counter~0_2440) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1317| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1317|))) InVars {~counter~0=v_~counter~0_2440, ~c~0=v_~c~0_814, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1368, ~N~0=v_~N~0_801, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1972|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1317|, ~counter~0=v_~counter~0_2438, ~c~0=v_~c~0_814, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_956|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1367, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1325|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1317|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1970|, ~N~0=v_~N~0_801} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:42,951 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [912] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_803 4294967296))) (and (= (+ v_~counter~0_2444 (* 2 v_~c~0_816)) v_~counter~0_2446) (not (= (ite (< 0 (mod v_~counter~0_2446 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1321| (ite (< 0 (mod (+ v_~c~0_816 v_~counter~0_2444) 4294967296)) 1 0)) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_816) v_~counter~0_2446) 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1976|) (= v_thread1Thread1of1ForFork0_~i~0_1371 (+ v_thread1Thread1of1ForFork0_~i~0_1372 1)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1976|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1321| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1321|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1978| 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_1372 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2446, ~c~0=v_~c~0_816, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1372, ~N~0=v_~N~0_803, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1978|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1321|, ~counter~0=v_~counter~0_2444, ~c~0=v_~c~0_816, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_958|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1371, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1329|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1321|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1976|, ~N~0=v_~N~0_803} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:43,079 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [914] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_805 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1325| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1325|) (not (= (ite (< 0 (mod v_~counter~0_2452 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_1375 (+ v_thread1Thread1of1ForFork0_~i~0_1376 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1325| (ite (< 0 (mod (+ v_~c~0_818 v_~counter~0_2450) 4294967296)) 1 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1376 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_818) v_~counter~0_2452) 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1984| 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1982|) (= v_~counter~0_2452 (+ v_~counter~0_2450 (* 2 v_~c~0_818))) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1982|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2452, ~c~0=v_~c~0_818, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1376, ~N~0=v_~N~0_805, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1984|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1325|, ~counter~0=v_~counter~0_2450, ~c~0=v_~c~0_818, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_960|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1375, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1333|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1325|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1982|, ~N~0=v_~N~0_805} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:43,210 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [916] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_820 v_~counter~0_2456) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_807 4294967296))) (and (< (mod v_thread1Thread1of1ForFork0_~i~0_1380 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1988|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1329| .cse1) (= v_thread1Thread1of1ForFork0_~i~0_1379 (+ v_thread1Thread1of1ForFork0_~i~0_1380 1)) (not (= (ite (< 0 (mod v_~counter~0_2458 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1990| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1329| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1329|) (not (= .cse1 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1988|) 4294967296) .cse0) (= (+ (* 2 v_~c~0_820) v_~counter~0_2456) v_~counter~0_2458))) InVars {~counter~0=v_~counter~0_2458, ~c~0=v_~c~0_820, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1380, ~N~0=v_~N~0_807, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1990|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1329|, ~counter~0=v_~counter~0_2456, ~c~0=v_~c~0_820, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_962|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1379, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1337|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1329|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1988|, ~N~0=v_~N~0_807} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:43,338 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [918] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_809 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1333| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1333|) (not (= (ite (< 0 (mod (+ v_~counter~0_2464 (* 4294967295 v_~c~0_822)) 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_1996| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1333| (ite (< 0 (mod (+ v_~c~0_822 v_~counter~0_2462) 4294967296)) 1 0)) (= v_thread1Thread1of1ForFork0_~i~0_1383 (+ v_thread1Thread1of1ForFork0_~i~0_1384 1)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1994|) (not (= (ite (< 0 (mod v_~counter~0_2464 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1384 4294967296) .cse0) (= v_~counter~0_2464 (+ (* 2 v_~c~0_822) v_~counter~0_2462)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_1994|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2464, ~c~0=v_~c~0_822, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1384, ~N~0=v_~N~0_809, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1996|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1333|, ~counter~0=v_~counter~0_2462, ~c~0=v_~c~0_822, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_964|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1383, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1341|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1333|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1994|, ~N~0=v_~N~0_809} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:43,466 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [920] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_824 v_~counter~0_2468) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_811 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2002| 4294967296) .cse0) (= (+ (* 2 v_~c~0_824) v_~counter~0_2468) v_~counter~0_2470) (not (= (ite (< 0 (mod v_~counter~0_2470 4294967296)) 1 0) 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_1388 1) v_thread1Thread1of1ForFork0_~i~0_1387) (< (mod v_thread1Thread1of1ForFork0_~i~0_1388 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2000|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1337| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1337|) (= .cse1 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1337|) (not (= .cse1 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2000|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2470, ~c~0=v_~c~0_824, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1388, ~N~0=v_~N~0_811, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2002|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1337|, ~counter~0=v_~counter~0_2468, ~c~0=v_~c~0_824, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_966|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1387, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1345|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1337|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2000|, ~N~0=v_~N~0_811} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:43,598 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [922] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_826 v_~counter~0_2474) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_813 4294967296))) (and (not (= (ite (< 0 (mod v_~counter~0_2476 4294967296)) 1 0) 0)) (= (+ v_~counter~0_2474 (* 2 v_~c~0_826)) v_~counter~0_2476) (< (mod v_thread1Thread1of1ForFork0_~i~0_1392 4294967296) .cse0) (= (+ v_thread1Thread1of1ForFork0_~i~0_1392 1) v_thread1Thread1of1ForFork0_~i~0_1391) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2006|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2008| 4294967296) .cse0) (not (= .cse1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1341| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1341|) (= .cse1 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1341|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2006|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2476, ~c~0=v_~c~0_826, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1392, ~N~0=v_~N~0_813, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2008|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1341|, ~counter~0=v_~counter~0_2474, ~c~0=v_~c~0_826, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_968|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1391, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1349|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1341|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2006|, ~N~0=v_~N~0_813} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:43,724 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [924] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_828 v_~counter~0_2480) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_815 4294967296))) (and (not (= .cse0 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2014| 4294967296) .cse1) (< (mod v_thread1Thread1of1ForFork0_~i~0_1396 4294967296) .cse1) (= (+ v_~counter~0_2480 (* 2 v_~c~0_828)) v_~counter~0_2482) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1345|) (= v_thread1Thread1of1ForFork0_~i~0_1395 (+ v_thread1Thread1of1ForFork0_~i~0_1396 1)) (not (= (ite (< 0 (mod v_~counter~0_2482 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2012|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2012|) 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1345| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1345|))) InVars {~counter~0=v_~counter~0_2482, ~c~0=v_~c~0_828, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1396, ~N~0=v_~N~0_815, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2014|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1345|, ~counter~0=v_~counter~0_2480, ~c~0=v_~c~0_828, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_970|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1395, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1353|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1345|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2012|, ~N~0=v_~N~0_815} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:43,849 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [926] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_830 v_~counter~0_2486) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_817 4294967296))) (and (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1349|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2018|) 4294967296) .cse1) (not (= .cse0 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1349| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1349|) (not (= (ite (< 0 (mod v_~counter~0_2488 4294967296)) 1 0) 0)) (= (+ v_~counter~0_2486 (* 2 v_~c~0_830)) v_~counter~0_2488) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2018|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2020| 4294967296) .cse1) (= v_thread1Thread1of1ForFork0_~i~0_1399 (+ v_thread1Thread1of1ForFork0_~i~0_1400 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1400 4294967296) .cse1))) InVars {~counter~0=v_~counter~0_2488, ~c~0=v_~c~0_830, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1400, ~N~0=v_~N~0_817, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2020|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1349|, ~counter~0=v_~counter~0_2486, ~c~0=v_~c~0_830, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_972|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1399, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1357|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1349|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2018|, ~N~0=v_~N~0_817} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:43,976 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [928] L51-4-->L51-4: Formula: (let ((.cse1 (mod v_~N~0_819 4294967296)) (.cse0 (ite (< 0 (mod (+ v_~c~0_832 v_~counter~0_2492) 4294967296)) 1 0))) (and (not (= .cse0 0)) (not (= (ite (< 0 (mod v_~counter~0_2494 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2024|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2024|) 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1353| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1353|) (= v_~counter~0_2494 (+ v_~counter~0_2492 (* 2 v_~c~0_832))) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2026| 4294967296) .cse1) (= v_thread1Thread1of1ForFork0_~i~0_1403 (+ v_thread1Thread1of1ForFork0_~i~0_1404 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1404 4294967296) .cse1) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1353|))) InVars {~counter~0=v_~counter~0_2494, ~c~0=v_~c~0_832, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1404, ~N~0=v_~N~0_819, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2026|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1353|, ~counter~0=v_~counter~0_2492, ~c~0=v_~c~0_832, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_974|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1403, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1361|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1353|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2024|, ~N~0=v_~N~0_819} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:44,101 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [930] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_834 v_~counter~0_2498) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_821 4294967296))) (and (< (mod v_thread1Thread1of1ForFork0_~i~0_1408 4294967296) .cse0) (not (= .cse1 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2030|) (= (+ (* 2 v_~c~0_834) v_~counter~0_2498) v_~counter~0_2500) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1357| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1357|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1357| .cse1) (= v_thread1Thread1of1ForFork0_~i~0_1407 (+ v_thread1Thread1of1ForFork0_~i~0_1408 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2032| 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2500 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2030|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2500, ~c~0=v_~c~0_834, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1408, ~N~0=v_~N~0_821, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2032|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1357|, ~counter~0=v_~counter~0_2498, ~c~0=v_~c~0_834, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_976|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1407, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1365|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1357|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2030|, ~N~0=v_~N~0_821} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:44,230 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [932] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_823 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2038| 4294967296) .cse0) (= (+ (* 2 v_~c~0_836) v_~counter~0_2504) v_~counter~0_2506) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2036|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_836) v_~counter~0_2506) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1361| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1361|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2036|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2506 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_1411 (+ v_thread1Thread1of1ForFork0_~i~0_1412 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1412 4294967296) .cse0) (= (ite (< 0 (mod (+ v_~c~0_836 v_~counter~0_2504) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1361|))) InVars {~counter~0=v_~counter~0_2506, ~c~0=v_~c~0_836, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1412, ~N~0=v_~N~0_823, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2038|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1361|, ~counter~0=v_~counter~0_2504, ~c~0=v_~c~0_836, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_978|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1411, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1369|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1361|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2036|, ~N~0=v_~N~0_823} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:44,364 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [934] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_838 v_~counter~0_2510) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_825 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1365| .cse0) (not (= .cse0 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2042|) (= (+ v_~counter~0_2510 (* 2 v_~c~0_838)) v_~counter~0_2512) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2042|) 4294967296) .cse1) (< (mod v_thread1Thread1of1ForFork0_~i~0_1416 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1365| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1365|) (not (= (ite (< 0 (mod v_~counter~0_2512 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_1415 (+ v_thread1Thread1of1ForFork0_~i~0_1416 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2044| 4294967296) .cse1))) InVars {~counter~0=v_~counter~0_2512, ~c~0=v_~c~0_838, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1416, ~N~0=v_~N~0_825, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2044|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1365|, ~counter~0=v_~counter~0_2510, ~c~0=v_~c~0_838, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_980|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1415, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1373|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1365|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2042|, ~N~0=v_~N~0_825} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:44,491 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [936] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_827 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2050| 4294967296) .cse0) (= (+ (* 2 v_~c~0_840) v_~counter~0_2516) v_~counter~0_2518) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_840) v_~counter~0_2518) 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1420 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2518 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1369| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1369|) (= (+ v_thread1Thread1of1ForFork0_~i~0_1420 1) v_thread1Thread1of1ForFork0_~i~0_1419) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2048|) (= (ite (< 0 (mod (+ v_~c~0_840 v_~counter~0_2516) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1369|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2048|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2518, ~c~0=v_~c~0_840, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1420, ~N~0=v_~N~0_827, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2050|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1369|, ~counter~0=v_~counter~0_2516, ~c~0=v_~c~0_840, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_982|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1419, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1377|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1369|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2048|, ~N~0=v_~N~0_827} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:44,623 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [938] L51-4-->L51-4: Formula: (let ((.cse1 (mod v_~N~0_829 4294967296)) (.cse0 (ite (< 0 (mod (+ v_~c~0_842 v_~counter~0_2522) 4294967296)) 1 0))) (and (not (= .cse0 0)) (= v_thread1Thread1of1ForFork0_~i~0_1423 (+ v_thread1Thread1of1ForFork0_~i~0_1424 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1373| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1373|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1424 4294967296) .cse1) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2056| 4294967296) .cse1) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2054|) 4294967296) .cse1) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2054|) (not (= (ite (< 0 (mod v_~counter~0_2524 4294967296)) 1 0) 0)) (= (+ v_~counter~0_2522 (* 2 v_~c~0_842)) v_~counter~0_2524) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1373|))) InVars {~counter~0=v_~counter~0_2524, ~c~0=v_~c~0_842, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1424, ~N~0=v_~N~0_829, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2056|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1373|, ~counter~0=v_~counter~0_2522, ~c~0=v_~c~0_842, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_984|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1423, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1381|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1373|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2054|, ~N~0=v_~N~0_829} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:44,745 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [940] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_831 4294967296))) (and (= (+ v_~counter~0_2528 (* 2 v_~c~0_844)) v_~counter~0_2530) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_844) v_~counter~0_2530) 4294967296)) 1 0) 0)) (= (ite (< 0 (mod (+ v_~c~0_844 v_~counter~0_2528) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1377|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2062| 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2060|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1377| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1377|) (not (= (ite (< 0 (mod v_~counter~0_2530 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1428 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2060|) 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_1427 (+ v_thread1Thread1of1ForFork0_~i~0_1428 1)))) InVars {~counter~0=v_~counter~0_2530, ~c~0=v_~c~0_844, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1428, ~N~0=v_~N~0_831, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2062|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1377|, ~counter~0=v_~counter~0_2528, ~c~0=v_~c~0_844, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_986|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1427, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1385|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1377|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2060|, ~N~0=v_~N~0_831} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:44,875 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [944] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_835 4294967296))) (and (= v_~counter~0_2542 (+ (* 2 v_~c~0_848) v_~counter~0_2540)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1438 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2074| 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2072|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_848) v_~counter~0_2542) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1385| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1385|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2072|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2542 4294967296)) 1 0) 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_1438 1) v_thread1Thread1of1ForFork0_~i~0_1437) (= (ite (< 0 (mod (+ v_~c~0_848 v_~counter~0_2540) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1385|))) InVars {~counter~0=v_~counter~0_2542, ~c~0=v_~c~0_848, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1438, ~N~0=v_~N~0_835, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2074|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1385|, ~counter~0=v_~counter~0_2540, ~c~0=v_~c~0_848, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_992|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1437, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1393|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1385|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2072|, ~N~0=v_~N~0_835} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:44,978 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [946] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_837 4294967296))) (and (= v_thread1Thread1of1ForFork0_~i~0_1441 (+ v_thread1Thread1of1ForFork0_~i~0_1442 1)) (= (ite (< 0 (mod (+ v_~c~0_850 v_~counter~0_2546) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1389|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2080| 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_1442 4294967296) .cse0) (= v_~counter~0_2548 (+ (* 2 v_~c~0_850) v_~counter~0_2546)) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_850) v_~counter~0_2548) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1389| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1389|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2078|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2078|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2548 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_2548, ~c~0=v_~c~0_850, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1442, ~N~0=v_~N~0_837, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2080|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1389|, ~counter~0=v_~counter~0_2546, ~c~0=v_~c~0_850, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_994|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1441, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1397|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1389|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2078|, ~N~0=v_~N~0_837} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:45,107 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [948] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_852 v_~counter~0_2552) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_839 4294967296))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2084|) (not (= .cse0 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2084|) 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1393| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1393|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2086| 4294967296) .cse1) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1393|) (= v_thread1Thread1of1ForFork0_~i~0_1445 (+ v_thread1Thread1of1ForFork0_~i~0_1446 1)) (not (= (ite (< 0 (mod v_~counter~0_2554 4294967296)) 1 0) 0)) (= (+ v_~counter~0_2552 (* 2 v_~c~0_852)) v_~counter~0_2554) (< (mod v_thread1Thread1of1ForFork0_~i~0_1446 4294967296) .cse1))) InVars {~counter~0=v_~counter~0_2554, ~c~0=v_~c~0_852, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1446, ~N~0=v_~N~0_839, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2086|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1393|, ~counter~0=v_~counter~0_2552, ~c~0=v_~c~0_852, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_996|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1445, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1401|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1393|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2084|, ~N~0=v_~N~0_839} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:45,228 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [950] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_854 v_~counter~0_2558) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_841 4294967296))) (and (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1397|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2092| 4294967296) .cse1) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2090|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1397| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1397|) (not (= .cse0 0)) (= v_thread1Thread1of1ForFork0_~i~0_1449 (+ v_thread1Thread1of1ForFork0_~i~0_1450 1)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2090|) 4294967296) .cse1) (< (mod v_thread1Thread1of1ForFork0_~i~0_1450 4294967296) .cse1) (= v_~counter~0_2560 (+ (* 2 v_~c~0_854) v_~counter~0_2558)) (not (= 0 (ite (< 0 (mod v_~counter~0_2560 4294967296)) 1 0))))) InVars {~counter~0=v_~counter~0_2560, ~c~0=v_~c~0_854, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1450, ~N~0=v_~N~0_841, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2092|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1397|, ~counter~0=v_~counter~0_2558, ~c~0=v_~c~0_854, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_998|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1449, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1405|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1397|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2090|, ~N~0=v_~N~0_841} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:45,350 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [954] L51-4-->L51-4: Formula: (let ((.cse1 (mod v_~N~0_847 4294967296)) (.cse0 (ite (< 0 (mod (+ v_~c~0_860 v_~counter~0_2576) 4294967296)) 1 0))) (and (not (= (ite (< 0 (mod v_~counter~0_2578 4294967296)) 1 0) 0)) (not (= .cse0 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1466 4294967296) .cse1) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2100|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2102| 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1405| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1405|) (= (+ (* 2 v_~c~0_860) v_~counter~0_2576) v_~counter~0_2578) (= v_thread1Thread1of1ForFork0_~i~0_1465 (+ v_thread1Thread1of1ForFork0_~i~0_1466 1)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2100|) 4294967296) .cse1) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1405|))) InVars {~counter~0=v_~counter~0_2578, ~c~0=v_~c~0_860, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1466, ~N~0=v_~N~0_847, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2102|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1405|, ~counter~0=v_~counter~0_2576, ~c~0=v_~c~0_860, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1008|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1465, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1413|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1405|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2100|, ~N~0=v_~N~0_847} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:45,475 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [956] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_849 4294967296)) (.cse1 (ite (< 0 (mod (+ v_~c~0_862 v_~counter~0_2582) 4294967296)) 1 0))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2106|) 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_1469 (+ v_thread1Thread1of1ForFork0_~i~0_1470 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2108| 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_1470 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2584 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1409| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1409|) (not (= .cse1 0)) (= (+ v_~counter~0_2582 (* 2 v_~c~0_862)) v_~counter~0_2584) (= .cse1 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1409|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2106|))) InVars {~counter~0=v_~counter~0_2584, ~c~0=v_~c~0_862, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1470, ~N~0=v_~N~0_849, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2108|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1409|, ~counter~0=v_~counter~0_2582, ~c~0=v_~c~0_862, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1010|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1469, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1417|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1409|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2106|, ~N~0=v_~N~0_849} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:45,617 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [958] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_851 4294967296))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2112|) 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_1474 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2590 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_1473 (+ v_thread1Thread1of1ForFork0_~i~0_1474 1)) (not (= (ite (< 0 (mod (+ v_~counter~0_2590 (* 4294967295 v_~c~0_864)) 4294967296)) 1 0) 0)) (= (+ v_~counter~0_2588 (* 2 v_~c~0_864)) v_~counter~0_2590) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1413| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1413|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2114| 4294967296) .cse0) (= (ite (< 0 (mod (+ v_~c~0_864 v_~counter~0_2588) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1413|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2112|))) InVars {~counter~0=v_~counter~0_2590, ~c~0=v_~c~0_864, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1474, ~N~0=v_~N~0_851, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2114|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1413|, ~counter~0=v_~counter~0_2588, ~c~0=v_~c~0_864, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1012|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1473, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1421|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1413|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2112|, ~N~0=v_~N~0_851} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:45,749 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [960] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_853 4294967296))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2118|) 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_1478 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2118|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_866) v_~counter~0_2596) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1417| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1417|) (not (= (ite (< 0 (mod v_~counter~0_2596 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_1477 (+ v_thread1Thread1of1ForFork0_~i~0_1478 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1417| (ite (< 0 (mod (+ v_~c~0_866 v_~counter~0_2594) 4294967296)) 1 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2120| 4294967296) .cse0) (= (+ v_~counter~0_2594 (* 2 v_~c~0_866)) v_~counter~0_2596))) InVars {~counter~0=v_~counter~0_2596, ~c~0=v_~c~0_866, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1478, ~N~0=v_~N~0_853, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2120|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1417|, ~counter~0=v_~counter~0_2594, ~c~0=v_~c~0_866, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1014|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1477, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1425|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1417|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2118|, ~N~0=v_~N~0_853} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:45,877 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [962] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_855 4294967296))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2124|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2602 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1421| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1421|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1482 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_1481 (+ v_thread1Thread1of1ForFork0_~i~0_1482 1)) (= (ite (< 0 (mod (+ v_~c~0_868 v_~counter~0_2600) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1421|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2126| 4294967296) .cse0) (= v_~counter~0_2602 (+ (* 2 v_~c~0_868) v_~counter~0_2600)) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_868) v_~counter~0_2602) 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2124|))) InVars {~counter~0=v_~counter~0_2602, ~c~0=v_~c~0_868, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1482, ~N~0=v_~N~0_855, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2126|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1421|, ~counter~0=v_~counter~0_2600, ~c~0=v_~c~0_868, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1016|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1481, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1429|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1421|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2124|, ~N~0=v_~N~0_855} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:46,002 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [964] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_857 4294967296))) (and (< (mod v_thread1Thread1of1ForFork0_~i~0_1486 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2130|) (= (ite (< 0 (mod (+ v_~c~0_870 v_~counter~0_2606) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1425|) (= (+ v_thread1Thread1of1ForFork0_~i~0_1486 1) v_thread1Thread1of1ForFork0_~i~0_1485) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_870) v_~counter~0_2608) 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod v_~counter~0_2608 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2130|) 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2132| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1425| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1425|) (= v_~counter~0_2608 (+ (* 2 v_~c~0_870) v_~counter~0_2606)))) InVars {~counter~0=v_~counter~0_2608, ~c~0=v_~c~0_870, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1486, ~N~0=v_~N~0_857, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2132|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1425|, ~counter~0=v_~counter~0_2606, ~c~0=v_~c~0_870, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1018|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1485, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1433|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1425|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2130|, ~N~0=v_~N~0_857} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:46,131 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [967] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_874 v_~counter~0_2618) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_861 4294967296))) (and (= v_thread1Thread1of1ForFork0_~i~0_1495 (+ v_thread1Thread1of1ForFork0_~i~0_1496 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1496 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1431| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1431|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1431| .cse1) (= (+ (* 2 v_~c~0_874) v_~counter~0_2618) v_~counter~0_2620) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2138|) (not (= (ite (< 0 (mod v_~counter~0_2620 4294967296)) 1 0) 0)) (not (= .cse1 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2140| 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2138|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2620, ~c~0=v_~c~0_874, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1496, ~N~0=v_~N~0_861, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2140|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1431|, ~counter~0=v_~counter~0_2618, ~c~0=v_~c~0_874, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1024|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1495, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1439|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1431|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2138|, ~N~0=v_~N~0_861} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:46,253 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [969] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_876 v_~counter~0_2624) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_863 4294967296))) (and (not (= .cse0 0)) (not (= (ite (< 0 (mod v_~counter~0_2626 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2144|) 4294967296) .cse1) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2146| 4294967296) .cse1) (= v_thread1Thread1of1ForFork0_~i~0_1499 (+ v_thread1Thread1of1ForFork0_~i~0_1500 1)) (= (+ (* 2 v_~c~0_876) v_~counter~0_2624) v_~counter~0_2626) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2144|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1435| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1435|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1435| .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_1500 4294967296) .cse1))) InVars {~counter~0=v_~counter~0_2626, ~c~0=v_~c~0_876, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1500, ~N~0=v_~N~0_863, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2146|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1435|, ~counter~0=v_~counter~0_2624, ~c~0=v_~c~0_876, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1026|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1499, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1443|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1435|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2144|, ~N~0=v_~N~0_863} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:46,385 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [972] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_880 v_~counter~0_2636) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_867 4294967296))) (and (not (= .cse0 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_1510 1) v_thread1Thread1of1ForFork0_~i~0_1509) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2152|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1510 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1441| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1441|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2154| 4294967296) .cse1) (= v_~counter~0_2638 (+ v_~counter~0_2636 (* 2 v_~c~0_880))) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1441|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2152|) 4294967296) .cse1) (not (= (ite (< 0 (mod v_~counter~0_2638 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_2638, ~c~0=v_~c~0_880, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1510, ~N~0=v_~N~0_867, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2154|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1441|, ~counter~0=v_~counter~0_2636, ~c~0=v_~c~0_880, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1032|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1509, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1449|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1441|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2152|, ~N~0=v_~N~0_867} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:46,514 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [974] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_869 4294967296))) (and (< (mod v_thread1Thread1of1ForFork0_~i~0_1514 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2158|) (= (ite (< 0 (mod (+ v_~c~0_882 v_~counter~0_2642) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1445|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1445| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1445|) (= v_thread1Thread1of1ForFork0_~i~0_1513 (+ v_thread1Thread1of1ForFork0_~i~0_1514 1)) (not (= (ite (< 0 (mod (+ v_~counter~0_2644 (* 4294967295 v_~c~0_882)) 4294967296)) 1 0) 0)) (= (+ v_~counter~0_2642 (* 2 v_~c~0_882)) v_~counter~0_2644) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2158|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2644 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2160| 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2644, ~c~0=v_~c~0_882, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1514, ~N~0=v_~N~0_869, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2160|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1445|, ~counter~0=v_~counter~0_2642, ~c~0=v_~c~0_882, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1034|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1513, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1453|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1445|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2158|, ~N~0=v_~N~0_869} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:46,649 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [976] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_884 v_~counter~0_2648) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_871 4294967296))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2164|) 4294967296) .cse0) (= (+ (* 2 v_~c~0_884) v_~counter~0_2648) v_~counter~0_2650) (= v_thread1Thread1of1ForFork0_~i~0_1517 (+ v_thread1Thread1of1ForFork0_~i~0_1518 1)) (not (= (ite (< 0 (mod v_~counter~0_2650 4294967296)) 1 0) 0)) (= .cse1 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1449|) (not (= .cse1 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2164|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2166| 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_1518 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1449| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1449|))) InVars {~counter~0=v_~counter~0_2650, ~c~0=v_~c~0_884, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1518, ~N~0=v_~N~0_871, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2166|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1449|, ~counter~0=v_~counter~0_2648, ~c~0=v_~c~0_884, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1036|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1517, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1457|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1449|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2164|, ~N~0=v_~N~0_871} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:46,774 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [978] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_873 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2172| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1453| (ite (< 0 (mod (+ v_~c~0_886 v_~counter~0_2654) 4294967296)) 1 0)) (= v_thread1Thread1of1ForFork0_~i~0_1521 (+ v_thread1Thread1of1ForFork0_~i~0_1522 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1522 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2170|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1453| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1453|) (= (+ (* 2 v_~c~0_886) v_~counter~0_2654) v_~counter~0_2656) (not (= (ite (< 0 (mod v_~counter~0_2656 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_886) v_~counter~0_2656) 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2170|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2656, ~c~0=v_~c~0_886, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1522, ~N~0=v_~N~0_873, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2172|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1453|, ~counter~0=v_~counter~0_2654, ~c~0=v_~c~0_886, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1038|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1521, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1461|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1453|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2170|, ~N~0=v_~N~0_873} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:46,908 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [980] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_875 4294967296))) (and (not (= (ite (< 0 (mod v_~counter~0_2662 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1457| (ite (< 0 (mod (+ v_~c~0_888 v_~counter~0_2660) 4294967296)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1457| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1457|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1526 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2176|) 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2176|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_888) v_~counter~0_2662) 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_1525 (+ v_thread1Thread1of1ForFork0_~i~0_1526 1)) (= v_~counter~0_2662 (+ (* 2 v_~c~0_888) v_~counter~0_2660)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2178| 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2662, ~c~0=v_~c~0_888, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1526, ~N~0=v_~N~0_875, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2178|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1457|, ~counter~0=v_~counter~0_2660, ~c~0=v_~c~0_888, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1040|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1525, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1465|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1457|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2176|, ~N~0=v_~N~0_875} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:47,042 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [982] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_877 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1461| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1461|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2182|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1461| (ite (< 0 (mod (+ v_~c~0_890 v_~counter~0_2666) 4294967296)) 1 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1530 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2182|) 4294967296) .cse0) (= v_~counter~0_2668 (+ (* 2 v_~c~0_890) v_~counter~0_2666)) (not (= (ite (< 0 (mod v_~counter~0_2668 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_1529 (+ v_thread1Thread1of1ForFork0_~i~0_1530 1)) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_890) v_~counter~0_2668) 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2184| 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2668, ~c~0=v_~c~0_890, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1530, ~N~0=v_~N~0_877, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2184|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1461|, ~counter~0=v_~counter~0_2666, ~c~0=v_~c~0_890, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1042|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1529, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1469|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1461|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2182|, ~N~0=v_~N~0_877} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:47,149 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [984] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_892 v_~counter~0_2672) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_879 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1465| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1465|) (not (= 0 .cse0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2188|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1465| .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2188|) 4294967296) .cse1) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2190| 4294967296) .cse1) (= (+ (* 2 v_~c~0_892) v_~counter~0_2672) v_~counter~0_2674) (< (mod v_thread1Thread1of1ForFork0_~i~0_1534 4294967296) .cse1) (= (+ v_thread1Thread1of1ForFork0_~i~0_1534 1) v_thread1Thread1of1ForFork0_~i~0_1533) (not (= (ite (< 0 (mod v_~counter~0_2674 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_2674, ~c~0=v_~c~0_892, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1534, ~N~0=v_~N~0_879, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2190|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1465|, ~counter~0=v_~counter~0_2672, ~c~0=v_~c~0_892, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1044|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1533, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1473|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1465|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2188|, ~N~0=v_~N~0_879} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:47,257 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [988] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_883 4294967296))) (and (not (= (ite (< 0 (mod v_~counter~0_2686 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2200|) 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2202| 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2200|) (not (= (ite (< 0 (mod (+ v_~counter~0_2686 (* 4294967295 v_~c~0_896)) 4294967296)) 1 0) 0)) (= (ite (< 0 (mod (+ v_~c~0_896 v_~counter~0_2684) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1473|) (= (+ (* 2 v_~c~0_896) v_~counter~0_2684) v_~counter~0_2686) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1473| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1473|) (= v_thread1Thread1of1ForFork0_~i~0_1541 (+ v_thread1Thread1of1ForFork0_~i~0_1542 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1542 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2686, ~c~0=v_~c~0_896, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1542, ~N~0=v_~N~0_883, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2202|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1473|, ~counter~0=v_~counter~0_2684, ~c~0=v_~c~0_896, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1048|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1541, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1481|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1473|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2200|, ~N~0=v_~N~0_883} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:47,347 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [990] L51-4-->L51-4: Formula: (let ((.cse1 (mod v_~N~0_885 4294967296)) (.cse0 (ite (< 0 (mod (+ v_~c~0_898 v_~counter~0_2690) 4294967296)) 1 0))) (and (not (= .cse0 0)) (= v_~counter~0_2692 (+ (* 2 v_~c~0_898) v_~counter~0_2690)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2208| 4294967296) .cse1) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2206|) 4294967296) .cse1) (< (mod v_thread1Thread1of1ForFork0_~i~0_1546 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1477| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1477|) (not (= (ite (< 0 (mod v_~counter~0_2692 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1477| .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2206|) (= (+ v_thread1Thread1of1ForFork0_~i~0_1546 1) v_thread1Thread1of1ForFork0_~i~0_1545))) InVars {~counter~0=v_~counter~0_2692, ~c~0=v_~c~0_898, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1546, ~N~0=v_~N~0_885, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2208|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1477|, ~counter~0=v_~counter~0_2690, ~c~0=v_~c~0_898, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1050|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1545, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1485|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1477|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2206|, ~N~0=v_~N~0_885} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:47,426 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [994] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_889 4294967296))) (and (not (= (ite (< 0 (mod v_~counter~0_2704 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1554 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2220| 4294967296) .cse0) (= (+ v_thread1Thread1of1ForFork0_~i~0_1554 1) v_thread1Thread1of1ForFork0_~i~0_1553) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1485| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1485|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2218|) 4294967296) .cse0) (= (+ v_~counter~0_2702 (* 2 v_~c~0_902)) v_~counter~0_2704) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2218|) (= (ite (< 0 (mod (+ v_~c~0_902 v_~counter~0_2702) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1485|) (not (= (ite (< 0 (mod (+ v_~counter~0_2704 (* 4294967295 v_~c~0_902)) 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_2704, ~c~0=v_~c~0_902, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1554, ~N~0=v_~N~0_889, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2220|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1485|, ~counter~0=v_~counter~0_2702, ~c~0=v_~c~0_902, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1054|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1553, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1493|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1485|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2218|, ~N~0=v_~N~0_889} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:47,521 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [996] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_891 4294967296)) (.cse1 (ite (< 0 (mod (+ v_~c~0_904 v_~counter~0_2708) 4294967296)) 1 0))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2224|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2226| 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_1558 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1489| .cse1) (= (+ (* 2 v_~c~0_904) v_~counter~0_2708) v_~counter~0_2710) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2224|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1489| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1489|) (not (= (ite (< 0 (mod v_~counter~0_2710 4294967296)) 1 0) 0)) (not (= 0 .cse1)) (= v_thread1Thread1of1ForFork0_~i~0_1557 (+ v_thread1Thread1of1ForFork0_~i~0_1558 1)))) InVars {~counter~0=v_~counter~0_2710, ~c~0=v_~c~0_904, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1558, ~N~0=v_~N~0_891, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2226|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1489|, ~counter~0=v_~counter~0_2708, ~c~0=v_~c~0_904, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1056|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1557, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1497|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1489|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2224|, ~N~0=v_~N~0_891} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:47,607 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [998] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_906 v_~counter~0_2714) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_893 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1493| .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2230|) 4294967296) .cse1) (= (+ v_thread1Thread1of1ForFork0_~i~0_1562 1) v_thread1Thread1of1ForFork0_~i~0_1561) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1493| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1493|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2230|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1562 4294967296) .cse1) (not (= .cse0 0)) (= v_~counter~0_2716 (+ v_~counter~0_2714 (* 2 v_~c~0_906))) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2232| 4294967296) .cse1) (not (= (ite (< 0 (mod v_~counter~0_2716 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_2716, ~c~0=v_~c~0_906, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1562, ~N~0=v_~N~0_893, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2232|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1493|, ~counter~0=v_~counter~0_2714, ~c~0=v_~c~0_906, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1058|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1561, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1501|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1493|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2230|, ~N~0=v_~N~0_893} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:47,688 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1000] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_908 v_~counter~0_2720) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_895 4294967296))) (and (= v_thread1Thread1of1ForFork0_~i~0_1565 (+ v_thread1Thread1of1ForFork0_~i~0_1566 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2238| 4294967296) .cse0) (= .cse1 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1497|) (= v_~counter~0_2722 (+ (* 2 v_~c~0_908) v_~counter~0_2720)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2236|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1497| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1497|) (not (= (ite (< 0 (mod v_~counter~0_2722 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2236|) 4294967296) .cse0) (not (= .cse1 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1566 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2722, ~c~0=v_~c~0_908, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1566, ~N~0=v_~N~0_895, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2238|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1497|, ~counter~0=v_~counter~0_2720, ~c~0=v_~c~0_908, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1060|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1565, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1505|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1497|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2236|, ~N~0=v_~N~0_895} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:47,778 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1004] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_899 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2250| 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_1574 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_912) v_~counter~0_2734) 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod v_~counter~0_2734 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1505| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1505|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2248|) (= (+ (* 2 v_~c~0_912) v_~counter~0_2732) v_~counter~0_2734) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1505| (ite (< 0 (mod (+ v_~c~0_912 v_~counter~0_2732) 4294967296)) 1 0)) (= v_thread1Thread1of1ForFork0_~i~0_1573 (+ v_thread1Thread1of1ForFork0_~i~0_1574 1)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2248|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2734, ~c~0=v_~c~0_912, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1574, ~N~0=v_~N~0_899, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2250|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1505|, ~counter~0=v_~counter~0_2732, ~c~0=v_~c~0_912, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1064|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1573, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1513|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1505|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2248|, ~N~0=v_~N~0_899} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:47,868 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1008] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_903 4294967296)) (.cse1 (ite (< 0 (mod (+ v_~c~0_916 v_~counter~0_2744) 4294967296)) 1 0))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2260|) 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_1582 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2746 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1513| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1513|) (= (+ v_~counter~0_2744 (* 2 v_~c~0_916)) v_~counter~0_2746) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2262| 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2260|) (not (= .cse1 0)) (= .cse1 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1513|) (= v_thread1Thread1of1ForFork0_~i~0_1581 (+ v_thread1Thread1of1ForFork0_~i~0_1582 1)))) InVars {~counter~0=v_~counter~0_2746, ~c~0=v_~c~0_916, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1582, ~N~0=v_~N~0_903, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2262|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1513|, ~counter~0=v_~counter~0_2744, ~c~0=v_~c~0_916, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1068|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1581, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1521|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1513|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2260|, ~N~0=v_~N~0_903} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:47,960 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1010] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_905 4294967296))) (and (not (= (ite (< 0 (mod v_~counter~0_2752 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_1585 (+ v_thread1Thread1of1ForFork0_~i~0_1586 1)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2266|) 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2268| 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_918) v_~counter~0_2752) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1517| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1517|) (= (+ (* 2 v_~c~0_918) v_~counter~0_2750) v_~counter~0_2752) (= (ite (< 0 (mod (+ v_~c~0_918 v_~counter~0_2750) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1517|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2266|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1586 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2752, ~c~0=v_~c~0_918, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1586, ~N~0=v_~N~0_905, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2268|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1517|, ~counter~0=v_~counter~0_2750, ~c~0=v_~c~0_918, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1070|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1585, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1525|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1517|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2266|, ~N~0=v_~N~0_905} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:48,073 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1012] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_907 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1521| (ite (< 0 (mod (+ v_~c~0_920 v_~counter~0_2756) 4294967296)) 1 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2274| 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_1590 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_1589 (+ v_thread1Thread1of1ForFork0_~i~0_1590 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1521| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1521|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2272|) (not (= 0 (ite (< 0 (mod v_~counter~0_2758 4294967296)) 1 0))) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_920) v_~counter~0_2758) 4294967296)) 1 0) 0)) (= (+ (* 2 v_~c~0_920) v_~counter~0_2756) v_~counter~0_2758) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2272|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2758, ~c~0=v_~c~0_920, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1590, ~N~0=v_~N~0_907, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2274|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1521|, ~counter~0=v_~counter~0_2756, ~c~0=v_~c~0_920, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1072|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1589, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1529|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1521|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2272|, ~N~0=v_~N~0_907} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:48,188 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1014] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_909 4294967296)) (.cse1 (ite (< 0 (mod (+ v_~c~0_922 v_~counter~0_2762) 4294967296)) 1 0))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2278|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2764 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_1593 (+ v_thread1Thread1of1ForFork0_~i~0_1594 1)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2278|) (= (+ (* 2 v_~c~0_922) v_~counter~0_2762) v_~counter~0_2764) (= .cse1 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1525|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1525| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1525|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1594 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2280| 4294967296) .cse0) (not (= .cse1 0)))) InVars {~counter~0=v_~counter~0_2764, ~c~0=v_~c~0_922, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1594, ~N~0=v_~N~0_909, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2280|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1525|, ~counter~0=v_~counter~0_2762, ~c~0=v_~c~0_922, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1074|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1593, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1533|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1525|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2278|, ~N~0=v_~N~0_909} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:48,291 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1016] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_924 v_~counter~0_2768) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_911 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1529| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1529|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2286| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1529| .cse1) (< (mod v_thread1Thread1of1ForFork0_~i~0_1598 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_1597 (+ v_thread1Thread1of1ForFork0_~i~0_1598 1)) (not (= .cse1 0)) (= (+ (* 2 v_~c~0_924) v_~counter~0_2768) v_~counter~0_2770) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2284|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2284|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2770 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_2770, ~c~0=v_~c~0_924, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1598, ~N~0=v_~N~0_911, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2286|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1529|, ~counter~0=v_~counter~0_2768, ~c~0=v_~c~0_924, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1076|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1597, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1537|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1529|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2284|, ~N~0=v_~N~0_911} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:48,397 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1018] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_913 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1533| (ite (< 0 (mod (+ v_~c~0_926 v_~counter~0_2774) 4294967296)) 1 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2292| 4294967296) .cse0) (= (+ v_thread1Thread1of1ForFork0_~i~0_1602 1) v_thread1Thread1of1ForFork0_~i~0_1601) (= (+ (* 2 v_~c~0_926) v_~counter~0_2774) v_~counter~0_2776) (not (= (ite (< 0 (mod v_~counter~0_2776 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2290|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1533| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1533|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_926) v_~counter~0_2776) 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1602 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2290|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2776, ~c~0=v_~c~0_926, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1602, ~N~0=v_~N~0_913, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2292|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1533|, ~counter~0=v_~counter~0_2774, ~c~0=v_~c~0_926, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1078|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1601, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1541|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1533|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2290|, ~N~0=v_~N~0_913} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:48,521 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1020] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_915 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2298| 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_928) v_~counter~0_2782) 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod v_~counter~0_2782 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2296|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1606 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2296|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1537| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1537|) (= v_thread1Thread1of1ForFork0_~i~0_1605 (+ v_thread1Thread1of1ForFork0_~i~0_1606 1)) (= (+ (* 2 v_~c~0_928) v_~counter~0_2780) v_~counter~0_2782) (= (ite (< 0 (mod (+ v_~c~0_928 v_~counter~0_2780) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1537|))) InVars {~counter~0=v_~counter~0_2782, ~c~0=v_~c~0_928, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1606, ~N~0=v_~N~0_915, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2298|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1537|, ~counter~0=v_~counter~0_2780, ~c~0=v_~c~0_928, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1080|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1605, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1545|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1537|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2296|, ~N~0=v_~N~0_915} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:48,651 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1024] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_919 4294967296))) (and (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_932) v_~counter~0_2794) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1545| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1545|) (= v_thread1Thread1of1ForFork0_~i~0_1613 (+ v_thread1Thread1of1ForFork0_~i~0_1614 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1614 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2310| 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2794 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2308|) 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2308|) (= (+ v_~counter~0_2792 (* 2 v_~c~0_932)) v_~counter~0_2794) (= (ite (< 0 (mod (+ v_~c~0_932 v_~counter~0_2792) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1545|))) InVars {~counter~0=v_~counter~0_2794, ~c~0=v_~c~0_932, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1614, ~N~0=v_~N~0_919, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2310|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1545|, ~counter~0=v_~counter~0_2792, ~c~0=v_~c~0_932, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1084|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1613, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1553|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1545|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2308|, ~N~0=v_~N~0_919} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:48,776 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1026] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_921 4294967296))) (and (= (ite (< 0 (mod (+ v_~c~0_934 v_~counter~0_2798) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1549|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1549| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1549|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2314|) 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2314|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1618 4294967296) .cse0) (not (= 0 (ite (< 0 (mod (+ (* 4294967295 v_~c~0_934) v_~counter~0_2800) 4294967296)) 1 0))) (not (= (ite (< 0 (mod v_~counter~0_2800 4294967296)) 1 0) 0)) (= (+ v_~counter~0_2798 (* 2 v_~c~0_934)) v_~counter~0_2800) (= v_thread1Thread1of1ForFork0_~i~0_1617 (+ v_thread1Thread1of1ForFork0_~i~0_1618 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2316| 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2800, ~c~0=v_~c~0_934, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1618, ~N~0=v_~N~0_921, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2316|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1549|, ~counter~0=v_~counter~0_2798, ~c~0=v_~c~0_934, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1086|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1617, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1557|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1549|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2314|, ~N~0=v_~N~0_921} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:48,906 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1028] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_923 4294967296))) (and (< (mod v_thread1Thread1of1ForFork0_~i~0_1622 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_936) v_~counter~0_2806) 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2320|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1553| (ite (< 0 (mod (+ v_~c~0_936 v_~counter~0_2804) 4294967296)) 1 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2320|) 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2322| 4294967296) .cse0) (= (+ v_thread1Thread1of1ForFork0_~i~0_1622 1) v_thread1Thread1of1ForFork0_~i~0_1621) (not (= (ite (< 0 (mod v_~counter~0_2806 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1553| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1553|) (= v_~counter~0_2806 (+ v_~counter~0_2804 (* 2 v_~c~0_936))))) InVars {~counter~0=v_~counter~0_2806, ~c~0=v_~c~0_936, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1622, ~N~0=v_~N~0_923, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2322|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1553|, ~counter~0=v_~counter~0_2804, ~c~0=v_~c~0_936, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1088|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1621, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1561|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1553|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2320|, ~N~0=v_~N~0_923} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:49,039 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1030] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_925 4294967296)) (.cse1 (ite (< 0 (mod (+ v_~c~0_938 v_~counter~0_2810) 4294967296)) 1 0))) (and (= v_thread1Thread1of1ForFork0_~i~0_1625 (+ v_thread1Thread1of1ForFork0_~i~0_1626 1)) (not (= (ite (< 0 (mod v_~counter~0_2812 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2328| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1557| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1557|) (= .cse1 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1557|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2326|) (= (+ (* 2 v_~c~0_938) v_~counter~0_2810) v_~counter~0_2812) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2326|) 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_1626 4294967296) .cse0) (not (= .cse1 0)))) InVars {~counter~0=v_~counter~0_2812, ~c~0=v_~c~0_938, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1626, ~N~0=v_~N~0_925, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2328|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1557|, ~counter~0=v_~counter~0_2810, ~c~0=v_~c~0_938, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1090|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1625, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1565|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1557|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2326|, ~N~0=v_~N~0_925} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:49,154 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1032] L51-4-->L51-4: Formula: (let ((.cse1 (mod v_~N~0_927 4294967296)) (.cse0 (ite (< 0 (mod (+ v_~c~0_940 v_~counter~0_2816) 4294967296)) 1 0))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1561| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1561|) (not (= 0 .cse0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2332|) 4294967296) .cse1) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2332|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2334| 4294967296) .cse1) (= v_thread1Thread1of1ForFork0_~i~0_1629 (+ v_thread1Thread1of1ForFork0_~i~0_1630 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1630 4294967296) .cse1) (= (+ (* 2 v_~c~0_940) v_~counter~0_2816) v_~counter~0_2818) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1561| .cse0) (not (= (ite (< 0 (mod v_~counter~0_2818 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_2818, ~c~0=v_~c~0_940, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1630, ~N~0=v_~N~0_927, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2334|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1561|, ~counter~0=v_~counter~0_2816, ~c~0=v_~c~0_940, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1092|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1629, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1569|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1561|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2332|, ~N~0=v_~N~0_927} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:49,275 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1034] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_929 4294967296))) (and (= v_~counter~0_2824 (+ (* 2 v_~c~0_942) v_~counter~0_2822)) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_942) v_~counter~0_2824) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1565| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1565|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2338|) 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2340| 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_1633 (+ v_thread1Thread1of1ForFork0_~i~0_1634 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1634 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2338|) (= (ite (< 0 (mod (+ v_~c~0_942 v_~counter~0_2822) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1565|) (not (= (ite (< 0 (mod v_~counter~0_2824 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_2824, ~c~0=v_~c~0_942, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1634, ~N~0=v_~N~0_929, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2340|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1565|, ~counter~0=v_~counter~0_2822, ~c~0=v_~c~0_942, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1094|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1633, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1573|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1565|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2338|, ~N~0=v_~N~0_929} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:49,403 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1036] L51-4-->L51-4: Formula: (let ((.cse1 (mod v_~N~0_931 4294967296)) (.cse0 (ite (< 0 (mod (+ v_~c~0_944 v_~counter~0_2828) 4294967296)) 1 0))) (and (not (= (ite (< 0 (mod v_~counter~0_2830 4294967296)) 1 0) 0)) (= (+ (* 2 v_~c~0_944) v_~counter~0_2828) v_~counter~0_2830) (not (= 0 .cse0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1638 4294967296) .cse1) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2344|) (= v_thread1Thread1of1ForFork0_~i~0_1637 (+ v_thread1Thread1of1ForFork0_~i~0_1638 1)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2344|) 4294967296) .cse1) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2346| 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1569| .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1569| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1569|))) InVars {~counter~0=v_~counter~0_2830, ~c~0=v_~c~0_944, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1638, ~N~0=v_~N~0_931, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2346|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1569|, ~counter~0=v_~counter~0_2828, ~c~0=v_~c~0_944, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1096|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1637, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1577|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1569|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2344|, ~N~0=v_~N~0_931} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:49,528 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1038] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_933 4294967296))) (and (= v_thread1Thread1of1ForFork0_~i~0_1641 (+ v_thread1Thread1of1ForFork0_~i~0_1642 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2352| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1573| (ite (< 0 (mod (+ v_~c~0_946 v_~counter~0_2834) 4294967296)) 1 0)) (not (= (ite (< 0 (mod v_~counter~0_2836 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_946) v_~counter~0_2836) 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2350|) (= v_~counter~0_2836 (+ (* 2 v_~c~0_946) v_~counter~0_2834)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1573| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1573|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1642 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2350|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2836, ~c~0=v_~c~0_946, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1642, ~N~0=v_~N~0_933, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2352|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1573|, ~counter~0=v_~counter~0_2834, ~c~0=v_~c~0_946, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1098|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1641, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1581|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1573|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2350|, ~N~0=v_~N~0_933} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:49,657 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1040] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_935 4294967296))) (and (< (mod v_thread1Thread1of1ForFork0_~i~0_1646 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2356|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2842 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2358| 4294967296) .cse0) (= v_~counter~0_2842 (+ (* 2 v_~c~0_948) v_~counter~0_2840)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2356|) (= (ite (< 0 (mod (+ v_~c~0_948 v_~counter~0_2840) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1577|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_948) v_~counter~0_2842) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1577| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1577|) (= v_thread1Thread1of1ForFork0_~i~0_1645 (+ v_thread1Thread1of1ForFork0_~i~0_1646 1)))) InVars {~counter~0=v_~counter~0_2842, ~c~0=v_~c~0_948, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1646, ~N~0=v_~N~0_935, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2358|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1577|, ~counter~0=v_~counter~0_2840, ~c~0=v_~c~0_948, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1100|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1645, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1585|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1577|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2356|, ~N~0=v_~N~0_935} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:49,788 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1042] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_937 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1581| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1581|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1650 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2848 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_1649 (+ v_thread1Thread1of1ForFork0_~i~0_1650 1)) (= v_~counter~0_2848 (+ v_~counter~0_2846 (* 2 v_~c~0_950))) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2362|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2364| 4294967296) .cse0) (= (ite (< 0 (mod (+ v_~c~0_950 v_~counter~0_2846) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1581|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_950) v_~counter~0_2848) 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2362|) 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2848, ~c~0=v_~c~0_950, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1650, ~N~0=v_~N~0_937, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2364|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1581|, ~counter~0=v_~counter~0_2846, ~c~0=v_~c~0_950, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1102|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1649, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1589|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1581|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2362|, ~N~0=v_~N~0_937} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:49,910 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1044] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_939 4294967296))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2368|) (not (= 0 (ite (< 0 (mod (+ v_~counter~0_2854 (* 4294967295 v_~c~0_952)) 4294967296)) 1 0))) (< (mod v_thread1Thread1of1ForFork0_~i~0_1654 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2368|) 4294967296) .cse0) (= (+ (* 2 v_~c~0_952) v_~counter~0_2852) v_~counter~0_2854) (= (ite (< 0 (mod (+ v_~c~0_952 v_~counter~0_2852) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1585|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2370| 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_1653 (+ v_thread1Thread1of1ForFork0_~i~0_1654 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1585| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1585|) (not (= (ite (< 0 (mod v_~counter~0_2854 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_2854, ~c~0=v_~c~0_952, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1654, ~N~0=v_~N~0_939, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2370|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1585|, ~counter~0=v_~counter~0_2852, ~c~0=v_~c~0_952, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1104|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1653, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1593|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1585|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2368|, ~N~0=v_~N~0_939} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:50,039 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1046] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_941 4294967296))) (and (= v_~counter~0_2860 (+ (* 2 v_~c~0_954) v_~counter~0_2858)) (= v_thread1Thread1of1ForFork0_~i~0_1657 (+ v_thread1Thread1of1ForFork0_~i~0_1658 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1658 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1589| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1589|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2374|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2376| 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2860 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2374|) 4294967296) .cse0) (= (ite (< 0 (mod (+ v_~c~0_954 v_~counter~0_2858) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1589|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_954) v_~counter~0_2860) 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_2860, ~c~0=v_~c~0_954, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1658, ~N~0=v_~N~0_941, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2376|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1589|, ~counter~0=v_~counter~0_2858, ~c~0=v_~c~0_954, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1106|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1657, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1597|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1589|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2374|, ~N~0=v_~N~0_941} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:50,165 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1048] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_943 4294967296))) (and (not (= (ite (< 0 (mod (+ v_~counter~0_2866 (* 4294967295 v_~c~0_956)) 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2380|) 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_1661 (+ v_thread1Thread1of1ForFork0_~i~0_1662 1)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2380|) (= (ite (< 0 (mod (+ v_~c~0_956 v_~counter~0_2864) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1593|) (not (= 0 (ite (< 0 (mod v_~counter~0_2866 4294967296)) 1 0))) (= v_~counter~0_2866 (+ (* 2 v_~c~0_956) v_~counter~0_2864)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1662 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2382| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1593| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1593|))) InVars {~counter~0=v_~counter~0_2866, ~c~0=v_~c~0_956, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1662, ~N~0=v_~N~0_943, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2382|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1593|, ~counter~0=v_~counter~0_2864, ~c~0=v_~c~0_956, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1108|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1661, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1601|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1593|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2380|, ~N~0=v_~N~0_943} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:50,288 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1050] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_958 v_~counter~0_2870) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_945 4294967296))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2386|) (not (= .cse0 0)) (not (= (ite (< 0 (mod v_~counter~0_2872 4294967296)) 1 0) 0)) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1597|) (= (+ v_~counter~0_2870 (* 2 v_~c~0_958)) v_~counter~0_2872) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1597| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1597|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2388| 4294967296) .cse1) (< (mod v_thread1Thread1of1ForFork0_~i~0_1666 4294967296) .cse1) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2386|) 4294967296) .cse1) (= v_thread1Thread1of1ForFork0_~i~0_1665 (+ v_thread1Thread1of1ForFork0_~i~0_1666 1)))) InVars {~counter~0=v_~counter~0_2872, ~c~0=v_~c~0_958, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1666, ~N~0=v_~N~0_945, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2388|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1597|, ~counter~0=v_~counter~0_2870, ~c~0=v_~c~0_958, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1110|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1665, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1605|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1597|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2386|, ~N~0=v_~N~0_945} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:50,405 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1052] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_947 4294967296))) (and (= (+ v_thread1Thread1of1ForFork0_~i~0_1670 1) v_thread1Thread1of1ForFork0_~i~0_1669) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2392|) (not (= (ite (< 0 (mod (+ v_~counter~0_2878 (* 4294967295 v_~c~0_960)) 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1670 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2392|) 4294967296) .cse0) (= (+ (* 2 v_~c~0_960) v_~counter~0_2876) v_~counter~0_2878) (not (= (ite (< 0 (mod v_~counter~0_2878 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2394| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1601| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1601|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1601| (ite (< 0 (mod (+ v_~c~0_960 v_~counter~0_2876) 4294967296)) 1 0)))) InVars {~counter~0=v_~counter~0_2878, ~c~0=v_~c~0_960, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1670, ~N~0=v_~N~0_947, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2394|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1601|, ~counter~0=v_~counter~0_2876, ~c~0=v_~c~0_960, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1112|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1669, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1609|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1601|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2392|, ~N~0=v_~N~0_947} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:50,533 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1054] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_949 4294967296))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2398|) 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_1673 (+ v_thread1Thread1of1ForFork0_~i~0_1674 1)) (= (+ v_~counter~0_2882 (* 2 v_~c~0_962)) v_~counter~0_2884) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1605| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1605|) (not (= (ite (< 0 (mod (+ v_~counter~0_2884 (* 4294967295 v_~c~0_962)) 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1674 4294967296) .cse0) (= (ite (< 0 (mod (+ v_~c~0_962 v_~counter~0_2882) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1605|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2400| 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2398|) (not (= (ite (< 0 (mod v_~counter~0_2884 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_2884, ~c~0=v_~c~0_962, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1674, ~N~0=v_~N~0_949, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2400|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1605|, ~counter~0=v_~counter~0_2882, ~c~0=v_~c~0_962, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1114|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1673, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1613|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1605|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2398|, ~N~0=v_~N~0_949} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:50,668 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1056] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_951 4294967296))) (and (not (= 0 (ite (< 0 (mod v_~counter~0_2890 4294967296)) 1 0))) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2406| 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2404|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1609| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1609|) (= (ite (< 0 (mod (+ v_~c~0_964 v_~counter~0_2888) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1609|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_964) v_~counter~0_2890) 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2404|) (= (+ (* 2 v_~c~0_964) v_~counter~0_2888) v_~counter~0_2890) (< (mod v_thread1Thread1of1ForFork0_~i~0_1678 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_1677 (+ v_thread1Thread1of1ForFork0_~i~0_1678 1)))) InVars {~counter~0=v_~counter~0_2890, ~c~0=v_~c~0_964, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1678, ~N~0=v_~N~0_951, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2406|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1609|, ~counter~0=v_~counter~0_2888, ~c~0=v_~c~0_964, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1116|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1677, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1617|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1609|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2404|, ~N~0=v_~N~0_951} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:50,802 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1060] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_955 4294967296))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2416|) 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2418| 4294967296) .cse0) (< (mod v_thread1Thread1of1ForFork0_~i~0_1686 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1617| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1617|) (= (+ v_thread1Thread1of1ForFork0_~i~0_1686 1) v_thread1Thread1of1ForFork0_~i~0_1685) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_968) v_~counter~0_2902) 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod v_~counter~0_2902 4294967296)) 1 0) 0)) (= (+ v_~counter~0_2900 (* 2 v_~c~0_968)) v_~counter~0_2902) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2416|) (= (ite (< 0 (mod (+ v_~c~0_968 v_~counter~0_2900) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1617|))) InVars {~counter~0=v_~counter~0_2902, ~c~0=v_~c~0_968, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1686, ~N~0=v_~N~0_955, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2418|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1617|, ~counter~0=v_~counter~0_2900, ~c~0=v_~c~0_968, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1120|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1685, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1625|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1617|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2416|, ~N~0=v_~N~0_955} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:50,936 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1062] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_970 v_~counter~0_2906) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_957 4294967296))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2422|) 4294967296) .cse0) (= (+ v_~counter~0_2906 (* 2 v_~c~0_970)) v_~counter~0_2908) (= (+ v_thread1Thread1of1ForFork0_~i~0_1690 1) v_thread1Thread1of1ForFork0_~i~0_1689) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2424| 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2908 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1621| .cse1) (not (= .cse1 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1690 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1621| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1621|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2422|))) InVars {~counter~0=v_~counter~0_2908, ~c~0=v_~c~0_970, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1690, ~N~0=v_~N~0_957, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2424|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1621|, ~counter~0=v_~counter~0_2906, ~c~0=v_~c~0_970, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1122|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1689, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1629|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1621|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2422|, ~N~0=v_~N~0_957} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:51,054 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1064] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_972 v_~counter~0_2912) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_959 4294967296))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2428|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1625| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1625|) (not (= .cse1 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2428|) (= (+ v_thread1Thread1of1ForFork0_~i~0_1694 1) v_thread1Thread1of1ForFork0_~i~0_1693) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1625| .cse1) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2430| 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2914 4294967296)) 1 0) 0)) (= (+ (* 2 v_~c~0_972) v_~counter~0_2912) v_~counter~0_2914) (< (mod v_thread1Thread1of1ForFork0_~i~0_1694 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2914, ~c~0=v_~c~0_972, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1694, ~N~0=v_~N~0_959, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2430|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1625|, ~counter~0=v_~counter~0_2912, ~c~0=v_~c~0_972, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1124|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1693, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1633|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1625|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2428|, ~N~0=v_~N~0_959} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:51,181 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1066] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_961 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2436| 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_974) v_~counter~0_2920) 4294967296)) 1 0) 0)) (not (= (ite (< 0 (mod v_~counter~0_2920 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1698 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2434|) (= v_thread1Thread1of1ForFork0_~i~0_1697 (+ v_thread1Thread1of1ForFork0_~i~0_1698 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1629| (ite (< 0 (mod (+ v_~c~0_974 v_~counter~0_2918) 4294967296)) 1 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2434|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1629| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1629|) (= v_~counter~0_2920 (+ (* 2 v_~c~0_974) v_~counter~0_2918)))) InVars {~counter~0=v_~counter~0_2920, ~c~0=v_~c~0_974, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1698, ~N~0=v_~N~0_961, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2436|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1629|, ~counter~0=v_~counter~0_2918, ~c~0=v_~c~0_974, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1126|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1697, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1637|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1629|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2434|, ~N~0=v_~N~0_961} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:51,312 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1068] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_963 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1633| (ite (< 0 (mod (+ v_~c~0_976 v_~counter~0_2924) 4294967296)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1633| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1633|) (not (= (ite (< 0 (mod v_~counter~0_2926 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1702 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2440|) 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_976) v_~counter~0_2926) 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_1701 (+ v_thread1Thread1of1ForFork0_~i~0_1702 1)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2440|) (= (+ v_~counter~0_2924 (* 2 v_~c~0_976)) v_~counter~0_2926) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2442| 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2926, ~c~0=v_~c~0_976, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1702, ~N~0=v_~N~0_963, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2442|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1633|, ~counter~0=v_~counter~0_2924, ~c~0=v_~c~0_976, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1128|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1701, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1641|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1633|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2440|, ~N~0=v_~N~0_963} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:51,439 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1070] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_965 4294967296)) (.cse1 (ite (< 0 (mod (+ v_~c~0_978 v_~counter~0_2930) 4294967296)) 1 0))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2446|) 4294967296) .cse0) (= v_~counter~0_2932 (+ (* 2 v_~c~0_978) v_~counter~0_2930)) (= v_thread1Thread1of1ForFork0_~i~0_1705 (+ v_thread1Thread1of1ForFork0_~i~0_1706 1)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2448| 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2932 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2446|) (not (= .cse1 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1706 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1637| .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1637| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1637|))) InVars {~counter~0=v_~counter~0_2932, ~c~0=v_~c~0_978, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1706, ~N~0=v_~N~0_965, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2448|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1637|, ~counter~0=v_~counter~0_2930, ~c~0=v_~c~0_978, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1130|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1705, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1645|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1637|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2446|, ~N~0=v_~N~0_965} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:51,559 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1072] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_967 4294967296))) (and (not (= (ite (< 0 (mod v_~counter~0_2938 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1641| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1641|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2452|) 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2454| 4294967296) .cse0) (not (= (ite (< 0 (mod (+ v_~counter~0_2938 (* 4294967295 v_~c~0_980)) 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2452|) (= (ite (< 0 (mod (+ v_~c~0_980 v_~counter~0_2936) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1641|) (= (+ v_~counter~0_2936 (* 2 v_~c~0_980)) v_~counter~0_2938) (= (+ v_thread1Thread1of1ForFork0_~i~0_1710 1) v_thread1Thread1of1ForFork0_~i~0_1709) (< (mod v_thread1Thread1of1ForFork0_~i~0_1710 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2938, ~c~0=v_~c~0_980, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1710, ~N~0=v_~N~0_967, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2454|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1641|, ~counter~0=v_~counter~0_2936, ~c~0=v_~c~0_980, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1132|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1709, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1649|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1641|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2452|, ~N~0=v_~N~0_967} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:51,683 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1074] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_982 v_~counter~0_2942) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_969 4294967296))) (and (not (= 0 .cse0)) (= (+ v_~counter~0_2942 (* 2 v_~c~0_982)) v_~counter~0_2944) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2460| 4294967296) .cse1) (= v_thread1Thread1of1ForFork0_~i~0_1713 (+ v_thread1Thread1of1ForFork0_~i~0_1714 1)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2458|) 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1645| .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1645| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1645|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2458|) (not (= (ite (< 0 (mod v_~counter~0_2944 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1714 4294967296) .cse1))) InVars {~counter~0=v_~counter~0_2944, ~c~0=v_~c~0_982, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1714, ~N~0=v_~N~0_969, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2460|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1645|, ~counter~0=v_~counter~0_2942, ~c~0=v_~c~0_982, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1134|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1713, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1653|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1645|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2458|, ~N~0=v_~N~0_969} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:51,803 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1076] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_971 4294967296))) (and (not (= (ite (< 0 (mod v_~counter~0_2950 4294967296)) 1 0) 0)) (= (+ (* 2 v_~c~0_984) v_~counter~0_2948) v_~counter~0_2950) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1649| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1649|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2464|) 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2464|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1718 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2466| 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_984) v_~counter~0_2950) 4294967296)) 1 0) 0)) (= (ite (< 0 (mod (+ v_~c~0_984 v_~counter~0_2948) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1649|) (= v_thread1Thread1of1ForFork0_~i~0_1717 (+ v_thread1Thread1of1ForFork0_~i~0_1718 1)))) InVars {~counter~0=v_~counter~0_2950, ~c~0=v_~c~0_984, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1718, ~N~0=v_~N~0_971, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2466|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1649|, ~counter~0=v_~counter~0_2948, ~c~0=v_~c~0_984, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1136|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1717, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1657|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1649|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2464|, ~N~0=v_~N~0_971} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:51,931 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1078] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_973 4294967296))) (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2470|) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_986) v_~counter~0_2956) 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2470|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1653| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1653|) (not (= (ite (< 0 (mod v_~counter~0_2956 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_1721 (+ v_thread1Thread1of1ForFork0_~i~0_1722 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1653| (ite (< 0 (mod (+ v_~c~0_986 v_~counter~0_2954) 4294967296)) 1 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1722 4294967296) .cse0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2472| 4294967296) .cse0) (= (+ v_~counter~0_2954 (* 2 v_~c~0_986)) v_~counter~0_2956))) InVars {~counter~0=v_~counter~0_2956, ~c~0=v_~c~0_986, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1722, ~N~0=v_~N~0_973, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2472|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1653|, ~counter~0=v_~counter~0_2954, ~c~0=v_~c~0_986, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1138|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1721, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1661|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1653|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2470|, ~N~0=v_~N~0_973} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:52,057 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1080] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_975 4294967296))) (and (= v_thread1Thread1of1ForFork0_~i~0_1725 (+ v_thread1Thread1of1ForFork0_~i~0_1726 1)) (not (= (ite (< 0 (mod (+ v_~counter~0_2962 (* 4294967295 v_~c~0_988)) 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2476|) (= (+ (* 2 v_~c~0_988) v_~counter~0_2960) v_~counter~0_2962) (= (ite (< 0 (mod (+ v_~c~0_988 v_~counter~0_2960) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1657|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2476|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2962 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2478| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1657| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1657|) (< (mod v_thread1Thread1of1ForFork0_~i~0_1726 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_2962, ~c~0=v_~c~0_988, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1726, ~N~0=v_~N~0_975, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2478|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1657|, ~counter~0=v_~counter~0_2960, ~c~0=v_~c~0_988, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1140|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1725, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1665|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1657|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2476|, ~N~0=v_~N~0_975} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:52,187 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1082] L51-4-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_990 v_~counter~0_2966) 4294967296)) 1 0)) (.cse1 (mod v_~N~0_977 4294967296))) (and (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1661|) (not (= .cse0 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1730 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1661| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1661|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2482|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2482|) 4294967296) .cse1) (= v_thread1Thread1of1ForFork0_~i~0_1729 (+ v_thread1Thread1of1ForFork0_~i~0_1730 1)) (= (+ v_~counter~0_2966 (* 2 v_~c~0_990)) v_~counter~0_2968) (not (= (ite (< 0 (mod v_~counter~0_2968 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2484| 4294967296) .cse1))) InVars {~counter~0=v_~counter~0_2968, ~c~0=v_~c~0_990, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1730, ~N~0=v_~N~0_977, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2484|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1661|, ~counter~0=v_~counter~0_2966, ~c~0=v_~c~0_990, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1142|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1729, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1669|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1661|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2482|, ~N~0=v_~N~0_977} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:52,304 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1084] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_979 4294967296))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2488|) 4294967296) .cse0) (= (ite (< 0 (mod (+ v_~c~0_992 v_~counter~0_2972) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1665|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1665| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1665|) (not (= (ite (< 0 (mod v_~counter~0_2974 4294967296)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2490| 4294967296) .cse0) (= (+ v_~counter~0_2972 (* 2 v_~c~0_992)) v_~counter~0_2974) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_992) v_~counter~0_2974) 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1734 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_1733 (+ v_thread1Thread1of1ForFork0_~i~0_1734 1)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2488|))) InVars {~counter~0=v_~counter~0_2974, ~c~0=v_~c~0_992, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1734, ~N~0=v_~N~0_979, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2490|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1665|, ~counter~0=v_~counter~0_2972, ~c~0=v_~c~0_992, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1144|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1733, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1673|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1665|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2488|, ~N~0=v_~N~0_979} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:52,398 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1086] L51-4-->L51-4: Formula: (let ((.cse1 (ite (< 0 (mod (+ v_~c~0_994 v_~counter~0_2978) 4294967296)) 1 0)) (.cse0 (mod v_~N~0_981 4294967296))) (and (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2496| 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_1737 (+ v_thread1Thread1of1ForFork0_~i~0_1738 1)) (= .cse1 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1669|) (not (= (ite (< 0 (mod v_~counter~0_2980 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1738 4294967296) .cse0) (not (= .cse1 0)) (= (+ (* 2 v_~c~0_994) v_~counter~0_2978) v_~counter~0_2980) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2494|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2494|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1669| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1669|))) InVars {~counter~0=v_~counter~0_2980, ~c~0=v_~c~0_994, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1738, ~N~0=v_~N~0_981, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2496|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1669|, ~counter~0=v_~counter~0_2978, ~c~0=v_~c~0_994, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1146|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1737, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1677|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1669|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2494|, ~N~0=v_~N~0_981} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:52,490 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1088] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_983 4294967296))) (and (= v_thread1Thread1of1ForFork0_~i~0_1741 (+ v_thread1Thread1of1ForFork0_~i~0_1742 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1673| (ite (< 0 (mod (+ v_~c~0_996 v_~counter~0_2984) 4294967296)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1673| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1673|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2502| 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_2986 4294967296)) 1 0) 0)) (< (mod v_thread1Thread1of1ForFork0_~i~0_1742 4294967296) .cse0) (not (= (ite (< 0 (mod (+ (* 4294967295 v_~c~0_996) v_~counter~0_2986) 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2500|) 4294967296) .cse0) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2500|) (= v_~counter~0_2986 (+ v_~counter~0_2984 (* 2 v_~c~0_996))))) InVars {~counter~0=v_~counter~0_2986, ~c~0=v_~c~0_996, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1742, ~N~0=v_~N~0_983, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2502|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1673|, ~counter~0=v_~counter~0_2984, ~c~0=v_~c~0_996, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1148|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1741, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1681|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1673|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2500|, ~N~0=v_~N~0_983} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:52,587 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [515] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_409 4) (< 3 (mod v_~N~0_327 4294967296)) (= (+ (* v_~c~0_340 4) v_~counter~0_1010) v_~counter~0_1008)) InVars {~counter~0=v_~counter~0_1010, ~c~0=v_~c~0_340, ~N~0=v_~N~0_327} OutVars{~counter~0=v_~counter~0_1008, ~c~0=v_~c~0_340, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_310|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_409, ~N~0=v_~N~0_327} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [1090] L51-4-->L51-4: Formula: (let ((.cse1 (mod v_~N~0_985 4294967296)) (.cse0 (ite (< 0 (mod (+ v_~c~0_998 v_~counter~0_2990) 4294967296)) 1 0))) (and (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1677|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_2506|) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_2506|) 4294967296) .cse1) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2508| 4294967296) .cse1) (< (mod v_thread1Thread1of1ForFork0_~i~0_1746 4294967296) .cse1) (not (= .cse0 0)) (= (+ (* 2 v_~c~0_998) v_~counter~0_2990) v_~counter~0_2992) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1677| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1677|) (= (+ v_thread1Thread1of1ForFork0_~i~0_1746 1) v_thread1Thread1of1ForFork0_~i~0_1745) (not (= (ite (< 0 (mod v_~counter~0_2992 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_2992, ~c~0=v_~c~0_998, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1746, ~N~0=v_~N~0_985, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2508|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1677|, ~counter~0=v_~counter~0_2990, ~c~0=v_~c~0_998, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1150|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1745, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1685|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1677|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2506|, ~N~0=v_~N~0_985} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:00:52,685 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 02:00:52,687 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24609 [2022-12-13 02:00:52,687 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 759 transitions, 32612 flow [2022-12-13 02:00:52,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:52,687 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:52,687 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:52,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-13 02:00:52,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:00:52,891 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:52,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:52,891 INFO L85 PathProgramCache]: Analyzing trace with hash -392781229, now seen corresponding path program 1 times [2022-12-13 02:00:52,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:52,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867191137] [2022-12-13 02:00:52,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:52,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:52,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:52,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867191137] [2022-12-13 02:00:52,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867191137] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:00:52,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906862557] [2022-12-13 02:00:52,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:52,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:00:52,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:00:53,005 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:00:53,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-13 02:00:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:53,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:00:53,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:00:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:53,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:00:53,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:53,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906862557] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:00:53,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:00:53,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 02:00:53,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487318769] [2022-12-13 02:00:53,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:00:53,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:00:53,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:53,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:00:53,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:00:53,143 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 160 [2022-12-13 02:00:53,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 759 transitions, 32612 flow. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:53,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:53,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 160 [2022-12-13 02:00:53,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:57,390 INFO L130 PetriNetUnfolder]: 4226/9088 cut-off events. [2022-12-13 02:00:57,390 INFO L131 PetriNetUnfolder]: For 1043745/1043745 co-relation queries the response was YES. [2022-12-13 02:00:57,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132573 conditions, 9088 events. 4226/9088 cut-off events. For 1043745/1043745 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 86141 event pairs, 954 based on Foata normal form. 54/9138 useless extension candidates. Maximal degree in co-relation 130912. Up to 3511 conditions per place. [2022-12-13 02:00:57,511 INFO L137 encePairwiseOnDemand]: 123/160 looper letters, 195 selfloop transitions, 518 changer transitions 29/742 dead transitions. [2022-12-13 02:00:57,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 742 transitions, 29077 flow [2022-12-13 02:00:57,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 02:00:57,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 02:00:57,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2022-12-13 02:00:57,512 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.08203125 [2022-12-13 02:00:57,513 INFO L175 Difference]: Start difference. First operand has 302 places, 759 transitions, 32612 flow. Second operand 8 states and 105 transitions. [2022-12-13 02:00:57,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 742 transitions, 29077 flow [2022-12-13 02:01:01,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 742 transitions, 28636 flow, removed 189 selfloop flow, removed 5 redundant places. [2022-12-13 02:01:01,123 INFO L231 Difference]: Finished difference. Result has 307 places, 672 transitions, 27497 flow [2022-12-13 02:01:01,124 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=25181, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=495, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=27497, PETRI_PLACES=307, PETRI_TRANSITIONS=672} [2022-12-13 02:01:01,124 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 287 predicate places. [2022-12-13 02:01:01,124 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:01,124 INFO L89 Accepts]: Start accepts. Operand has 307 places, 672 transitions, 27497 flow [2022-12-13 02:01:01,128 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:01,128 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:01,129 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 307 places, 672 transitions, 27497 flow [2022-12-13 02:01:01,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 305 places, 672 transitions, 27497 flow [2022-12-13 02:01:01,850 INFO L130 PetriNetUnfolder]: 799/3566 cut-off events. [2022-12-13 02:01:01,850 INFO L131 PetriNetUnfolder]: For 302181/302198 co-relation queries the response was YES. [2022-12-13 02:01:01,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46641 conditions, 3566 events. 799/3566 cut-off events. For 302181/302198 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 43942 event pairs, 86 based on Foata normal form. 0/3558 useless extension candidates. Maximal degree in co-relation 46390. Up to 977 conditions per place. [2022-12-13 02:01:01,919 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 305 places, 672 transitions, 27497 flow [2022-12-13 02:01:01,919 INFO L226 LiptonReduction]: Number of co-enabled transitions 2194 [2022-12-13 02:01:01,925 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (+ v_~counter~0_750 v_~c~0_266))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_378| (ite (< 0 (mod v_~counter~0_748 4294967296)) 1 0)) (= 7 v_thread1Thread1of1ForFork0_~i~0_285) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_378| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_378|) (not (= (ite (< 0 (mod (+ v_~counter~0_750 (* 2 v_~c~0_266)) 4294967296)) 1 0) 0)) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_535|) (not (= (ite (< 0 (mod .cse0 4294967296)) 1 0) 0)) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_285) 4294967296) (mod v_~N~0_253 4294967296)) (= v_~counter~0_748 .cse0))) InVars {~counter~0=v_~counter~0_750, ~c~0=v_~c~0_266, ~N~0=v_~N~0_253} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_378|, ~counter~0=v_~counter~0_748, ~c~0=v_~c~0_266, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_208|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_285, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_386|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_378|, ~N~0=v_~N~0_253, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_535|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:01:01,926 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:01:01,926 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:01:02,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] L41-4-->thread1EXIT: Formula: (and (not (< (mod v_thread1Thread1of1ForFork0_~i~0_In_1 4294967296) (mod v_~N~0_In_3 4294967296))) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:01:02,202 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [293] L41-4-->thread1EXIT: Formula: (and (not (< (mod v_thread1Thread1of1ForFork0_~i~0_In_1 4294967296) (mod v_~N~0_In_3 4294967296))) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N~0=v_~N~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N~0=v_~N~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:01:02,289 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:01:02,289 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:01:02,429 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [847] $Ultimate##0-->L41-4: Formula: (and (= (+ (* 3 v_~c~0_748) v_~counter~0_2238) v_~counter~0_2236) (= (ite (< 0 (mod v_~counter~0_2236 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1189|) (not (= 0 (ite (< 0 (mod (+ (* 2 v_~c~0_748) v_~counter~0_2238) 4294967296)) 1 0))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1189| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1189| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1189|) (< 8 (mod v_~N~0_735 4294967296)) (not (= 0 (ite (< 0 (mod (+ v_~c~0_748 v_~counter~0_2238) 4294967296)) 1 0))) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_1782|) (= v_thread1Thread1of1ForFork0_~i~0_1233 9)) InVars {~counter~0=v_~counter~0_2238, ~c~0=v_~c~0_748, ~N~0=v_~N~0_735} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1189|, ~counter~0=v_~counter~0_2236, ~c~0=v_~c~0_748, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_880|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1233, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1197|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1189|, ~N~0=v_~N~0_735, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1782|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:01:02,429 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:01:02,429 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:01:02,637 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [847] $Ultimate##0-->L41-4: Formula: (and (= (+ (* 3 v_~c~0_748) v_~counter~0_2238) v_~counter~0_2236) (= (ite (< 0 (mod v_~counter~0_2236 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1189|) (not (= 0 (ite (< 0 (mod (+ (* 2 v_~c~0_748) v_~counter~0_2238) 4294967296)) 1 0))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1189| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1189| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1189|) (< 8 (mod v_~N~0_735 4294967296)) (not (= 0 (ite (< 0 (mod (+ v_~c~0_748 v_~counter~0_2238) 4294967296)) 1 0))) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_1782|) (= v_thread1Thread1of1ForFork0_~i~0_1233 9)) InVars {~counter~0=v_~counter~0_2238, ~c~0=v_~c~0_748, ~N~0=v_~N~0_735} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1189|, ~counter~0=v_~counter~0_2236, ~c~0=v_~c~0_748, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_880|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1233, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1197|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1189|, ~N~0=v_~N~0_735, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1782|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [1204] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_1209 4294967296))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1907| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1907|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_2961| 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1907| 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_2961| 1) 4294967296) .cse0) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_2961|) |v_thread2Thread1of1ForFork1_~i~1#1_2959|) (= (ite (< 0 (mod (+ v_~counter~0_3663 (* v_~c~0_1222 4294967295)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1907|) (not (= (ite (< 0 (mod v_~counter~0_3663 4294967296)) 1 0) 0)) (= (+ (* v_~c~0_1222 2) v_~counter~0_3661) v_~counter~0_3663))) InVars {~counter~0=v_~counter~0_3663, ~c~0=v_~c~0_1222, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2961|, ~N~0=v_~N~0_1209} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1907|, ~counter~0=v_~counter~0_3661, ~c~0=v_~c~0_1222, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1915|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1907|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2959|, ~N~0=v_~N~0_1209} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:01:02,637 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:01:02,637 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:01:02,997 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 02:01:02,998 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1874 [2022-12-13 02:01:02,998 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 670 transitions, 27547 flow [2022-12-13 02:01:02,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:02,998 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:02,998 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:03,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-12-13 02:01:03,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-13 02:01:03,199 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:03,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:03,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1308256311, now seen corresponding path program 2 times [2022-12-13 02:01:03,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:03,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991739499] [2022-12-13 02:01:03,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:03,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:03,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:03,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:03,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991739499] [2022-12-13 02:01:03,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991739499] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:01:03,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030501956] [2022-12-13 02:01:03,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:01:03,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:01:03,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:01:03,272 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:01:03,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-13 02:01:03,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:01:03,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:01:03,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:01:03,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:01:03,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:03,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:01:03,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:03,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030501956] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:01:03,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:01:03,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 02:01:03,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929906937] [2022-12-13 02:01:03,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:01:03,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:01:03,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:03,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:01:03,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:01:03,429 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-13 02:01:03,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 670 transitions, 27547 flow. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:03,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:03,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-13 02:01:03,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:07,293 INFO L130 PetriNetUnfolder]: 4283/9147 cut-off events. [2022-12-13 02:01:07,293 INFO L131 PetriNetUnfolder]: For 1152097/1152097 co-relation queries the response was YES. [2022-12-13 02:01:07,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140883 conditions, 9147 events. 4283/9147 cut-off events. For 1152097/1152097 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 86454 event pairs, 594 based on Foata normal form. 38/9181 useless extension candidates. Maximal degree in co-relation 140325. Up to 4115 conditions per place. [2022-12-13 02:01:07,418 INFO L137 encePairwiseOnDemand]: 15/62 looper letters, 213 selfloop transitions, 541 changer transitions 15/769 dead transitions. [2022-12-13 02:01:07,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 769 transitions, 31745 flow [2022-12-13 02:01:07,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 02:01:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 02:01:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 134 transitions. [2022-12-13 02:01:07,420 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1543778801843318 [2022-12-13 02:01:07,420 INFO L175 Difference]: Start difference. First operand has 303 places, 670 transitions, 27547 flow. Second operand 14 states and 134 transitions. [2022-12-13 02:01:07,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 769 transitions, 31745 flow [2022-12-13 02:01:11,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 769 transitions, 30947 flow, removed 294 selfloop flow, removed 5 redundant places. [2022-12-13 02:01:11,422 INFO L231 Difference]: Finished difference. Result has 319 places, 706 transitions, 30302 flow [2022-12-13 02:01:11,423 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=26786, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=515, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=30302, PETRI_PLACES=319, PETRI_TRANSITIONS=706} [2022-12-13 02:01:11,423 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 299 predicate places. [2022-12-13 02:01:11,423 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:11,423 INFO L89 Accepts]: Start accepts. Operand has 319 places, 706 transitions, 30302 flow [2022-12-13 02:01:11,428 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:11,428 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:11,428 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 319 places, 706 transitions, 30302 flow [2022-12-13 02:01:11,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 317 places, 706 transitions, 30302 flow [2022-12-13 02:01:12,279 INFO L130 PetriNetUnfolder]: 821/3552 cut-off events. [2022-12-13 02:01:12,280 INFO L131 PetriNetUnfolder]: For 368659/368659 co-relation queries the response was YES. [2022-12-13 02:01:12,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51528 conditions, 3552 events. 821/3552 cut-off events. For 368659/368659 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 43453 event pairs, 79 based on Foata normal form. 0/3534 useless extension candidates. Maximal degree in co-relation 50902. Up to 997 conditions per place. [2022-12-13 02:01:12,347 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 317 places, 706 transitions, 30302 flow [2022-12-13 02:01:12,348 INFO L226 LiptonReduction]: Number of co-enabled transitions 2286 [2022-12-13 02:01:12,352 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:01:12,353 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 930 [2022-12-13 02:01:12,353 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 706 transitions, 30302 flow [2022-12-13 02:01:12,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:12,353 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:12,353 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:12,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-12-13 02:01:12,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-13 02:01:12,557 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:12,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:12,558 INFO L85 PathProgramCache]: Analyzing trace with hash 715598579, now seen corresponding path program 1 times [2022-12-13 02:01:12,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:12,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7585376] [2022-12-13 02:01:12,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:12,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:12,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:12,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:12,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7585376] [2022-12-13 02:01:12,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7585376] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:01:12,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211525489] [2022-12-13 02:01:12,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:12,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:01:12,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:01:12,639 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:01:12,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-13 02:01:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:12,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:01:12,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:01:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:12,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:01:12,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:12,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211525489] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:01:12,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:01:12,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 02:01:12,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659655370] [2022-12-13 02:01:12,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:01:12,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:01:12,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:12,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:01:12,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:01:12,783 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-13 02:01:12,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 706 transitions, 30302 flow. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:12,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:12,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-13 02:01:12,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:16,643 INFO L130 PetriNetUnfolder]: 4318/9208 cut-off events. [2022-12-13 02:01:16,643 INFO L131 PetriNetUnfolder]: For 1342395/1342395 co-relation queries the response was YES. [2022-12-13 02:01:16,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150061 conditions, 9208 events. 4318/9208 cut-off events. For 1342395/1342395 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 86785 event pairs, 1724 based on Foata normal form. 38/9242 useless extension candidates. Maximal degree in co-relation 148280. Up to 7441 conditions per place. [2022-12-13 02:01:16,764 INFO L137 encePairwiseOnDemand]: 17/62 looper letters, 412 selfloop transitions, 373 changer transitions 10/795 dead transitions. [2022-12-13 02:01:16,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 795 transitions, 34183 flow [2022-12-13 02:01:16,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 02:01:16,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 02:01:16,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2022-12-13 02:01:16,765 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1693548387096774 [2022-12-13 02:01:16,765 INFO L175 Difference]: Start difference. First operand has 317 places, 706 transitions, 30302 flow. Second operand 10 states and 105 transitions. [2022-12-13 02:01:16,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 795 transitions, 34183 flow [2022-12-13 02:01:22,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 795 transitions, 33795 flow, removed 192 selfloop flow, removed 1 redundant places. [2022-12-13 02:01:22,252 INFO L231 Difference]: Finished difference. Result has 328 places, 721 transitions, 31550 flow [2022-12-13 02:01:22,253 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=29924, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=706, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=356, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=31550, PETRI_PLACES=328, PETRI_TRANSITIONS=721} [2022-12-13 02:01:22,253 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 308 predicate places. [2022-12-13 02:01:22,253 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:22,253 INFO L89 Accepts]: Start accepts. Operand has 328 places, 721 transitions, 31550 flow [2022-12-13 02:01:22,260 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:22,261 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:22,261 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 328 places, 721 transitions, 31550 flow [2022-12-13 02:01:22,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 328 places, 721 transitions, 31550 flow [2022-12-13 02:01:23,223 INFO L130 PetriNetUnfolder]: 830/3644 cut-off events. [2022-12-13 02:01:23,223 INFO L131 PetriNetUnfolder]: For 393641/393641 co-relation queries the response was YES. [2022-12-13 02:01:23,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52939 conditions, 3644 events. 830/3644 cut-off events. For 393641/393641 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 44856 event pairs, 78 based on Foata normal form. 0/3635 useless extension candidates. Maximal degree in co-relation 52290. Up to 1002 conditions per place. [2022-12-13 02:01:23,300 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 328 places, 721 transitions, 31550 flow [2022-12-13 02:01:23,300 INFO L226 LiptonReduction]: Number of co-enabled transitions 2340 [2022-12-13 02:01:23,306 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:01:23,308 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1055 [2022-12-13 02:01:23,308 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 721 transitions, 31550 flow [2022-12-13 02:01:23,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:23,309 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:23,309 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:23,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-12-13 02:01:23,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:01:23,514 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:23,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:23,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1548668127, now seen corresponding path program 2 times [2022-12-13 02:01:23,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:23,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847883419] [2022-12-13 02:01:23,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:23,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:23,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:23,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847883419] [2022-12-13 02:01:23,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847883419] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:01:23,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296600705] [2022-12-13 02:01:23,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:01:23,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:01:23,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:01:23,609 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:01:23,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-13 02:01:23,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:01:23,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:01:23,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:01:23,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:01:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:23,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:01:23,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:23,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296600705] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:01:23,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:01:23,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 02:01:23,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552243599] [2022-12-13 02:01:23,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:01:23,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:01:23,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:23,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:01:23,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:01:23,780 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-13 02:01:23,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 721 transitions, 31550 flow. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:23,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:23,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-13 02:01:23,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:28,301 INFO L130 PetriNetUnfolder]: 4268/9090 cut-off events. [2022-12-13 02:01:28,301 INFO L131 PetriNetUnfolder]: For 1416605/1416605 co-relation queries the response was YES. [2022-12-13 02:01:28,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151270 conditions, 9090 events. 4268/9090 cut-off events. For 1416605/1416605 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 85435 event pairs, 988 based on Foata normal form. 48/9134 useless extension candidates. Maximal degree in co-relation 149426. Up to 3511 conditions per place. [2022-12-13 02:01:28,420 INFO L137 encePairwiseOnDemand]: 22/62 looper letters, 198 selfloop transitions, 559 changer transitions 0/757 dead transitions. [2022-12-13 02:01:28,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 757 transitions, 33714 flow [2022-12-13 02:01:28,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 02:01:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 02:01:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2022-12-13 02:01:28,421 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1935483870967742 [2022-12-13 02:01:28,421 INFO L175 Difference]: Start difference. First operand has 328 places, 721 transitions, 31550 flow. Second operand 8 states and 96 transitions. [2022-12-13 02:01:28,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 757 transitions, 33714 flow [2022-12-13 02:01:34,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 757 transitions, 32810 flow, removed 255 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:34,376 INFO L231 Difference]: Finished difference. Result has 334 places, 719 transitions, 32637 flow [2022-12-13 02:01:34,376 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=30535, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=717, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=557, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=32637, PETRI_PLACES=334, PETRI_TRANSITIONS=719} [2022-12-13 02:01:34,377 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 314 predicate places. [2022-12-13 02:01:34,377 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:34,377 INFO L89 Accepts]: Start accepts. Operand has 334 places, 719 transitions, 32637 flow [2022-12-13 02:01:34,383 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:34,383 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:34,383 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 334 places, 719 transitions, 32637 flow [2022-12-13 02:01:34,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 719 transitions, 32637 flow [2022-12-13 02:01:35,256 INFO L130 PetriNetUnfolder]: 821/3589 cut-off events. [2022-12-13 02:01:35,256 INFO L131 PetriNetUnfolder]: For 408174/408174 co-relation queries the response was YES. [2022-12-13 02:01:35,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53119 conditions, 3589 events. 821/3589 cut-off events. For 408174/408174 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 44066 event pairs, 80 based on Foata normal form. 0/3578 useless extension candidates. Maximal degree in co-relation 52463. Up to 988 conditions per place. [2022-12-13 02:01:35,337 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 334 places, 719 transitions, 32637 flow [2022-12-13 02:01:35,338 INFO L226 LiptonReduction]: Number of co-enabled transitions 2344 [2022-12-13 02:01:35,342 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:01:35,343 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 966 [2022-12-13 02:01:35,343 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 719 transitions, 32637 flow [2022-12-13 02:01:35,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:35,343 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:35,343 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:35,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-12-13 02:01:35,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-12-13 02:01:35,549 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:35,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:35,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1574423314, now seen corresponding path program 1 times [2022-12-13 02:01:35,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:35,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896790333] [2022-12-13 02:01:35,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:35,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:35,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:35,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896790333] [2022-12-13 02:01:35,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896790333] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:01:35,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53264141] [2022-12-13 02:01:35,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:35,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:01:35,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:01:35,629 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:01:35,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-13 02:01:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:35,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 02:01:35,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:01:35,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:35,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:01:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:35,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53264141] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:01:35,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:01:35,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-13 02:01:35,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490376935] [2022-12-13 02:01:35,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:01:35,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:01:35,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:35,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:01:35,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:01:35,772 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-13 02:01:35,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 719 transitions, 32637 flow. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:35,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:35,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-13 02:01:35,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:43,071 INFO L130 PetriNetUnfolder]: 4864/10403 cut-off events. [2022-12-13 02:01:43,071 INFO L131 PetriNetUnfolder]: For 1733443/1733443 co-relation queries the response was YES. [2022-12-13 02:01:43,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177890 conditions, 10403 events. 4864/10403 cut-off events. For 1733443/1733443 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 99223 event pairs, 327 based on Foata normal form. 124/10523 useless extension candidates. Maximal degree in co-relation 176011. Up to 3351 conditions per place. [2022-12-13 02:01:43,203 INFO L137 encePairwiseOnDemand]: 14/62 looper letters, 82 selfloop transitions, 711 changer transitions 54/847 dead transitions. [2022-12-13 02:01:43,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 847 transitions, 37837 flow [2022-12-13 02:01:43,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 02:01:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 02:01:43,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 130 transitions. [2022-12-13 02:01:43,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1497695852534562 [2022-12-13 02:01:43,205 INFO L175 Difference]: Start difference. First operand has 334 places, 719 transitions, 32637 flow. Second operand 14 states and 130 transitions. [2022-12-13 02:01:43,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 847 transitions, 37837 flow [2022-12-13 02:01:48,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 847 transitions, 36908 flow, removed 38 selfloop flow, removed 6 redundant places. [2022-12-13 02:01:48,425 INFO L231 Difference]: Finished difference. Result has 348 places, 764 transitions, 36259 flow [2022-12-13 02:01:48,426 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=31755, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=719, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=678, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=36259, PETRI_PLACES=348, PETRI_TRANSITIONS=764} [2022-12-13 02:01:48,426 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 328 predicate places. [2022-12-13 02:01:48,426 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:48,426 INFO L89 Accepts]: Start accepts. Operand has 348 places, 764 transitions, 36259 flow [2022-12-13 02:01:48,435 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:48,435 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:48,435 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 348 places, 764 transitions, 36259 flow [2022-12-13 02:01:48,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 346 places, 764 transitions, 36259 flow [2022-12-13 02:01:49,393 INFO L130 PetriNetUnfolder]: 899/3803 cut-off events. [2022-12-13 02:01:49,393 INFO L131 PetriNetUnfolder]: For 513203/513203 co-relation queries the response was YES. [2022-12-13 02:01:49,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62409 conditions, 3803 events. 899/3803 cut-off events. For 513203/513203 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 46234 event pairs, 48 based on Foata normal form. 0/3772 useless extension candidates. Maximal degree in co-relation 61725. Up to 1102 conditions per place. [2022-12-13 02:01:49,473 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 346 places, 764 transitions, 36259 flow [2022-12-13 02:01:49,473 INFO L226 LiptonReduction]: Number of co-enabled transitions 2494 [2022-12-13 02:01:49,476 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:01:49,476 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1050 [2022-12-13 02:01:49,476 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 764 transitions, 36259 flow [2022-12-13 02:01:49,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:49,477 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:49,477 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:49,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-12-13 02:01:49,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:01:49,683 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:49,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:49,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1414411983, now seen corresponding path program 1 times [2022-12-13 02:01:49,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:49,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033550215] [2022-12-13 02:01:49,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:49,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:49,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:49,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033550215] [2022-12-13 02:01:49,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033550215] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:01:49,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491659583] [2022-12-13 02:01:49,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:49,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:01:49,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:01:49,793 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:01:49,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-13 02:01:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:49,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 02:01:49,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:01:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:49,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:01:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:49,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491659583] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:01:49,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:01:49,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-13 02:01:49,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653735439] [2022-12-13 02:01:49,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:01:49,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:01:49,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:49,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:01:49,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:01:49,964 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-13 02:01:49,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 764 transitions, 36259 flow. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:49,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:49,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-13 02:01:49,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:56,394 INFO L130 PetriNetUnfolder]: 4905/10349 cut-off events. [2022-12-13 02:01:56,394 INFO L131 PetriNetUnfolder]: For 1875943/1875943 co-relation queries the response was YES. [2022-12-13 02:01:56,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188635 conditions, 10349 events. 4905/10349 cut-off events. For 1875943/1875943 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 96887 event pairs, 584 based on Foata normal form. 17/10362 useless extension candidates. Maximal degree in co-relation 186679. Up to 4015 conditions per place. [2022-12-13 02:01:56,562 INFO L137 encePairwiseOnDemand]: 28/62 looper letters, 483 selfloop transitions, 461 changer transitions 31/975 dead transitions. [2022-12-13 02:01:56,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 975 transitions, 45488 flow [2022-12-13 02:01:56,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:01:56,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:01:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2022-12-13 02:01:56,563 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28225806451612906 [2022-12-13 02:01:56,563 INFO L175 Difference]: Start difference. First operand has 346 places, 764 transitions, 36259 flow. Second operand 6 states and 105 transitions. [2022-12-13 02:01:56,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 975 transitions, 45488 flow [2022-12-13 02:02:05,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 975 transitions, 44364 flow, removed 542 selfloop flow, removed 5 redundant places. [2022-12-13 02:02:05,937 INFO L231 Difference]: Finished difference. Result has 350 places, 800 transitions, 38813 flow [2022-12-13 02:02:05,938 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=35503, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=764, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=428, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=38813, PETRI_PLACES=350, PETRI_TRANSITIONS=800} [2022-12-13 02:02:05,938 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 330 predicate places. [2022-12-13 02:02:05,938 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:05,939 INFO L89 Accepts]: Start accepts. Operand has 350 places, 800 transitions, 38813 flow [2022-12-13 02:02:05,945 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:05,946 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:05,946 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 350 places, 800 transitions, 38813 flow [2022-12-13 02:02:05,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 350 places, 800 transitions, 38813 flow [2022-12-13 02:02:07,071 INFO L130 PetriNetUnfolder]: 935/3912 cut-off events. [2022-12-13 02:02:07,071 INFO L131 PetriNetUnfolder]: For 520786/520786 co-relation queries the response was YES. [2022-12-13 02:02:07,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64510 conditions, 3912 events. 935/3912 cut-off events. For 520786/520786 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 47489 event pairs, 55 based on Foata normal form. 0/3885 useless extension candidates. Maximal degree in co-relation 63469. Up to 1096 conditions per place. [2022-12-13 02:02:07,190 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 350 places, 800 transitions, 38813 flow [2022-12-13 02:02:07,190 INFO L226 LiptonReduction]: Number of co-enabled transitions 2618 [2022-12-13 02:02:07,194 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:02:07,195 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1257 [2022-12-13 02:02:07,195 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 800 transitions, 38813 flow [2022-12-13 02:02:07,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:07,195 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:07,196 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:07,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-12-13 02:02:07,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:02:07,400 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:07,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:07,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1262292820, now seen corresponding path program 1 times [2022-12-13 02:02:07,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:07,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454446600] [2022-12-13 02:02:07,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:07,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:07,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:02:07,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:07,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454446600] [2022-12-13 02:02:07,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454446600] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:02:07,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213989635] [2022-12-13 02:02:07,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:07,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:02:07,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:02:07,470 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:02:07,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-13 02:02:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:07,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 02:02:07,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:02:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:02:07,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:02:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:02:07,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213989635] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:02:07,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:02:07,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-13 02:02:07,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351165978] [2022-12-13 02:02:07,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:02:07,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:02:07,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:07,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:02:07,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:02:07,636 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-13 02:02:07,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 800 transitions, 38813 flow. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:07,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:07,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-13 02:02:07,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:13,808 INFO L130 PetriNetUnfolder]: 4919/10377 cut-off events. [2022-12-13 02:02:13,809 INFO L131 PetriNetUnfolder]: For 1896216/1896216 co-relation queries the response was YES. [2022-12-13 02:02:13,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189166 conditions, 10377 events. 4919/10377 cut-off events. For 1896216/1896216 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 97448 event pairs, 2333 based on Foata normal form. 32/10405 useless extension candidates. Maximal degree in co-relation 186505. Up to 9636 conditions per place. [2022-12-13 02:02:13,954 INFO L137 encePairwiseOnDemand]: 22/62 looper letters, 704 selfloop transitions, 164 changer transitions 9/877 dead transitions. [2022-12-13 02:02:13,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 877 transitions, 42508 flow [2022-12-13 02:02:13,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 02:02:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 02:02:13,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2022-12-13 02:02:13,955 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14650537634408603 [2022-12-13 02:02:13,955 INFO L175 Difference]: Start difference. First operand has 350 places, 800 transitions, 38813 flow. Second operand 12 states and 109 transitions. [2022-12-13 02:02:13,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 877 transitions, 42508 flow [2022-12-13 02:02:21,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 877 transitions, 41914 flow, removed 228 selfloop flow, removed 3 redundant places. [2022-12-13 02:02:21,662 INFO L231 Difference]: Finished difference. Result has 360 places, 812 transitions, 39204 flow [2022-12-13 02:02:21,663 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=38314, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=800, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=637, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=39204, PETRI_PLACES=360, PETRI_TRANSITIONS=812} [2022-12-13 02:02:21,663 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 340 predicate places. [2022-12-13 02:02:21,663 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:21,663 INFO L89 Accepts]: Start accepts. Operand has 360 places, 812 transitions, 39204 flow [2022-12-13 02:02:21,669 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:21,669 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:21,669 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 360 places, 812 transitions, 39204 flow [2022-12-13 02:02:21,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 360 places, 812 transitions, 39204 flow [2022-12-13 02:02:22,684 INFO L130 PetriNetUnfolder]: 943/3962 cut-off events. [2022-12-13 02:02:22,685 INFO L131 PetriNetUnfolder]: For 485470/485470 co-relation queries the response was YES. [2022-12-13 02:02:22,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63757 conditions, 3962 events. 943/3962 cut-off events. For 485470/485470 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 48283 event pairs, 55 based on Foata normal form. 0/3935 useless extension candidates. Maximal degree in co-relation 62715. Up to 1108 conditions per place. [2022-12-13 02:02:22,771 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 360 places, 812 transitions, 39204 flow [2022-12-13 02:02:22,771 INFO L226 LiptonReduction]: Number of co-enabled transitions 2666 [2022-12-13 02:02:22,909 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:22,909 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:23,048 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [496] $Ultimate##0-->L41-4: Formula: (and (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_641|) (= 5 v_thread1Thread1of1ForFork0_~i~0_368) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_463| (ite (< 0 (mod (+ (* 2 v_~c~0_318) v_~counter~0_910) 4294967296)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_463| 0)) (not (= (ite (< 0 (mod (+ v_~counter~0_910 v_~c~0_318) 4294967296)) 1 0) 0)) (= v_~counter~0_908 (+ v_~counter~0_910 (* 3 v_~c~0_318))) (< (mod (+ 4294967295 v_thread1Thread1of1ForFork0_~i~0_368) 4294967296) (mod v_~N~0_305 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_463| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_463|)) InVars {~counter~0=v_~counter~0_910, ~c~0=v_~c~0_318, ~N~0=v_~N~0_305} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_463|, ~counter~0=v_~counter~0_908, ~c~0=v_~c~0_318, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_271|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_368, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_471|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_463|, ~N~0=v_~N~0_305, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_641|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:02:23,048 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:23,049 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:23,344 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 02:02:23,353 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1690 [2022-12-13 02:02:23,354 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 810 transitions, 39258 flow [2022-12-13 02:02:23,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:23,354 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:23,354 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:23,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-12-13 02:02:23,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-12-13 02:02:23,559 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:23,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:23,560 INFO L85 PathProgramCache]: Analyzing trace with hash -751056452, now seen corresponding path program 1 times [2022-12-13 02:02:23,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:23,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85100660] [2022-12-13 02:02:23,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:23,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:02:23,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:23,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85100660] [2022-12-13 02:02:23,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85100660] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:02:23,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132433625] [2022-12-13 02:02:23,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:23,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:02:23,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:02:23,665 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:02:23,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-13 02:02:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:23,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 02:02:23,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:02:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:02:23,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:02:23,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:02:23,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132433625] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:02:23,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:02:23,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-12-13 02:02:23,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119272980] [2022-12-13 02:02:23,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:02:23,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 02:02:23,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:23,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 02:02:23,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-12-13 02:02:23,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-13 02:02:23,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 810 transitions, 39258 flow. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:23,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:23,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-13 02:02:23,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:34,576 INFO L130 PetriNetUnfolder]: 6684/13712 cut-off events. [2022-12-13 02:02:34,576 INFO L131 PetriNetUnfolder]: For 2725127/2725127 co-relation queries the response was YES. [2022-12-13 02:02:34,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239188 conditions, 13712 events. 6684/13712 cut-off events. For 2725127/2725127 co-relation queries the response was YES. Maximal size of possible extension queue 1110. Compared 131704 event pairs, 768 based on Foata normal form. 998/14704 useless extension candidates. Maximal degree in co-relation 234029. Up to 4882 conditions per place. [2022-12-13 02:02:34,881 INFO L137 encePairwiseOnDemand]: 17/64 looper letters, 535 selfloop transitions, 677 changer transitions 187/1399 dead transitions. [2022-12-13 02:02:34,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 1399 transitions, 63897 flow [2022-12-13 02:02:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 02:02:34,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-12-13 02:02:34,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 254 transitions. [2022-12-13 02:02:34,882 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.10726351351351351 [2022-12-13 02:02:34,882 INFO L175 Difference]: Start difference. First operand has 358 places, 810 transitions, 39258 flow. Second operand 37 states and 254 transitions. [2022-12-13 02:02:34,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 1399 transitions, 63897 flow [2022-12-13 02:02:44,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 1399 transitions, 63279 flow, removed 152 selfloop flow, removed 6 redundant places. [2022-12-13 02:02:44,968 INFO L231 Difference]: Finished difference. Result has 408 places, 1052 transitions, 52212 flow [2022-12-13 02:02:44,969 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=38698, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=810, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=432, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=52212, PETRI_PLACES=408, PETRI_TRANSITIONS=1052} [2022-12-13 02:02:44,969 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 388 predicate places. [2022-12-13 02:02:44,969 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:44,969 INFO L89 Accepts]: Start accepts. Operand has 408 places, 1052 transitions, 52212 flow [2022-12-13 02:02:44,976 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:44,976 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:44,976 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 408 places, 1052 transitions, 52212 flow [2022-12-13 02:02:44,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 402 places, 1052 transitions, 52212 flow [2022-12-13 02:02:46,428 INFO L130 PetriNetUnfolder]: 1263/5020 cut-off events. [2022-12-13 02:02:46,429 INFO L131 PetriNetUnfolder]: For 560851/560851 co-relation queries the response was YES. [2022-12-13 02:02:46,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83117 conditions, 5020 events. 1263/5020 cut-off events. For 560851/560851 co-relation queries the response was YES. Maximal size of possible extension queue 724. Compared 62631 event pairs, 55 based on Foata normal form. 0/5006 useless extension candidates. Maximal degree in co-relation 81356. Up to 1434 conditions per place. [2022-12-13 02:02:46,690 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 402 places, 1052 transitions, 52212 flow [2022-12-13 02:02:46,690 INFO L226 LiptonReduction]: Number of co-enabled transitions 3374 [2022-12-13 02:02:46,691 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [849] $Ultimate##0-->L41-4: Formula: (and (= v_~counter~0_2252 (+ v_~counter~0_2254 (* v_~c~0_752 4))) (= v_thread1Thread1of1ForFork0_~i~0_1243 5) (= (ite (< 0 (mod (+ v_~c~0_752 v_~counter~0_2254) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1197|) (= |v_thread2Thread1of1ForFork1_~i~1#1_1792| 1) (< (mod (+ v_thread1Thread1of1ForFork0_~i~0_1243 4294967295) 4294967296) (mod v_~N~0_739 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1197| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1197| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1197|)) InVars {~counter~0=v_~counter~0_2254, ~c~0=v_~c~0_752, ~N~0=v_~N~0_739} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1197|, ~counter~0=v_~counter~0_2252, ~c~0=v_~c~0_752, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_890|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1243, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1205|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1197|, ~N~0=v_~N~0_739, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1792|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:02:46,691 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:46,692 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:46,816 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:02:46,874 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1209] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ (* v_~c~0_1228 2) v_~counter~0_3706) 4294967296)) 1 0))) (and (= v_thread1Thread1of1ForFork0_~i~0_2205 9) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1936| .cse0) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_2997|) (= (+ (* v_~c~0_1228 4) v_~counter~0_3706) v_~counter~0_3704) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1936| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1936|) (not (= 0 (ite (< 0 (mod (+ v_~c~0_1228 v_~counter~0_3706) 4294967296)) 1 0))) (< (mod (+ v_thread1Thread1of1ForFork0_~i~0_2205 4294967295) 4294967296) (mod v_~N~0_1215 4294967296)) (not (= 0 .cse0)))) InVars {~counter~0=v_~counter~0_3706, ~c~0=v_~c~0_1228, ~N~0=v_~N~0_1215} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1936|, ~counter~0=v_~counter~0_3704, ~c~0=v_~c~0_1228, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1604|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2205, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1944|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1936|, ~N~0=v_~N~0_1215, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2997|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [498] L51-4-->thread1EXIT: Formula: (let ((.cse0 (mod v_~N~0_309 4294967296))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467| 0)) (not (< (mod v_thread1Thread1of1ForFork0_~i~0_376 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_#res.offset_76| 0) (= v_~counter~0_921 (+ v_~counter~0_920 v_~c~0_322)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_646| 4294967296) .cse0) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_646| 1) |v_thread2Thread1of1ForFork1_~i~1#1_645|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467| (ite (< 0 (mod v_~counter~0_921 4294967296)) 1 0)) (= |v_thread1Thread1of1ForFork0_#res.base_76| 0))) InVars {~counter~0=v_~counter~0_921, ~c~0=v_~c~0_322, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_376, ~N~0=v_~N~0_309, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_646|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467|, ~counter~0=v_~counter~0_920, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_76|, ~c~0=v_~c~0_322, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_376, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_76|, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_475|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467|, ~N~0=v_~N~0_309, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_645|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:02:46,874 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:46,874 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:47,128 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:47,129 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:47,365 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1209] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ (* v_~c~0_1228 2) v_~counter~0_3706) 4294967296)) 1 0))) (and (= v_thread1Thread1of1ForFork0_~i~0_2205 9) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1936| .cse0) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_2997|) (= (+ (* v_~c~0_1228 4) v_~counter~0_3706) v_~counter~0_3704) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1936| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1936|) (not (= 0 (ite (< 0 (mod (+ v_~c~0_1228 v_~counter~0_3706) 4294967296)) 1 0))) (< (mod (+ v_thread1Thread1of1ForFork0_~i~0_2205 4294967295) 4294967296) (mod v_~N~0_1215 4294967296)) (not (= 0 .cse0)))) InVars {~counter~0=v_~counter~0_3706, ~c~0=v_~c~0_1228, ~N~0=v_~N~0_1215} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1936|, ~counter~0=v_~counter~0_3704, ~c~0=v_~c~0_1228, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1604|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2205, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1944|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1936|, ~N~0=v_~N~0_1215, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2997|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [500] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_311 4294967296))) (and (not (= (ite (< 0 (mod v_~counter~0_926 4294967296)) 1 0) 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_651|) |v_thread2Thread1of1ForFork1_~i~1#1_649|) (= v_~counter~0_926 (+ v_~counter~0_924 (* 2 v_~c~0_324))) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_651| 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_649|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_469| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_469|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_469| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_469| (ite (< 0 (mod (+ v_~counter~0_924 v_~c~0_324) 4294967296)) 1 0)))) InVars {~counter~0=v_~counter~0_926, ~c~0=v_~c~0_324, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_651|, ~N~0=v_~N~0_311} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_469|, ~counter~0=v_~counter~0_924, ~c~0=v_~c~0_324, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_477|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_469|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_649|, ~N~0=v_~N~0_311} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:02:47,365 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:47,365 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:47,629 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1209] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ (* v_~c~0_1228 2) v_~counter~0_3706) 4294967296)) 1 0))) (and (= v_thread1Thread1of1ForFork0_~i~0_2205 9) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1936| .cse0) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_2997|) (= (+ (* v_~c~0_1228 4) v_~counter~0_3706) v_~counter~0_3704) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1936| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1936|) (not (= 0 (ite (< 0 (mod (+ v_~c~0_1228 v_~counter~0_3706) 4294967296)) 1 0))) (< (mod (+ v_thread1Thread1of1ForFork0_~i~0_2205 4294967295) 4294967296) (mod v_~N~0_1215 4294967296)) (not (= 0 .cse0)))) InVars {~counter~0=v_~counter~0_3706, ~c~0=v_~c~0_1228, ~N~0=v_~N~0_1215} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1936|, ~counter~0=v_~counter~0_3704, ~c~0=v_~c~0_1228, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1604|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2205, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1944|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1936|, ~N~0=v_~N~0_1215, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2997|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:02:47,630 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:47,630 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:47,831 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:47,831 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:47,953 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [848] $Ultimate##0-->L51-4: Formula: (and (= (+ (* 3 v_~c~0_750) v_~counter~0_2248) v_~counter~0_2246) (< 4 (mod v_~N~0_737 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1195| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1195|) (not (= (ite (< 0 (mod (+ (* v_~c~0_750 4) v_~counter~0_2248) 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_1239 5) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_1790|) (= (ite (< 0 (mod (+ v_~c~0_750 v_~counter~0_2246) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1195|)) InVars {~counter~0=v_~counter~0_2248, ~c~0=v_~c~0_750, ~N~0=v_~N~0_737} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1195|, ~counter~0=v_~counter~0_2246, ~c~0=v_~c~0_750, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_886|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1239, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1203|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1195|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1790|, ~N~0=v_~N~0_737} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 02:02:48,041 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [850] $Ultimate##0-->L41-4: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1199| (ite (< 0 (mod (+ (* 4294967295 v_~c~0_754) v_~counter~0_2258) 4294967296)) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_1794| 1) (= v_thread1Thread1of1ForFork0_~i~0_1247 5) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1199| 0)) (< (mod (+ v_thread1Thread1of1ForFork0_~i~0_1247 4294967295) 4294967296) (mod v_~N~0_741 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1199| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1199|) (= (+ (* v_~c~0_754 4) v_~counter~0_2260) v_~counter~0_2258)) InVars {~counter~0=v_~counter~0_2260, ~c~0=v_~c~0_754, ~N~0=v_~N~0_741} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1199|, ~counter~0=v_~counter~0_2258, ~c~0=v_~c~0_754, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_894|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1247, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1207|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1199|, ~N~0=v_~N~0_741, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1794|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:02:48,042 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:48,042 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:48,160 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1217] L41-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_1225 4294967296))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1955| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1955| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1955|) (= v_thread1Thread1of1ForFork0_~i~0_2223 (+ v_thread1Thread1of1ForFork0_~i~0_2224 1)) (= v_~counter~0_3741 v_~counter~0_3739) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_3021| 1) |v_thread2Thread1of1ForFork1_~i~1#1_3020|) (< (mod v_thread1Thread1of1ForFork0_~i~0_2224 4294967296) .cse0) (= (ite (< 0 (mod (+ v_~c~0_1238 v_~counter~0_3741) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1955|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_3021| 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_3741, ~c~0=v_~c~0_1238, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2224, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3021|, ~N~0=v_~N~0_1225} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1955|, ~counter~0=v_~counter~0_3739, ~c~0=v_~c~0_1238, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1619|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2223, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1963|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1955|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3020|, ~N~0=v_~N~0_1225} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 02:02:48,247 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1206] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (+ v_~counter~0_3669 (* v_~c~0_1224 2)))) (and (= 7 |v_thread2Thread1of1ForFork1_~i~1#1_2965|) (not (= (ite (< 0 (mod .cse0 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1911| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1911|) (= (ite (< 0 (mod (+ (* v_~c~0_1224 3) v_~counter~0_3669) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1911|) (= .cse0 v_~counter~0_3667) (< 8 (mod v_~N~0_1211 4294967296)) (not (= (ite (< 0 (mod (+ v_~c~0_1224 v_~counter~0_3669) 4294967296)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1911| 0)) (= v_thread1Thread1of1ForFork0_~i~0_2189 9))) InVars {~counter~0=v_~counter~0_3669, ~c~0=v_~c~0_1224, ~N~0=v_~N~0_1211} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1911|, ~counter~0=v_~counter~0_3667, ~c~0=v_~c~0_1224, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1588|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2189, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1919|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1911|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_2965|, ~N~0=v_~N~0_1211} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [1231] L41-4-->L41-4: Formula: (let ((.cse0 (+ v_~c~0_1254 v_~counter~0_3789)) (.cse1 (mod v_~N~0_1241 4294967296))) (and (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_3051| 1) |v_thread2Thread1of1ForFork1_~i~1#1_3050|) (= (ite (< 0 (mod .cse0 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1983|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1983| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_3051| 4294967296) .cse1) (= v_~counter~0_3787 .cse0) (= v_thread1Thread1of1ForFork0_~i~0_2243 (+ v_thread1Thread1of1ForFork0_~i~0_2245 2)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1983| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1983|) (< (mod v_thread1Thread1of1ForFork0_~i~0_2245 4294967296) .cse1) (< (mod (+ v_thread1Thread1of1ForFork0_~i~0_2243 4294967295) 4294967296) .cse1))) InVars {~counter~0=v_~counter~0_3789, ~c~0=v_~c~0_1254, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2245, ~N~0=v_~N~0_1241, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3051|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1983|, ~counter~0=v_~counter~0_3787, ~c~0=v_~c~0_1254, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1637|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2243, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1991|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1983|, ~N~0=v_~N~0_1241, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3050|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:02:48,248 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:48,248 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:48,510 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:02:48,557 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:02:48,634 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:48,634 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:02:48,732 INFO L241 LiptonReduction]: Total number of compositions: 9 [2022-12-13 02:02:48,732 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3763 [2022-12-13 02:02:48,732 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 1048 transitions, 52361 flow [2022-12-13 02:02:48,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:48,733 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:48,733 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:48,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-12-13 02:02:48,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-12-13 02:02:48,942 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:48,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:48,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1046853135, now seen corresponding path program 1 times [2022-12-13 02:02:48,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:48,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562205356] [2022-12-13 02:02:48,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:48,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:02:49,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:49,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562205356] [2022-12-13 02:02:49,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562205356] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:02:49,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446878826] [2022-12-13 02:02:49,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:49,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:02:49,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:02:49,030 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:02:49,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-13 02:02:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:49,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:02:49,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:02:49,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:02:49,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:02:49,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:02:49,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446878826] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:02:49,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:02:49,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 02:02:49,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82476892] [2022-12-13 02:02:49,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:02:49,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 02:02:49,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:49,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 02:02:49,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-12-13 02:02:49,179 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-13 02:02:49,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 1048 transitions, 52361 flow. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:49,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:49,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-13 02:02:49,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:56,975 INFO L130 PetriNetUnfolder]: 6280/12978 cut-off events. [2022-12-13 02:02:56,976 INFO L131 PetriNetUnfolder]: For 2001938/2001938 co-relation queries the response was YES. [2022-12-13 02:02:57,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235884 conditions, 12978 events. 6280/12978 cut-off events. For 2001938/2001938 co-relation queries the response was YES. Maximal size of possible extension queue 1027. Compared 123896 event pairs, 2693 based on Foata normal form. 4/12978 useless extension candidates. Maximal degree in co-relation 230911. Up to 11878 conditions per place. [2022-12-13 02:02:57,205 INFO L137 encePairwiseOnDemand]: 23/72 looper letters, 904 selfloop transitions, 213 changer transitions 11/1128 dead transitions. [2022-12-13 02:02:57,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 1128 transitions, 57050 flow [2022-12-13 02:02:57,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 02:02:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 02:02:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2022-12-13 02:02:57,206 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.15416666666666667 [2022-12-13 02:02:57,206 INFO L175 Difference]: Start difference. First operand has 397 places, 1048 transitions, 52361 flow. Second operand 10 states and 111 transitions. [2022-12-13 02:02:57,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 1128 transitions, 57050 flow [2022-12-13 02:03:10,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 1128 transitions, 53835 flow, removed 1458 selfloop flow, removed 13 redundant places. [2022-12-13 02:03:10,463 INFO L231 Difference]: Finished difference. Result has 395 places, 1057 transitions, 50440 flow [2022-12-13 02:03:10,464 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=49360, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1048, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=837, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=50440, PETRI_PLACES=395, PETRI_TRANSITIONS=1057} [2022-12-13 02:03:10,465 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 375 predicate places. [2022-12-13 02:03:10,465 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:10,465 INFO L89 Accepts]: Start accepts. Operand has 395 places, 1057 transitions, 50440 flow [2022-12-13 02:03:10,472 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:10,473 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:10,473 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 395 places, 1057 transitions, 50440 flow [2022-12-13 02:03:10,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 393 places, 1057 transitions, 50440 flow [2022-12-13 02:03:12,158 INFO L130 PetriNetUnfolder]: 1273/5058 cut-off events. [2022-12-13 02:03:12,158 INFO L131 PetriNetUnfolder]: For 542620/542620 co-relation queries the response was YES. [2022-12-13 02:03:12,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80648 conditions, 5058 events. 1273/5058 cut-off events. For 542620/542620 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 63230 event pairs, 55 based on Foata normal form. 0/5039 useless extension candidates. Maximal degree in co-relation 80418. Up to 1357 conditions per place. [2022-12-13 02:03:12,274 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 393 places, 1057 transitions, 50440 flow [2022-12-13 02:03:12,274 INFO L226 LiptonReduction]: Number of co-enabled transitions 3408 [2022-12-13 02:03:12,281 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:03:12,281 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:03:12,353 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:03:12,353 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:03:12,438 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:12,448 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1983 [2022-12-13 02:03:12,448 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 1056 transitions, 50471 flow [2022-12-13 02:03:12,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:12,448 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:12,448 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:12,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-12-13 02:03:12,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-12-13 02:03:12,652 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:12,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:12,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1088869248, now seen corresponding path program 1 times [2022-12-13 02:03:12,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:12,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675730978] [2022-12-13 02:03:12,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:12,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:12,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:12,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:12,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675730978] [2022-12-13 02:03:12,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675730978] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:03:12,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606292749] [2022-12-13 02:03:12,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:12,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:03:12,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:03:12,750 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:03:12,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-13 02:03:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:12,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 02:03:12,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:03:12,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:12,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:03:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:12,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606292749] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:03:12,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:03:12,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 02:03:12,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227528772] [2022-12-13 02:03:12,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:03:12,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:03:12,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:12,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:03:12,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:03:12,913 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-13 02:03:12,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 1056 transitions, 50471 flow. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:12,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:12,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-13 02:03:12,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:21,296 INFO L130 PetriNetUnfolder]: 6500/13382 cut-off events. [2022-12-13 02:03:21,296 INFO L131 PetriNetUnfolder]: For 1972947/1972947 co-relation queries the response was YES. [2022-12-13 02:03:21,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233174 conditions, 13382 events. 6500/13382 cut-off events. For 1972947/1972947 co-relation queries the response was YES. Maximal size of possible extension queue 1068. Compared 128077 event pairs, 2692 based on Foata normal form. 82/13460 useless extension candidates. Maximal degree in co-relation 232847. Up to 11973 conditions per place. [2022-12-13 02:03:21,506 INFO L137 encePairwiseOnDemand]: 23/73 looper letters, 931 selfloop transitions, 256 changer transitions 11/1198 dead transitions. [2022-12-13 02:03:21,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 1198 transitions, 57687 flow [2022-12-13 02:03:21,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 02:03:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 02:03:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2022-12-13 02:03:21,507 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16164383561643836 [2022-12-13 02:03:21,507 INFO L175 Difference]: Start difference. First operand has 392 places, 1056 transitions, 50471 flow. Second operand 10 states and 118 transitions. [2022-12-13 02:03:21,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 1198 transitions, 57687 flow [2022-12-13 02:03:32,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 1198 transitions, 57332 flow, removed 69 selfloop flow, removed 8 redundant places. [2022-12-13 02:03:32,451 INFO L231 Difference]: Finished difference. Result has 395 places, 1107 transitions, 53234 flow [2022-12-13 02:03:32,451 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=50137, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1056, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=208, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=811, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=53234, PETRI_PLACES=395, PETRI_TRANSITIONS=1107} [2022-12-13 02:03:32,452 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 375 predicate places. [2022-12-13 02:03:32,452 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:32,452 INFO L89 Accepts]: Start accepts. Operand has 395 places, 1107 transitions, 53234 flow [2022-12-13 02:03:32,456 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:32,457 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:32,457 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 395 places, 1107 transitions, 53234 flow [2022-12-13 02:03:32,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 395 places, 1107 transitions, 53234 flow [2022-12-13 02:03:34,113 INFO L130 PetriNetUnfolder]: 1322/5223 cut-off events. [2022-12-13 02:03:34,113 INFO L131 PetriNetUnfolder]: For 571656/571656 co-relation queries the response was YES. [2022-12-13 02:03:34,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83759 conditions, 5223 events. 1322/5223 cut-off events. For 571656/571656 co-relation queries the response was YES. Maximal size of possible extension queue 752. Compared 65581 event pairs, 55 based on Foata normal form. 0/5206 useless extension candidates. Maximal degree in co-relation 82073. Up to 1412 conditions per place. [2022-12-13 02:03:34,231 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 395 places, 1107 transitions, 53234 flow [2022-12-13 02:03:34,231 INFO L226 LiptonReduction]: Number of co-enabled transitions 3612 [2022-12-13 02:03:34,233 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:03:34,233 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:03:34,503 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1233] $Ultimate##0-->L41-4: Formula: (let ((.cse1 (+ (* v_~c~0_1256 3) v_~counter~0_3795))) (let ((.cse0 (ite (< 0 (mod .cse1 4294967296)) 1 0))) (and (not (= (ite (< 0 (mod (+ v_~counter~0_3795 (* v_~c~0_1256 2)) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_3054| 8) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1985|) (not (= .cse0 0)) (= v_thread1Thread1of1ForFork0_~i~0_2249 11) (= .cse1 v_~counter~0_3793) (not (= (ite (< 0 (mod (+ v_~c~0_1256 v_~counter~0_3795) 4294967296)) 1 0) 0)) (< (mod (+ v_thread1Thread1of1ForFork0_~i~0_2249 4294967295) 4294967296) (mod v_~N~0_1243 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1985| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1985|)))) InVars {~counter~0=v_~counter~0_3795, ~c~0=v_~c~0_1256, ~N~0=v_~N~0_1243} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1985|, ~counter~0=v_~counter~0_3793, ~c~0=v_~c~0_1256, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1641|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2249, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1993|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1985|, ~N~0=v_~N~0_1243, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3054|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [1244] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_1257 4294967296))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_3094|) 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2011| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2011| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2011|) (= |v_thread2Thread1of1ForFork1_~i~1#1_3094| (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_3096|)) (= (ite (< 0 (mod (+ v_~c~0_1270 v_~counter~0_3841) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2011|) (not (= (ite (< 0 (mod v_~counter~0_3843 4294967296)) 1 0) 0)) (= (+ (* v_~c~0_1270 2) v_~counter~0_3841) v_~counter~0_3843) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_3096| 4294967296) .cse0))) InVars {~counter~0=v_~counter~0_3843, ~c~0=v_~c~0_1270, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3096|, ~N~0=v_~N~0_1257} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2011|, ~counter~0=v_~counter~0_3841, ~c~0=v_~c~0_1270, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_2019|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2011|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3094|, ~N~0=v_~N~0_1257} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:03:34,504 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:03:34,504 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:03:34,768 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1233] $Ultimate##0-->L41-4: Formula: (let ((.cse1 (+ (* v_~c~0_1256 3) v_~counter~0_3795))) (let ((.cse0 (ite (< 0 (mod .cse1 4294967296)) 1 0))) (and (not (= (ite (< 0 (mod (+ v_~counter~0_3795 (* v_~c~0_1256 2)) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_3054| 8) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1985|) (not (= .cse0 0)) (= v_thread1Thread1of1ForFork0_~i~0_2249 11) (= .cse1 v_~counter~0_3793) (not (= (ite (< 0 (mod (+ v_~c~0_1256 v_~counter~0_3795) 4294967296)) 1 0) 0)) (< (mod (+ v_thread1Thread1of1ForFork0_~i~0_2249 4294967295) 4294967296) (mod v_~N~0_1243 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1985| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1985|)))) InVars {~counter~0=v_~counter~0_3795, ~c~0=v_~c~0_1256, ~N~0=v_~N~0_1243} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1985|, ~counter~0=v_~counter~0_3793, ~c~0=v_~c~0_1256, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1641|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2249, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1993|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1985|, ~N~0=v_~N~0_1243, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3054|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:03:34,768 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:03:34,768 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:03:35,007 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:03:35,008 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2556 [2022-12-13 02:03:35,008 INFO L495 AbstractCegarLoop]: Abstraction has has 394 places, 1106 transitions, 53261 flow [2022-12-13 02:03:35,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:35,008 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:35,008 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:35,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-12-13 02:03:35,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:03:35,210 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:35,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:35,211 INFO L85 PathProgramCache]: Analyzing trace with hash -334145854, now seen corresponding path program 1 times [2022-12-13 02:03:35,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:35,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743189348] [2022-12-13 02:03:35,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:35,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:35,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:35,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743189348] [2022-12-13 02:03:35,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743189348] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:03:35,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18843677] [2022-12-13 02:03:35,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:35,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:03:35,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:03:35,323 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:03:35,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-13 02:03:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:35,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 02:03:35,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:03:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:35,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:03:35,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:35,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18843677] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:03:35,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:03:35,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-12-13 02:03:35,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129844094] [2022-12-13 02:03:35,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:03:35,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:03:35,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:35,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:03:35,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:03:35,489 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-13 02:03:35,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 1106 transitions, 53261 flow. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:35,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:35,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-13 02:03:35,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:43,843 INFO L130 PetriNetUnfolder]: 6502/13393 cut-off events. [2022-12-13 02:03:43,843 INFO L131 PetriNetUnfolder]: For 1915599/1915599 co-relation queries the response was YES. [2022-12-13 02:03:43,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235460 conditions, 13393 events. 6502/13393 cut-off events. For 1915599/1915599 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 127338 event pairs, 1098 based on Foata normal form. 5/13394 useless extension candidates. Maximal degree in co-relation 230609. Up to 13299 conditions per place. [2022-12-13 02:03:44,065 INFO L137 encePairwiseOnDemand]: 35/74 looper letters, 1067 selfloop transitions, 51 changer transitions 11/1129 dead transitions. [2022-12-13 02:03:44,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 1129 transitions, 55943 flow [2022-12-13 02:03:44,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:44,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:44,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2022-12-13 02:03:44,069 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26756756756756755 [2022-12-13 02:03:44,069 INFO L175 Difference]: Start difference. First operand has 394 places, 1106 transitions, 53261 flow. Second operand 5 states and 99 transitions. [2022-12-13 02:03:44,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 1129 transitions, 55943 flow [2022-12-13 02:03:56,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 1129 transitions, 55619 flow, removed 135 selfloop flow, removed 3 redundant places. [2022-12-13 02:03:56,342 INFO L231 Difference]: Finished difference. Result has 398 places, 1108 transitions, 53218 flow [2022-12-13 02:03:56,342 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=52937, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1055, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=53218, PETRI_PLACES=398, PETRI_TRANSITIONS=1108} [2022-12-13 02:03:56,343 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 378 predicate places. [2022-12-13 02:03:56,343 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:56,343 INFO L89 Accepts]: Start accepts. Operand has 398 places, 1108 transitions, 53218 flow [2022-12-13 02:03:56,355 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:56,356 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:56,356 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 398 places, 1108 transitions, 53218 flow [2022-12-13 02:03:56,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 398 places, 1108 transitions, 53218 flow [2022-12-13 02:03:58,202 INFO L130 PetriNetUnfolder]: 1322/5211 cut-off events. [2022-12-13 02:03:58,202 INFO L131 PetriNetUnfolder]: For 574989/574989 co-relation queries the response was YES. [2022-12-13 02:03:58,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84094 conditions, 5211 events. 1322/5211 cut-off events. For 574989/574989 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 65145 event pairs, 55 based on Foata normal form. 0/5193 useless extension candidates. Maximal degree in co-relation 82306. Up to 1414 conditions per place. [2022-12-13 02:03:58,332 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 398 places, 1108 transitions, 53218 flow [2022-12-13 02:03:58,333 INFO L226 LiptonReduction]: Number of co-enabled transitions 3610 [2022-12-13 02:03:58,343 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:03:58,344 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:03:59,440 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:59,440 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3097 [2022-12-13 02:03:59,440 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 1107 transitions, 53206 flow [2022-12-13 02:03:59,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:59,440 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:59,440 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:59,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-12-13 02:03:59,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-12-13 02:03:59,645 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:59,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:59,645 INFO L85 PathProgramCache]: Analyzing trace with hash 149302693, now seen corresponding path program 1 times [2022-12-13 02:03:59,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:59,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858611041] [2022-12-13 02:03:59,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:59,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:59,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:59,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858611041] [2022-12-13 02:03:59,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858611041] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:03:59,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428616759] [2022-12-13 02:03:59,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:59,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:03:59,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:03:59,761 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:03:59,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-13 02:03:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:59,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 02:03:59,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:03:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:59,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:03:59,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:59,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428616759] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:03:59,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:03:59,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2022-12-13 02:03:59,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328779113] [2022-12-13 02:03:59,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:03:59,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:03:59,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:59,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:03:59,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:03:59,910 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-13 02:03:59,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 1107 transitions, 53206 flow. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:59,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:59,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-13 02:03:59,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:09,591 INFO L130 PetriNetUnfolder]: 6729/13888 cut-off events. [2022-12-13 02:04:09,591 INFO L131 PetriNetUnfolder]: For 2056912/2056912 co-relation queries the response was YES. [2022-12-13 02:04:09,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244950 conditions, 13888 events. 6729/13888 cut-off events. For 2056912/2056912 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 133663 event pairs, 1088 based on Foata normal form. 12/13896 useless extension candidates. Maximal degree in co-relation 240493. Up to 11122 conditions per place. [2022-12-13 02:04:09,821 INFO L137 encePairwiseOnDemand]: 34/72 looper letters, 902 selfloop transitions, 294 changer transitions 33/1229 dead transitions. [2022-12-13 02:04:09,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 1229 transitions, 59619 flow [2022-12-13 02:04:09,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:09,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:09,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-12-13 02:04:09,822 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28055555555555556 [2022-12-13 02:04:09,822 INFO L175 Difference]: Start difference. First operand has 397 places, 1107 transitions, 53206 flow. Second operand 5 states and 101 transitions. [2022-12-13 02:04:09,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 1229 transitions, 59619 flow [2022-12-13 02:04:24,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 1229 transitions, 59438 flow, removed 53 selfloop flow, removed 2 redundant places. [2022-12-13 02:04:24,130 INFO L231 Difference]: Finished difference. Result has 402 places, 1137 transitions, 55464 flow [2022-12-13 02:04:24,131 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=53037, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=266, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=817, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=55464, PETRI_PLACES=402, PETRI_TRANSITIONS=1137} [2022-12-13 02:04:24,133 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 382 predicate places. [2022-12-13 02:04:24,133 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:24,134 INFO L89 Accepts]: Start accepts. Operand has 402 places, 1137 transitions, 55464 flow [2022-12-13 02:04:24,140 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:24,140 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:24,140 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 402 places, 1137 transitions, 55464 flow [2022-12-13 02:04:24,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 402 places, 1137 transitions, 55464 flow [2022-12-13 02:04:25,960 INFO L130 PetriNetUnfolder]: 1366/5408 cut-off events. [2022-12-13 02:04:25,961 INFO L131 PetriNetUnfolder]: For 621445/621452 co-relation queries the response was YES. [2022-12-13 02:04:26,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88276 conditions, 5408 events. 1366/5408 cut-off events. For 621445/621452 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 68203 event pairs, 73 based on Foata normal form. 0/5388 useless extension candidates. Maximal degree in co-relation 86673. Up to 1498 conditions per place. [2022-12-13 02:04:26,086 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 402 places, 1137 transitions, 55464 flow [2022-12-13 02:04:26,086 INFO L226 LiptonReduction]: Number of co-enabled transitions 3684 [2022-12-13 02:04:26,094 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:04:26,098 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1965 [2022-12-13 02:04:26,098 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 1137 transitions, 55464 flow [2022-12-13 02:04:26,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:26,099 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:26,099 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:26,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-12-13 02:04:26,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-12-13 02:04:26,305 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:26,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:26,311 INFO L85 PathProgramCache]: Analyzing trace with hash 556226191, now seen corresponding path program 1 times [2022-12-13 02:04:26,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:26,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869204794] [2022-12-13 02:04:26,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:26,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:26,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:26,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869204794] [2022-12-13 02:04:26,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869204794] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:04:26,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264454258] [2022-12-13 02:04:26,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:26,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:04:26,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:04:26,572 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:04:26,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-13 02:04:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:26,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:04:26,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:04:26,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:26,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:04:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:26,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264454258] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:04:26,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:04:26,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 02:04:26,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049776971] [2022-12-13 02:04:26,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:04:26,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:04:26,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:26,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:04:26,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:04:26,704 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-13 02:04:26,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 1137 transitions, 55464 flow. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:26,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:26,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-13 02:04:26,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:35,412 INFO L130 PetriNetUnfolder]: 6717/13871 cut-off events. [2022-12-13 02:04:35,412 INFO L131 PetriNetUnfolder]: For 2093359/2093359 co-relation queries the response was YES. [2022-12-13 02:04:35,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246875 conditions, 13871 events. 6717/13871 cut-off events. For 2093359/2093359 co-relation queries the response was YES. Maximal size of possible extension queue 1106. Compared 133861 event pairs, 3094 based on Foata normal form. 4/13871 useless extension candidates. Maximal degree in co-relation 242065. Up to 13319 conditions per place. [2022-12-13 02:04:35,733 INFO L137 encePairwiseOnDemand]: 22/72 looper letters, 1023 selfloop transitions, 148 changer transitions 11/1182 dead transitions. [2022-12-13 02:04:35,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 1182 transitions, 58858 flow [2022-12-13 02:04:35,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:04:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:04:35,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2022-12-13 02:04:35,734 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16358024691358025 [2022-12-13 02:04:35,734 INFO L175 Difference]: Start difference. First operand has 402 places, 1137 transitions, 55464 flow. Second operand 9 states and 106 transitions. [2022-12-13 02:04:35,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 1182 transitions, 58858 flow [2022-12-13 02:04:50,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 1182 transitions, 58812 flow, removed 23 selfloop flow, removed 0 redundant places. [2022-12-13 02:04:50,596 INFO L231 Difference]: Finished difference. Result has 412 places, 1141 transitions, 56017 flow [2022-12-13 02:04:50,597 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=55418, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=990, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=56017, PETRI_PLACES=412, PETRI_TRANSITIONS=1141} [2022-12-13 02:04:50,597 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 392 predicate places. [2022-12-13 02:04:50,597 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:50,597 INFO L89 Accepts]: Start accepts. Operand has 412 places, 1141 transitions, 56017 flow [2022-12-13 02:04:50,607 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:50,608 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:50,608 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 412 places, 1141 transitions, 56017 flow [2022-12-13 02:04:50,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 412 places, 1141 transitions, 56017 flow [2022-12-13 02:04:52,361 INFO L130 PetriNetUnfolder]: 1368/5423 cut-off events. [2022-12-13 02:04:52,361 INFO L131 PetriNetUnfolder]: For 629585/629592 co-relation queries the response was YES. [2022-12-13 02:04:52,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88947 conditions, 5423 events. 1368/5423 cut-off events. For 629585/629592 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 68475 event pairs, 72 based on Foata normal form. 0/5404 useless extension candidates. Maximal degree in co-relation 87123. Up to 1499 conditions per place. [2022-12-13 02:04:52,489 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 412 places, 1141 transitions, 56017 flow [2022-12-13 02:04:52,489 INFO L226 LiptonReduction]: Number of co-enabled transitions 3696 [2022-12-13 02:04:52,777 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1214] $Ultimate##0-->L41-4: Formula: (and (< 5 (mod v_~N~0_1221 4294967296)) (= (ite (< 0 (mod (+ v_~counter~0_3724 (* v_~c~0_1234 2)) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1946|) (= (+ (* v_~c~0_1234 4) v_~counter~0_3724) v_~counter~0_3722) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1946| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1946|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1946| 0)) (= v_thread1Thread1of1ForFork0_~i~0_2213 6) (not (= (ite (< 0 (mod (+ v_~c~0_1234 v_~counter~0_3724) 4294967296)) 1 0) 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_3009|)) InVars {~counter~0=v_~counter~0_3724, ~c~0=v_~c~0_1234, ~N~0=v_~N~0_1221} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1946|, ~counter~0=v_~counter~0_3722, ~c~0=v_~c~0_1234, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1610|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2213, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1954|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1946|, ~N~0=v_~N~0_1221, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3009|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:04:52,777 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:04:52,777 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:04:53,064 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:04:53,065 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2468 [2022-12-13 02:04:53,065 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 1140 transitions, 56115 flow [2022-12-13 02:04:53,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:53,065 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:53,065 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:53,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-12-13 02:04:53,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:04:53,270 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:53,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:53,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1820060701, now seen corresponding path program 1 times [2022-12-13 02:04:53,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:53,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954322197] [2022-12-13 02:04:53,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:53,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:53,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:53,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:53,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954322197] [2022-12-13 02:04:53,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954322197] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:04:53,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059976925] [2022-12-13 02:04:53,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:53,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:04:53,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:04:53,360 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:04:53,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-12-13 02:04:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:53,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:04:53,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:04:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:53,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:04:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:53,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059976925] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:04:53,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:04:53,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 02:04:53,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992107254] [2022-12-13 02:04:53,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:04:53,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:04:53,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:53,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:04:53,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:04:53,514 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-13 02:04:53,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 1140 transitions, 56115 flow. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:53,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:53,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-13 02:04:53,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:03,237 INFO L130 PetriNetUnfolder]: 7135/14777 cut-off events. [2022-12-13 02:05:03,237 INFO L131 PetriNetUnfolder]: For 2386401/2386401 co-relation queries the response was YES. [2022-12-13 02:05:03,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263929 conditions, 14777 events. 7135/14777 cut-off events. For 2386401/2386401 co-relation queries the response was YES. Maximal size of possible extension queue 1174. Compared 143814 event pairs, 1522 based on Foata normal form. 108/14879 useless extension candidates. Maximal degree in co-relation 258520. Up to 6519 conditions per place. [2022-12-13 02:05:03,473 INFO L137 encePairwiseOnDemand]: 24/74 looper letters, 374 selfloop transitions, 889 changer transitions 10/1273 dead transitions. [2022-12-13 02:05:03,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 1273 transitions, 63098 flow [2022-12-13 02:05:03,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 02:05:03,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 02:05:03,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2022-12-13 02:05:03,474 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.20270270270270271 [2022-12-13 02:05:03,474 INFO L175 Difference]: Start difference. First operand has 411 places, 1140 transitions, 56115 flow. Second operand 8 states and 120 transitions. [2022-12-13 02:05:03,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 1273 transitions, 63098 flow [2022-12-13 02:05:16,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 1273 transitions, 62874 flow, removed 34 selfloop flow, removed 3 redundant places. [2022-12-13 02:05:16,981 INFO L231 Difference]: Finished difference. Result has 418 places, 1210 transitions, 62178 flow [2022-12-13 02:05:16,982 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=55891, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=828, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=62178, PETRI_PLACES=418, PETRI_TRANSITIONS=1210} [2022-12-13 02:05:16,982 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 398 predicate places. [2022-12-13 02:05:16,982 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:16,982 INFO L89 Accepts]: Start accepts. Operand has 418 places, 1210 transitions, 62178 flow [2022-12-13 02:05:16,997 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:16,997 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:16,997 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 418 places, 1210 transitions, 62178 flow [2022-12-13 02:05:17,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 417 places, 1210 transitions, 62178 flow [2022-12-13 02:05:19,017 INFO L130 PetriNetUnfolder]: 1448/5794 cut-off events. [2022-12-13 02:05:19,017 INFO L131 PetriNetUnfolder]: For 724796/724800 co-relation queries the response was YES. [2022-12-13 02:05:19,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97890 conditions, 5794 events. 1448/5794 cut-off events. For 724796/724800 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 74284 event pairs, 80 based on Foata normal form. 0/5771 useless extension candidates. Maximal degree in co-relation 97561. Up to 1655 conditions per place. [2022-12-13 02:05:19,151 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 417 places, 1210 transitions, 62178 flow [2022-12-13 02:05:19,151 INFO L226 LiptonReduction]: Number of co-enabled transitions 3958 [2022-12-13 02:05:19,152 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:05:19,213 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1246] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (+ v_~c~0_1272 v_~counter~0_3849))) (and (= |v_thread2Thread1of1ForFork1_~i~1#1_3100| 10) (= (ite (< 0 (mod (+ v_~c~0_1272 v_~counter~0_3847) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2015|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2015| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2015|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2015| 0)) (= v_thread1Thread1of1ForFork0_~i~0_2271 11) (not (= (ite (< 0 (mod (+ v_~counter~0_3849 (* v_~c~0_1272 3)) 4294967296)) 1 0) 0)) (= .cse0 v_~counter~0_3847) (< (mod (+ v_thread1Thread1of1ForFork0_~i~0_2271 4294967295) 4294967296) (mod v_~N~0_1259 4294967296)) (not (= (ite (< 0 (mod .cse0 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_3849, ~c~0=v_~c~0_1272, ~N~0=v_~N~0_1259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2015|, ~counter~0=v_~counter~0_3847, ~c~0=v_~c~0_1272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1655|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2271, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_2023|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2015|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3100|, ~N~0=v_~N~0_1259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 02:05:19,434 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:05:19,434 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:05:19,710 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1258] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (+ (* v_~c~0_1290 2) v_~counter~0_3921))) (and (= v_~counter~0_3919 .cse0) (= |v_thread2Thread1of1ForFork1_~i~1#1_3144| 10) (not (= (ite (< 0 (mod (+ v_~c~0_1290 v_~counter~0_3921) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2053| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2053|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2053| 0)) (< (mod (+ v_thread1Thread1of1ForFork0_~i~0_2307 4294967295) 4294967296) (mod v_~N~0_1277 4294967296)) (= v_thread1Thread1of1ForFork0_~i~0_2307 12) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2053| (ite (< 0 (mod .cse0 4294967296)) 1 0)) (not (= (ite (< 0 (mod (+ v_~counter~0_3921 (* v_~c~0_1290 3)) 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_3921, ~c~0=v_~c~0_1290, ~N~0=v_~N~0_1277} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2053|, ~counter~0=v_~counter~0_3919, ~c~0=v_~c~0_1290, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1687|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2307, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_2061|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2053|, ~N~0=v_~N~0_1277, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3144|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:05:19,710 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:05:19,710 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:05:20,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1228] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (+ (* v_~c~0_1250 4) v_~counter~0_3777))) (and (= v_thread1Thread1of1ForFork0_~i~0_2237 6) (< 5 (mod v_~N~0_1237 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1977| (ite (< 0 (mod v_~counter~0_3775 4294967296)) 1 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_3044|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1977| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1977|) (= v_~counter~0_3775 .cse0) (not (= (ite (< 0 (mod .cse0 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_3777, ~c~0=v_~c~0_1250, ~N~0=v_~N~0_1237} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1977|, ~counter~0=v_~counter~0_3775, ~c~0=v_~c~0_1250, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1631|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2237, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_1985|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1977|, ~N~0=v_~N~0_1237, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3044|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:05:20,103 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:05:20,103 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:05:20,420 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 02:05:20,421 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3439 [2022-12-13 02:05:20,421 INFO L495 AbstractCegarLoop]: Abstraction has has 417 places, 1210 transitions, 62431 flow [2022-12-13 02:05:20,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:20,421 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:20,421 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:20,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-12-13 02:05:20,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2022-12-13 02:05:20,625 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:20,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:20,626 INFO L85 PathProgramCache]: Analyzing trace with hash -400201114, now seen corresponding path program 1 times [2022-12-13 02:05:20,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:20,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607831106] [2022-12-13 02:05:20,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:20,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:20,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:20,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:20,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607831106] [2022-12-13 02:05:20,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607831106] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:05:20,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089991810] [2022-12-13 02:05:20,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:20,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:05:20,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:05:20,743 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:05:20,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-12-13 02:05:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:20,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 02:05:20,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:05:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:20,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:05:20,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:20,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089991810] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:05:20,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:05:20,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-12-13 02:05:20,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566701505] [2022-12-13 02:05:20,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:05:20,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:05:20,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:20,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:05:20,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:05:20,901 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 80 [2022-12-13 02:05:20,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 1210 transitions, 62431 flow. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:20,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:20,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 80 [2022-12-13 02:05:20,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:31,175 INFO L130 PetriNetUnfolder]: 7197/14905 cut-off events. [2022-12-13 02:05:31,175 INFO L131 PetriNetUnfolder]: For 2503089/2503089 co-relation queries the response was YES. [2022-12-13 02:05:31,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277718 conditions, 14905 events. 7197/14905 cut-off events. For 2503089/2503089 co-relation queries the response was YES. Maximal size of possible extension queue 1169. Compared 144511 event pairs, 1276 based on Foata normal form. 5/14906 useless extension candidates. Maximal degree in co-relation 276988. Up to 14466 conditions per place. [2022-12-13 02:05:31,401 INFO L137 encePairwiseOnDemand]: 33/80 looper letters, 1112 selfloop transitions, 129 changer transitions 12/1253 dead transitions. [2022-12-13 02:05:31,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 1253 transitions, 66359 flow [2022-12-13 02:05:31,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:31,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:31,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-13 02:05:31,402 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28 [2022-12-13 02:05:31,402 INFO L175 Difference]: Start difference. First operand has 417 places, 1210 transitions, 62431 flow. Second operand 5 states and 112 transitions. [2022-12-13 02:05:31,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 1253 transitions, 66359 flow [2022-12-13 02:05:49,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 1253 transitions, 65086 flow, removed 242 selfloop flow, removed 9 redundant places. [2022-12-13 02:05:49,294 INFO L231 Difference]: Finished difference. Result has 415 places, 1224 transitions, 62472 flow [2022-12-13 02:05:49,295 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=61128, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1080, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62472, PETRI_PLACES=415, PETRI_TRANSITIONS=1224} [2022-12-13 02:05:49,296 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 395 predicate places. [2022-12-13 02:05:49,296 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:49,296 INFO L89 Accepts]: Start accepts. Operand has 415 places, 1224 transitions, 62472 flow [2022-12-13 02:05:49,302 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:49,302 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:49,302 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 415 places, 1224 transitions, 62472 flow [2022-12-13 02:05:49,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 412 places, 1224 transitions, 62472 flow [2022-12-13 02:05:51,477 INFO L130 PetriNetUnfolder]: 1464/5837 cut-off events. [2022-12-13 02:05:51,477 INFO L131 PetriNetUnfolder]: For 669382/669383 co-relation queries the response was YES. [2022-12-13 02:05:51,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96765 conditions, 5837 events. 1464/5837 cut-off events. For 669382/669383 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 74728 event pairs, 82 based on Foata normal form. 1/5818 useless extension candidates. Maximal degree in co-relation 95021. Up to 1665 conditions per place. [2022-12-13 02:05:51,661 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 412 places, 1224 transitions, 62472 flow [2022-12-13 02:05:51,661 INFO L226 LiptonReduction]: Number of co-enabled transitions 3986 [2022-12-13 02:05:51,664 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1252] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_2287 6) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2039| 0)) (= v_~counter~0_3886 (+ (* v_~c~0_1280 5) v_~counter~0_3888)) (= |v_thread2Thread1of1ForFork1_~i~1#1_3127| 1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2039| (ite (< 0 (mod (+ v_~c~0_1280 v_~counter~0_3888) 4294967296)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2039| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2039|) (< (mod (+ v_thread1Thread1of1ForFork0_~i~0_2287 4294967295) 4294967296) (mod v_~N~0_1267 4294967296))) InVars {~counter~0=v_~counter~0_3888, ~c~0=v_~c~0_1280, ~N~0=v_~N~0_1267} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2039|, ~counter~0=v_~counter~0_3886, ~c~0=v_~c~0_1280, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1669|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2287, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_2047|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2039|, ~N~0=v_~N~0_1267, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3127|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:05:51,664 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:05:51,664 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:05:51,796 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1251] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~counter~0_3882 (* v_~c~0_1278 2)) 4294967296)) 1 0))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2037| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2037|) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_3125|) (not (= (ite (< 0 (mod (+ v_~c~0_1278 v_~counter~0_3882) 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_2283 10) (not (= .cse0 0)) (< 9 (mod v_~N~0_1265 4294967296)) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2037|) (= (+ (* v_~c~0_1278 5) v_~counter~0_3882) v_~counter~0_3880))) InVars {~counter~0=v_~counter~0_3882, ~c~0=v_~c~0_1278, ~N~0=v_~N~0_1265} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2037|, ~counter~0=v_~counter~0_3880, ~c~0=v_~c~0_1278, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1665|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2283, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_2045|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2037|, ~N~0=v_~N~0_1265, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [500] L51-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_311 4294967296))) (and (not (= (ite (< 0 (mod v_~counter~0_926 4294967296)) 1 0) 0)) (= (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_651|) |v_thread2Thread1of1ForFork1_~i~1#1_649|) (= v_~counter~0_926 (+ v_~counter~0_924 (* 2 v_~c~0_324))) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_651| 4294967296) .cse0) (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_649|) 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_469| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_469|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_469| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_469| (ite (< 0 (mod (+ v_~counter~0_924 v_~c~0_324) 4294967296)) 1 0)))) InVars {~counter~0=v_~counter~0_926, ~c~0=v_~c~0_324, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_651|, ~N~0=v_~N~0_311} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_469|, ~counter~0=v_~counter~0_924, ~c~0=v_~c~0_324, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_477|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_469|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_649|, ~N~0=v_~N~0_311} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:05:51,797 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:05:51,797 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:05:52,067 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1251] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~counter~0_3882 (* v_~c~0_1278 2)) 4294967296)) 1 0))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2037| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2037|) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_3125|) (not (= (ite (< 0 (mod (+ v_~c~0_1278 v_~counter~0_3882) 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_2283 10) (not (= .cse0 0)) (< 9 (mod v_~N~0_1265 4294967296)) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2037|) (= (+ (* v_~c~0_1278 5) v_~counter~0_3882) v_~counter~0_3880))) InVars {~counter~0=v_~counter~0_3882, ~c~0=v_~c~0_1278, ~N~0=v_~N~0_1265} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2037|, ~counter~0=v_~counter~0_3880, ~c~0=v_~c~0_1278, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1665|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2283, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_2045|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2037|, ~N~0=v_~N~0_1265, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [498] L51-4-->thread1EXIT: Formula: (let ((.cse0 (mod v_~N~0_309 4294967296))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467| 0)) (not (< (mod v_thread1Thread1of1ForFork0_~i~0_376 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_#res.offset_76| 0) (= v_~counter~0_921 (+ v_~counter~0_920 v_~c~0_322)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_646| 4294967296) .cse0) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_646| 1) |v_thread2Thread1of1ForFork1_~i~1#1_645|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467| (ite (< 0 (mod v_~counter~0_921 4294967296)) 1 0)) (= |v_thread1Thread1of1ForFork0_#res.base_76| 0))) InVars {~counter~0=v_~counter~0_921, ~c~0=v_~c~0_322, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_376, ~N~0=v_~N~0_309, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_646|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_467|, ~counter~0=v_~counter~0_920, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_76|, ~c~0=v_~c~0_322, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_376, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_76|, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_475|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_467|, ~N~0=v_~N~0_309, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_645|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:05:52,067 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:05:52,068 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:05:52,301 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:05:52,301 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:05:52,562 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1251] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~counter~0_3882 (* v_~c~0_1278 2)) 4294967296)) 1 0))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2037| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2037|) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_3125|) (not (= (ite (< 0 (mod (+ v_~c~0_1278 v_~counter~0_3882) 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_2283 10) (not (= .cse0 0)) (< 9 (mod v_~N~0_1265 4294967296)) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2037|) (= (+ (* v_~c~0_1278 5) v_~counter~0_3882) v_~counter~0_3880))) InVars {~counter~0=v_~counter~0_3882, ~c~0=v_~c~0_1278, ~N~0=v_~N~0_1265} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2037|, ~counter~0=v_~counter~0_3880, ~c~0=v_~c~0_1278, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1665|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2283, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_2045|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2037|, ~N~0=v_~N~0_1265, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:05:52,562 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:05:52,562 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:05:52,751 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1253] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_2291 6) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2041| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2041|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2041| (ite (< 0 (mod (+ (* v_~c~0_1282 4294967294) v_~counter~0_3892) 4294967296)) 1 0)) (= (+ (* v_~c~0_1282 5) v_~counter~0_3894) v_~counter~0_3892) (= |v_thread2Thread1of1ForFork1_~i~1#1_3129| 1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2041| 0)) (< (mod (+ v_thread1Thread1of1ForFork0_~i~0_2291 4294967295) 4294967296) (mod v_~N~0_1269 4294967296))) InVars {~counter~0=v_~counter~0_3894, ~c~0=v_~c~0_1282, ~N~0=v_~N~0_1269} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2041|, ~counter~0=v_~counter~0_3892, ~c~0=v_~c~0_1282, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1673|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2291, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_2049|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2041|, ~N~0=v_~N~0_1269, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3129|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:05:52,751 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:05:52,751 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:05:52,856 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1266] $Ultimate##0-->L41-4: Formula: (and (< 4 (mod v_~N~0_1287 4294967296)) (= v_thread1Thread1of1ForFork0_~i~0_2321 5) (= (+ v_~counter~0_3951 (* v_~c~0_1300 5)) v_~counter~0_3949)) InVars {~counter~0=v_~counter~0_3951, ~c~0=v_~c~0_1300, ~N~0=v_~N~0_1287} OutVars{~counter~0=v_~counter~0_3949, ~c~0=v_~c~0_1300, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1701|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2321, ~N~0=v_~N~0_1287} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] and [463] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_259 4294967296)) (.cse1 (+ v_~counter~0_766 v_~c~0_272))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_543|) 4294967296) .cse0) (not (= (ite (< 0 (mod v_~counter~0_768 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (< 0 (mod .cse1 4294967296)) 1 0)) (= (+ v_thread1Thread1of1ForFork0_~i~0_298 1) v_thread1Thread1of1ForFork0_~i~0_297) (< (mod v_thread1Thread1of1ForFork0_~i~0_298 4294967296) .cse0) (= v_~counter~0_768 .cse1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_543|))) InVars {~counter~0=v_~counter~0_768, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_298, ~N~0=v_~N~0_259} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_386|, ~counter~0=v_~counter~0_766, ~c~0=v_~c~0_272, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_220|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_297, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_394|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_543|, ~N~0=v_~N~0_259} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:05:52,940 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1260] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_1292 v_~counter~0_3927) 4294967296)) 1 0))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_3146|) 4294967296) (mod v_~N~0_1279 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2055| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2055|) (= v_thread1Thread1of1ForFork0_~i~0_2311 11) (= v_~counter~0_3925 v_~counter~0_3927) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2055|) (not (= .cse0 0)) (not (= (ite (< 0 (mod (+ (* v_~c~0_1292 2) v_~counter~0_3927) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_3146| 11) (not (= (ite (< 0 (mod (+ v_~counter~0_3927 (* v_~c~0_1292 3)) 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_3927, ~c~0=v_~c~0_1292, ~N~0=v_~N~0_1279} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2055|, ~counter~0=v_~counter~0_3925, ~c~0=v_~c~0_1292, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1691|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2311, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_2063|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2055|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3146|, ~N~0=v_~N~0_1279} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [1257] L41-4-->L51-4: Formula: (let ((.cse0 (mod v_~N~0_1275 4294967296))) (and (= v_~counter~0_3913 v_~counter~0_3915) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_3141| 1) |v_thread2Thread1of1ForFork1_~i~1#1_3140|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2051| 0)) (= (ite (< 0 (mod (+ v_~c~0_1288 v_~counter~0_3913) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2051|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_3141| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2051| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2051|) (< (mod v_thread1Thread1of1ForFork0_~i~0_2304 4294967296) .cse0) (= v_thread1Thread1of1ForFork0_~i~0_2303 (+ v_thread1Thread1of1ForFork0_~i~0_2304 1)))) InVars {~counter~0=v_~counter~0_3915, ~c~0=v_~c~0_1288, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2304, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3141|, ~N~0=v_~N~0_1275} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2051|, ~counter~0=v_~counter~0_3913, ~c~0=v_~c~0_1288, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1685|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2303, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_2059|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2051|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3140|, ~N~0=v_~N~0_1275} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:05:52,940 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:05:52,940 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:05:53,438 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 02:05:53,439 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4143 [2022-12-13 02:05:53,439 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 1224 transitions, 62756 flow [2022-12-13 02:05:53,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:53,439 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:53,439 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:53,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-12-13 02:05:53,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:05:53,644 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:53,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:53,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1314459346, now seen corresponding path program 1 times [2022-12-13 02:05:53,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:53,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545064083] [2022-12-13 02:05:53,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:53,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:53,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:53,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:53,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545064083] [2022-12-13 02:05:53,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545064083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:53,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:53,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:05:53,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844729373] [2022-12-13 02:05:53,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:53,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:05:53,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:53,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:05:53,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:05:53,715 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 84 [2022-12-13 02:05:53,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 1224 transitions, 62756 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:53,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:53,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 84 [2022-12-13 02:05:53,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:04,845 INFO L130 PetriNetUnfolder]: 7264/15015 cut-off events. [2022-12-13 02:06:04,845 INFO L131 PetriNetUnfolder]: For 2320990/2320990 co-relation queries the response was YES. [2022-12-13 02:06:04,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272116 conditions, 15015 events. 7264/15015 cut-off events. For 2320990/2320990 co-relation queries the response was YES. Maximal size of possible extension queue 1163. Compared 146534 event pairs, 3315 based on Foata normal form. 6/15017 useless extension candidates. Maximal degree in co-relation 267076. Up to 14361 conditions per place. [2022-12-13 02:06:05,074 INFO L137 encePairwiseOnDemand]: 24/84 looper letters, 1074 selfloop transitions, 198 changer transitions 5/1277 dead transitions. [2022-12-13 02:06:05,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 1277 transitions, 67242 flow [2022-12-13 02:06:05,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:06:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:06:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-12-13 02:06:05,075 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28869047619047616 [2022-12-13 02:06:05,075 INFO L175 Difference]: Start difference. First operand has 412 places, 1224 transitions, 62756 flow. Second operand 4 states and 97 transitions. [2022-12-13 02:06:05,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 1277 transitions, 67242 flow [2022-12-13 02:06:21,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 1277 transitions, 66842 flow, removed 175 selfloop flow, removed 2 redundant places. [2022-12-13 02:06:21,274 INFO L231 Difference]: Finished difference. Result has 415 places, 1252 transitions, 64368 flow [2022-12-13 02:06:21,275 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=62409, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64368, PETRI_PLACES=415, PETRI_TRANSITIONS=1252} [2022-12-13 02:06:21,276 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 395 predicate places. [2022-12-13 02:06:21,276 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:21,276 INFO L89 Accepts]: Start accepts. Operand has 415 places, 1252 transitions, 64368 flow [2022-12-13 02:06:21,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:21,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:21,282 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 415 places, 1252 transitions, 64368 flow [2022-12-13 02:06:21,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 415 places, 1252 transitions, 64368 flow [2022-12-13 02:06:23,492 INFO L130 PetriNetUnfolder]: 1482/5899 cut-off events. [2022-12-13 02:06:23,492 INFO L131 PetriNetUnfolder]: For 698910/698959 co-relation queries the response was YES. [2022-12-13 02:06:23,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98044 conditions, 5899 events. 1482/5899 cut-off events. For 698910/698959 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 75471 event pairs, 81 based on Foata normal form. 0/5875 useless extension candidates. Maximal degree in co-relation 96214. Up to 1682 conditions per place. [2022-12-13 02:06:23,673 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 415 places, 1252 transitions, 64368 flow [2022-12-13 02:06:23,673 INFO L226 LiptonReduction]: Number of co-enabled transitions 4082 [2022-12-13 02:06:23,679 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:06:23,679 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2403 [2022-12-13 02:06:23,679 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 1252 transitions, 64368 flow [2022-12-13 02:06:23,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:23,679 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:23,679 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:23,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-13 02:06:23,680 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:23,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:23,680 INFO L85 PathProgramCache]: Analyzing trace with hash 231619066, now seen corresponding path program 1 times [2022-12-13 02:06:23,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:23,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164760313] [2022-12-13 02:06:23,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:23,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:23,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:06:23,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:23,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164760313] [2022-12-13 02:06:23,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164760313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:23,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:23,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 02:06:23,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101460511] [2022-12-13 02:06:23,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:23,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 02:06:23,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:23,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 02:06:23,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 02:06:23,727 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 84 [2022-12-13 02:06:23,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 1252 transitions, 64368 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:23,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:23,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 84 [2022-12-13 02:06:23,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:35,266 INFO L130 PetriNetUnfolder]: 7414/15398 cut-off events. [2022-12-13 02:06:35,267 INFO L131 PetriNetUnfolder]: For 2472991/2472991 co-relation queries the response was YES. [2022-12-13 02:06:35,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280799 conditions, 15398 events. 7414/15398 cut-off events. For 2472991/2472991 co-relation queries the response was YES. Maximal size of possible extension queue 1199. Compared 151556 event pairs, 3335 based on Foata normal form. 4/15398 useless extension candidates. Maximal degree in co-relation 275253. Up to 13330 conditions per place. [2022-12-13 02:06:35,546 INFO L137 encePairwiseOnDemand]: 24/84 looper letters, 1108 selfloop transitions, 200 changer transitions 4/1312 dead transitions. [2022-12-13 02:06:35,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 1312 transitions, 69251 flow [2022-12-13 02:06:35,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 02:06:35,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 02:06:35,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2022-12-13 02:06:35,547 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2022-12-13 02:06:35,548 INFO L175 Difference]: Start difference. First operand has 415 places, 1252 transitions, 64368 flow. Second operand 4 states and 98 transitions. [2022-12-13 02:06:35,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 1312 transitions, 69251 flow [2022-12-13 02:06:50,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 1312 transitions, 69180 flow, removed 28 selfloop flow, removed 1 redundant places. [2022-12-13 02:06:51,036 INFO L231 Difference]: Finished difference. Result has 419 places, 1267 transitions, 65527 flow [2022-12-13 02:06:51,037 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=64297, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1052, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=65527, PETRI_PLACES=419, PETRI_TRANSITIONS=1267} [2022-12-13 02:06:51,037 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 399 predicate places. [2022-12-13 02:06:51,037 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:51,037 INFO L89 Accepts]: Start accepts. Operand has 419 places, 1267 transitions, 65527 flow [2022-12-13 02:06:51,046 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:51,046 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:51,047 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 419 places, 1267 transitions, 65527 flow [2022-12-13 02:06:51,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 419 places, 1267 transitions, 65527 flow [2022-12-13 02:06:53,381 INFO L130 PetriNetUnfolder]: 1482/5969 cut-off events. [2022-12-13 02:06:53,381 INFO L131 PetriNetUnfolder]: For 738384/738474 co-relation queries the response was YES. [2022-12-13 02:06:53,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100945 conditions, 5969 events. 1482/5969 cut-off events. For 738384/738474 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 77042 event pairs, 79 based on Foata normal form. 0/5944 useless extension candidates. Maximal degree in co-relation 99100. Up to 1730 conditions per place. [2022-12-13 02:06:53,582 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 419 places, 1267 transitions, 65527 flow [2022-12-13 02:06:53,582 INFO L226 LiptonReduction]: Number of co-enabled transitions 4112 [2022-12-13 02:06:53,603 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1260] $Ultimate##0-->L51-4: Formula: (let ((.cse0 (ite (< 0 (mod (+ v_~c~0_1292 v_~counter~0_3927) 4294967296)) 1 0))) (and (< (mod (+ 4294967295 |v_thread2Thread1of1ForFork1_~i~1#1_3146|) 4294967296) (mod v_~N~0_1279 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2055| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2055|) (= v_thread1Thread1of1ForFork0_~i~0_2311 11) (= v_~counter~0_3925 v_~counter~0_3927) (= .cse0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2055|) (not (= .cse0 0)) (not (= (ite (< 0 (mod (+ (* v_~c~0_1292 2) v_~counter~0_3927) 4294967296)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_3146| 11) (not (= (ite (< 0 (mod (+ v_~counter~0_3927 (* v_~c~0_1292 3)) 4294967296)) 1 0) 0)))) InVars {~counter~0=v_~counter~0_3927, ~c~0=v_~c~0_1292, ~N~0=v_~N~0_1279} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2055|, ~counter~0=v_~counter~0_3925, ~c~0=v_~c~0_1292, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1691|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2311, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_2063|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2055|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3146|, ~N~0=v_~N~0_1279} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [282] L41-4-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 (+ v_thread1Thread1of1ForFork0_~i~0_26 1)) (< (mod v_thread1Thread1of1ForFork0_~i~0_26 4294967296) (mod v_~N~0_35 4294967296)) (= (+ v_~c~0_52 v_~counter~0_81) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_81, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_26, ~N~0=v_~N~0_35} OutVars{~counter~0=v_~counter~0_80, ~c~0=v_~c~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, ~N~0=v_~N~0_35} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 02:06:53,833 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:53,833 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2796 [2022-12-13 02:06:53,833 INFO L495 AbstractCegarLoop]: Abstraction has has 418 places, 1266 transitions, 65523 flow [2022-12-13 02:06:53,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:53,834 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:53,834 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:53,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-13 02:06:53,834 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:53,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:53,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1846978345, now seen corresponding path program 1 times [2022-12-13 02:06:53,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:53,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301388273] [2022-12-13 02:06:53,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:53,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:06:53,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:53,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301388273] [2022-12-13 02:06:53,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301388273] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:06:53,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820761518] [2022-12-13 02:06:53,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:53,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:06:53,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:06:53,922 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:06:53,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-12-13 02:06:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:54,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:06:54,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:06:54,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:06:54,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:06:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:06:54,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820761518] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:06:54,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:06:54,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-12-13 02:06:54,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772162367] [2022-12-13 02:06:54,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:06:54,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 02:06:54,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:54,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 02:06:54,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 02:06:54,074 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 84 [2022-12-13 02:06:54,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 1266 transitions, 65523 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:54,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:54,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 84 [2022-12-13 02:06:54,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:05,476 INFO L130 PetriNetUnfolder]: 7545/15642 cut-off events. [2022-12-13 02:07:05,477 INFO L131 PetriNetUnfolder]: For 2631082/2631082 co-relation queries the response was YES. [2022-12-13 02:07:05,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287668 conditions, 15642 events. 7545/15642 cut-off events. For 2631082/2631082 co-relation queries the response was YES. Maximal size of possible extension queue 1207. Compared 154253 event pairs, 3230 based on Foata normal form. 24/15662 useless extension candidates. Maximal degree in co-relation 282227. Up to 14140 conditions per place. [2022-12-13 02:07:05,921 INFO L137 encePairwiseOnDemand]: 23/84 looper letters, 1070 selfloop transitions, 292 changer transitions 10/1372 dead transitions. [2022-12-13 02:07:05,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 1372 transitions, 71788 flow [2022-12-13 02:07:05,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 02:07:05,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 02:07:05,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-12-13 02:07:05,922 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.195578231292517 [2022-12-13 02:07:05,922 INFO L175 Difference]: Start difference. First operand has 418 places, 1266 transitions, 65523 flow. Second operand 7 states and 115 transitions. [2022-12-13 02:07:05,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 1372 transitions, 71788 flow [2022-12-13 02:07:21,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 1372 transitions, 71480 flow, removed 48 selfloop flow, removed 2 redundant places. [2022-12-13 02:07:22,020 INFO L231 Difference]: Finished difference. Result has 424 places, 1301 transitions, 67624 flow [2022-12-13 02:07:22,021 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=65227, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=256, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=974, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=67624, PETRI_PLACES=424, PETRI_TRANSITIONS=1301} [2022-12-13 02:07:22,021 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 404 predicate places. [2022-12-13 02:07:22,021 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:22,021 INFO L89 Accepts]: Start accepts. Operand has 424 places, 1301 transitions, 67624 flow [2022-12-13 02:07:22,031 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:22,031 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:22,031 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 424 places, 1301 transitions, 67624 flow [2022-12-13 02:07:22,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 424 places, 1301 transitions, 67624 flow [2022-12-13 02:07:23,973 INFO L130 PetriNetUnfolder]: 1513/6084 cut-off events. [2022-12-13 02:07:23,974 INFO L131 PetriNetUnfolder]: For 767980/768070 co-relation queries the response was YES. [2022-12-13 02:07:24,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103276 conditions, 6084 events. 1513/6084 cut-off events. For 767980/768070 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 78590 event pairs, 82 based on Foata normal form. 0/6058 useless extension candidates. Maximal degree in co-relation 101758. Up to 1769 conditions per place. [2022-12-13 02:07:24,282 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 424 places, 1301 transitions, 67624 flow [2022-12-13 02:07:24,283 INFO L226 LiptonReduction]: Number of co-enabled transitions 4256 [2022-12-13 02:07:24,522 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1284] $Ultimate##0-->L41-4: Formula: (let ((.cse0 (+ v_~counter~0_4025 (* v_~c~0_1322 3)))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2109| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_3201| 10) (= .cse0 v_~counter~0_4023) (not (= (ite (< 0 (mod .cse0 4294967296)) 1 0) 0)) (= v_thread1Thread1of1ForFork0_~i~0_2356 13) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2109| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2109|) (not (= (ite (< 0 (mod (+ v_~c~0_1322 v_~counter~0_4025) 4294967296)) 1 0) 0)) (= (ite (< 0 (mod (+ (* v_~c~0_1322 2) v_~counter~0_4025) 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2109|) (< (mod (+ v_thread1Thread1of1ForFork0_~i~0_2356 4294967295) 4294967296) (mod v_~N~0_1309 4294967296)))) InVars {~counter~0=v_~counter~0_4025, ~c~0=v_~c~0_1322, ~N~0=v_~N~0_1309} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_2109|, ~counter~0=v_~counter~0_4023, ~c~0=v_~c~0_1322, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1736|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_2356, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_2117|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_2109|, ~N~0=v_~N~0_1309, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_3201|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [281] L51-4-->L51-4: Formula: (and (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_24|) |v_thread2Thread1of1ForFork1_~i~1#1_23|) (= (+ v_~c~0_48 v_~counter~0_70) v_~counter~0_71) (= (ite (< 0 (mod v_~counter~0_71 4294967296)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_24| 4294967296) (mod v_~N~0_31 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_71, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_24|, ~N~0=v_~N~0_31} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_70, ~c~0=v_~c~0_48, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_21|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_23|, ~N~0=v_~N~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 02:07:24,522 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:07:24,522 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:07:24,793 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:07:24,794 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2773 [2022-12-13 02:07:24,794 INFO L495 AbstractCegarLoop]: Abstraction has has 423 places, 1300 transitions, 67665 flow [2022-12-13 02:07:24,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:24,794 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:24,794 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:24,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-12-13 02:07:24,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2022-12-13 02:07:24,997 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:24,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:24,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1466391670, now seen corresponding path program 1 times [2022-12-13 02:07:24,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:24,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901447906] [2022-12-13 02:07:24,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:24,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:25,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:25,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:25,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901447906] [2022-12-13 02:07:25,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901447906] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:07:25,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611456652] [2022-12-13 02:07:25,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:25,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:07:25,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:07:25,071 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:07:25,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-12-13 02:07:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:25,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 02:07:25,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:07:25,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:25,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:07:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:25,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611456652] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:07:25,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:07:25,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 02:07:25,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344664563] [2022-12-13 02:07:25,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:07:25,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:07:25,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:25,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:07:25,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:07:25,254 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 85 [2022-12-13 02:07:25,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 1300 transitions, 67665 flow. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:25,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:25,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 85 [2022-12-13 02:07:25,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:36,272 INFO L130 PetriNetUnfolder]: 7853/16224 cut-off events. [2022-12-13 02:07:36,273 INFO L131 PetriNetUnfolder]: For 2930641/2930641 co-relation queries the response was YES. [2022-12-13 02:07:36,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300811 conditions, 16224 events. 7853/16224 cut-off events. For 2930641/2930641 co-relation queries the response was YES. Maximal size of possible extension queue 1265. Compared 160365 event pairs, 3153 based on Foata normal form. 218/16438 useless extension candidates. Maximal degree in co-relation 296257. Up to 13895 conditions per place. [2022-12-13 02:07:36,560 INFO L137 encePairwiseOnDemand]: 24/85 looper letters, 1050 selfloop transitions, 390 changer transitions 12/1452 dead transitions. [2022-12-13 02:07:36,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 1452 transitions, 76192 flow [2022-12-13 02:07:36,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 02:07:36,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 02:07:36,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2022-12-13 02:07:36,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.14941176470588236 [2022-12-13 02:07:36,561 INFO L175 Difference]: Start difference. First operand has 423 places, 1300 transitions, 67665 flow. Second operand 10 states and 127 transitions. [2022-12-13 02:07:36,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 1452 transitions, 76192 flow [2022-12-13 02:07:54,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 1452 transitions, 75472 flow, removed 238 selfloop flow, removed 3 redundant places. [2022-12-13 02:07:54,193 INFO L231 Difference]: Finished difference. Result has 432 places, 1351 transitions, 70974 flow [2022-12-13 02:07:54,194 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=66947, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=341, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=917, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=70974, PETRI_PLACES=432, PETRI_TRANSITIONS=1351} [2022-12-13 02:07:54,194 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 412 predicate places. [2022-12-13 02:07:54,194 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:54,194 INFO L89 Accepts]: Start accepts. Operand has 432 places, 1351 transitions, 70974 flow [2022-12-13 02:07:54,208 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:54,208 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:54,208 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 432 places, 1351 transitions, 70974 flow [2022-12-13 02:07:54,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 432 places, 1351 transitions, 70974 flow [2022-12-13 02:07:56,865 INFO L130 PetriNetUnfolder]: 1574/6289 cut-off events. [2022-12-13 02:07:56,866 INFO L131 PetriNetUnfolder]: For 825983/826072 co-relation queries the response was YES. [2022-12-13 02:07:56,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108208 conditions, 6289 events. 1574/6289 cut-off events. For 825983/826072 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 81530 event pairs, 82 based on Foata normal form. 0/6264 useless extension candidates. Maximal degree in co-relation 106682. Up to 1856 conditions per place. [2022-12-13 02:07:57,114 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 432 places, 1351 transitions, 70974 flow [2022-12-13 02:07:57,114 INFO L226 LiptonReduction]: Number of co-enabled transitions 4468 [2022-12-13 02:07:57,121 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:07:57,121 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:07:57,209 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:07:57,210 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:07:57,303 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:07:57,303 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:07:57,532 WARN L322 ript$VariableManager]: TermVariable LBE36 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:07:57,533 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 02:07:57,758 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 02:07:57,759 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3565 [2022-12-13 02:07:57,759 INFO L495 AbstractCegarLoop]: Abstraction has has 430 places, 1349 transitions, 70964 flow [2022-12-13 02:07:57,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:57,759 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:57,760 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:57,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-12-13 02:07:57,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-12-13 02:07:57,960 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:57,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:57,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2145021132, now seen corresponding path program 1 times [2022-12-13 02:07:57,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:57,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24160729] [2022-12-13 02:07:57,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:57,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:58,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:58,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:58,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24160729] [2022-12-13 02:07:58,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24160729] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:07:58,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390194278] [2022-12-13 02:07:58,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:58,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:07:58,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:07:58,043 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:07:58,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-12-13 02:07:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:58,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:07:58,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:07:58,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:58,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:07:58,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:58,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390194278] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:07:58,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:07:58,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 02:07:58,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483406972] [2022-12-13 02:07:58,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:07:58,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:07:58,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:58,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:07:58,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:07:58,194 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 87 [2022-12-13 02:07:58,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 1349 transitions, 70964 flow. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:58,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:58,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 87 [2022-12-13 02:07:58,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:10,488 INFO L130 PetriNetUnfolder]: 7970/16425 cut-off events. [2022-12-13 02:08:10,489 INFO L131 PetriNetUnfolder]: For 2972968/2972968 co-relation queries the response was YES. [2022-12-13 02:08:10,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309367 conditions, 16425 events. 7970/16425 cut-off events. For 2972968/2972968 co-relation queries the response was YES. Maximal size of possible extension queue 1294. Compared 162752 event pairs, 2924 based on Foata normal form. 56/16477 useless extension candidates. Maximal degree in co-relation 304893. Up to 13474 conditions per place. [2022-12-13 02:08:10,804 INFO L137 encePairwiseOnDemand]: 19/87 looper letters, 857 selfloop transitions, 619 changer transitions 14/1490 dead transitions. [2022-12-13 02:08:10,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 1490 transitions, 79101 flow [2022-12-13 02:08:10,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 02:08:10,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 02:08:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2022-12-13 02:08:10,805 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.16347381864623245 [2022-12-13 02:08:10,805 INFO L175 Difference]: Start difference. First operand has 430 places, 1349 transitions, 70964 flow. Second operand 9 states and 128 transitions. [2022-12-13 02:08:10,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 1490 transitions, 79101 flow [2022-12-13 02:08:30,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 1490 transitions, 78679 flow, removed 211 selfloop flow, removed 1 redundant places. [2022-12-13 02:08:30,848 INFO L231 Difference]: Finished difference. Result has 442 places, 1405 transitions, 75193 flow [2022-12-13 02:08:30,849 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=70580, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=563, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=738, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=75193, PETRI_PLACES=442, PETRI_TRANSITIONS=1405} [2022-12-13 02:08:30,849 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 422 predicate places. [2022-12-13 02:08:30,850 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:30,850 INFO L89 Accepts]: Start accepts. Operand has 442 places, 1405 transitions, 75193 flow [2022-12-13 02:08:30,860 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:30,860 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:30,860 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 442 places, 1405 transitions, 75193 flow [2022-12-13 02:08:30,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 442 places, 1405 transitions, 75193 flow [2022-12-13 02:08:33,095 INFO L130 PetriNetUnfolder]: 1606/6355 cut-off events. [2022-12-13 02:08:33,095 INFO L131 PetriNetUnfolder]: For 865604/865736 co-relation queries the response was YES. [2022-12-13 02:08:33,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111613 conditions, 6355 events. 1606/6355 cut-off events. For 865604/865736 co-relation queries the response was YES. Maximal size of possible extension queue 892. Compared 82447 event pairs, 83 based on Foata normal form. 0/6331 useless extension candidates. Maximal degree in co-relation 109853. Up to 1898 conditions per place. [2022-12-13 02:08:33,267 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 442 places, 1405 transitions, 75193 flow [2022-12-13 02:08:33,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 4656 [2022-12-13 02:08:33,270 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:08:33,271 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2421 [2022-12-13 02:08:33,271 INFO L495 AbstractCegarLoop]: Abstraction has has 442 places, 1405 transitions, 75193 flow [2022-12-13 02:08:33,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:33,271 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:33,271 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:33,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-12-13 02:08:33,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:08:33,476 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:33,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:33,476 INFO L85 PathProgramCache]: Analyzing trace with hash -532711939, now seen corresponding path program 1 times [2022-12-13 02:08:33,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:33,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505912555] [2022-12-13 02:08:33,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:33,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:33,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:33,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505912555] [2022-12-13 02:08:33,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505912555] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:08:33,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237807243] [2022-12-13 02:08:33,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:33,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:08:33,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:08:33,543 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:08:33,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-12-13 02:08:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:33,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 02:08:33,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:08:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:33,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:08:33,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:33,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237807243] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:08:33,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:08:33,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-12-13 02:08:33,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677468213] [2022-12-13 02:08:33,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:08:33,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 02:08:33,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:33,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 02:08:33,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 02:08:33,691 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 87 [2022-12-13 02:08:33,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 1405 transitions, 75193 flow. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:33,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:33,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 87 [2022-12-13 02:08:33,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:47,884 INFO L130 PetriNetUnfolder]: 7956/16381 cut-off events. [2022-12-13 02:08:47,884 INFO L131 PetriNetUnfolder]: For 2930094/2930094 co-relation queries the response was YES. [2022-12-13 02:08:48,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314404 conditions, 16381 events. 7956/16381 cut-off events. For 2930094/2930094 co-relation queries the response was YES. Maximal size of possible extension queue 1298. Compared 161245 event pairs, 1411 based on Foata normal form. 10/16387 useless extension candidates. Maximal degree in co-relation 309771. Up to 15946 conditions per place. [2022-12-13 02:08:48,326 INFO L137 encePairwiseOnDemand]: 36/87 looper letters, 1282 selfloop transitions, 133 changer transitions 13/1428 dead transitions. [2022-12-13 02:08:48,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 1428 transitions, 78486 flow [2022-12-13 02:08:48,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2022-12-13 02:08:48,327 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2597701149425287 [2022-12-13 02:08:48,327 INFO L175 Difference]: Start difference. First operand has 442 places, 1405 transitions, 75193 flow. Second operand 5 states and 113 transitions. [2022-12-13 02:08:48,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 1428 transitions, 78486 flow [2022-12-13 02:09:10,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 1428 transitions, 77148 flow, removed 669 selfloop flow, removed 0 redundant places. [2022-12-13 02:09:10,266 INFO L231 Difference]: Finished difference. Result has 448 places, 1401 transitions, 74001 flow [2022-12-13 02:09:10,267 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=73855, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74001, PETRI_PLACES=448, PETRI_TRANSITIONS=1401} [2022-12-13 02:09:10,267 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 428 predicate places. [2022-12-13 02:09:10,267 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:10,267 INFO L89 Accepts]: Start accepts. Operand has 448 places, 1401 transitions, 74001 flow [2022-12-13 02:09:10,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:10,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:10,282 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 448 places, 1401 transitions, 74001 flow [2022-12-13 02:09:10,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 447 places, 1401 transitions, 74001 flow [2022-12-13 02:09:12,892 INFO L130 PetriNetUnfolder]: 1604/6337 cut-off events. [2022-12-13 02:09:12,893 INFO L131 PetriNetUnfolder]: For 863756/863884 co-relation queries the response was YES. [2022-12-13 02:09:12,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111171 conditions, 6337 events. 1604/6337 cut-off events. For 863756/863884 co-relation queries the response was YES. Maximal size of possible extension queue 884. Compared 82134 event pairs, 82 based on Foata normal form. 0/6316 useless extension candidates. Maximal degree in co-relation 109417. Up to 1754 conditions per place. [2022-12-13 02:09:13,070 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 447 places, 1401 transitions, 74001 flow [2022-12-13 02:09:13,070 INFO L226 LiptonReduction]: Number of co-enabled transitions 4640 [2022-12-13 02:09:13,073 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:09:13,074 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2807 [2022-12-13 02:09:13,074 INFO L495 AbstractCegarLoop]: Abstraction has has 447 places, 1401 transitions, 74001 flow [2022-12-13 02:09:13,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:13,074 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:13,074 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:13,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-12-13 02:09:13,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:13,280 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:09:13,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:13,280 INFO L85 PathProgramCache]: Analyzing trace with hash 132712323, now seen corresponding path program 1 times [2022-12-13 02:09:13,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:13,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801619364] [2022-12-13 02:09:13,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:13,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:13,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:13,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801619364] [2022-12-13 02:09:13,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801619364] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:09:13,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998197309] [2022-12-13 02:09:13,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:13,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:13,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:09:13,370 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:09:13,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-12-13 02:09:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:13,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 02:09:13,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:09:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:13,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:09:13,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:13,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998197309] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:09:13,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:09:13,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-13 02:09:13,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985866158] [2022-12-13 02:09:13,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:09:13,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:09:13,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:13,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:09:13,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:09:13,570 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 83 [2022-12-13 02:09:13,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 1401 transitions, 74001 flow. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:13,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:13,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 83 [2022-12-13 02:09:13,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:09:27,810 INFO L130 PetriNetUnfolder]: 8358/17230 cut-off events. [2022-12-13 02:09:27,810 INFO L131 PetriNetUnfolder]: For 3133180/3133180 co-relation queries the response was YES. [2022-12-13 02:09:27,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330328 conditions, 17230 events. 8358/17230 cut-off events. For 3133180/3133180 co-relation queries the response was YES. Maximal size of possible extension queue 1376. Compared 170860 event pairs, 971 based on Foata normal form. 61/17287 useless extension candidates. Maximal degree in co-relation 325711. Up to 7849 conditions per place. [2022-12-13 02:09:28,112 INFO L137 encePairwiseOnDemand]: 35/83 looper letters, 862 selfloop transitions, 701 changer transitions 89/1652 dead transitions. [2022-12-13 02:09:28,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 1652 transitions, 86282 flow [2022-12-13 02:09:28,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 02:09:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 02:09:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2022-12-13 02:09:28,113 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2429718875502008 [2022-12-13 02:09:28,113 INFO L175 Difference]: Start difference. First operand has 447 places, 1401 transitions, 74001 flow. Second operand 6 states and 121 transitions. [2022-12-13 02:09:28,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 1652 transitions, 86282 flow [2022-12-13 02:09:47,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 1652 transitions, 85866 flow, removed 29 selfloop flow, removed 4 redundant places. [2022-12-13 02:09:47,928 INFO L231 Difference]: Finished difference. Result has 452 places, 1420 transitions, 77276 flow [2022-12-13 02:09:47,929 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=73591, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=670, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=710, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=77276, PETRI_PLACES=452, PETRI_TRANSITIONS=1420} [2022-12-13 02:09:47,929 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 432 predicate places. [2022-12-13 02:09:47,929 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:09:47,929 INFO L89 Accepts]: Start accepts. Operand has 452 places, 1420 transitions, 77276 flow [2022-12-13 02:09:47,940 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:09:47,940 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:09:47,940 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 452 places, 1420 transitions, 77276 flow [2022-12-13 02:09:47,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 450 places, 1420 transitions, 77276 flow [2022-12-13 02:09:50,330 INFO L130 PetriNetUnfolder]: 1667/6578 cut-off events. [2022-12-13 02:09:50,331 INFO L131 PetriNetUnfolder]: For 930651/930775 co-relation queries the response was YES. [2022-12-13 02:09:50,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118729 conditions, 6578 events. 1667/6578 cut-off events. For 930651/930775 co-relation queries the response was YES. Maximal size of possible extension queue 934. Compared 85745 event pairs, 101 based on Foata normal form. 0/6558 useless extension candidates. Maximal degree in co-relation 116963. Up to 1871 conditions per place. [2022-12-13 02:09:50,528 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 450 places, 1420 transitions, 77276 flow [2022-12-13 02:09:50,528 INFO L226 LiptonReduction]: Number of co-enabled transitions 4686 [2022-12-13 02:09:50,531 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:09:50,531 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2602 [2022-12-13 02:09:50,531 INFO L495 AbstractCegarLoop]: Abstraction has has 450 places, 1420 transitions, 77276 flow [2022-12-13 02:09:50,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:50,531 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:09:50,532 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:09:50,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2022-12-13 02:09:50,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:50,736 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:09:50,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:09:50,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1450293050, now seen corresponding path program 1 times [2022-12-13 02:09:50,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:09:50,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745664419] [2022-12-13 02:09:50,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:50,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:09:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:50,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:09:50,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745664419] [2022-12-13 02:09:50,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745664419] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:09:50,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120559385] [2022-12-13 02:09:50,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:09:50,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:09:50,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:09:50,813 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:09:50,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-12-13 02:09:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:09:50,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 02:09:50,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:09:51,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:51,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:09:51,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:09:51,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120559385] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:09:51,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:09:51,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-13 02:09:51,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739990850] [2022-12-13 02:09:51,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:09:51,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 02:09:51,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:09:51,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 02:09:51,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-13 02:09:51,044 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 81 [2022-12-13 02:09:51,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 1420 transitions, 77276 flow. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:09:51,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:09:51,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 81 [2022-12-13 02:09:51,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:04,954 INFO L130 PetriNetUnfolder]: 8298/17074 cut-off events. [2022-12-13 02:10:04,954 INFO L131 PetriNetUnfolder]: For 3260023/3260023 co-relation queries the response was YES. [2022-12-13 02:10:05,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334548 conditions, 17074 events. 8298/17074 cut-off events. For 3260023/3260023 co-relation queries the response was YES. Maximal size of possible extension queue 1363. Compared 170061 event pairs, 3556 based on Foata normal form. 4/17074 useless extension candidates. Maximal degree in co-relation 329903. Up to 15517 conditions per place. [2022-12-13 02:10:05,343 INFO L137 encePairwiseOnDemand]: 23/81 looper letters, 1203 selfloop transitions, 321 changer transitions 5/1529 dead transitions. [2022-12-13 02:10:05,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 1529 transitions, 83982 flow [2022-12-13 02:10:05,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 02:10:05,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 02:10:05,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2022-12-13 02:10:05,344 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12962962962962962 [2022-12-13 02:10:05,344 INFO L175 Difference]: Start difference. First operand has 450 places, 1420 transitions, 77276 flow. Second operand 12 states and 126 transitions. [2022-12-13 02:10:05,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 1529 transitions, 83982 flow [2022-12-13 02:10:27,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 1529 transitions, 83569 flow, removed 197 selfloop flow, removed 2 redundant places. [2022-12-13 02:10:27,830 INFO L231 Difference]: Finished difference. Result has 461 places, 1443 transitions, 78941 flow [2022-12-13 02:10:27,831 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=76929, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=298, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=78941, PETRI_PLACES=461, PETRI_TRANSITIONS=1443} [2022-12-13 02:10:27,831 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 441 predicate places. [2022-12-13 02:10:27,831 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:10:27,831 INFO L89 Accepts]: Start accepts. Operand has 461 places, 1443 transitions, 78941 flow [2022-12-13 02:10:27,842 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:10:27,842 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:10:27,842 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 461 places, 1443 transitions, 78941 flow [2022-12-13 02:10:27,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 461 places, 1443 transitions, 78941 flow [2022-12-13 02:10:30,439 INFO L130 PetriNetUnfolder]: 1687/6651 cut-off events. [2022-12-13 02:10:30,439 INFO L131 PetriNetUnfolder]: For 960663/960664 co-relation queries the response was YES. [2022-12-13 02:10:30,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120274 conditions, 6651 events. 1687/6651 cut-off events. For 960663/960664 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 86764 event pairs, 100 based on Foata normal form. 1/6637 useless extension candidates. Maximal degree in co-relation 118498. Up to 1890 conditions per place. [2022-12-13 02:10:30,619 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 461 places, 1443 transitions, 78941 flow [2022-12-13 02:10:30,620 INFO L226 LiptonReduction]: Number of co-enabled transitions 4776 [2022-12-13 02:10:31,103 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:10:31,103 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3272 [2022-12-13 02:10:31,104 INFO L495 AbstractCegarLoop]: Abstraction has has 460 places, 1442 transitions, 78937 flow [2022-12-13 02:10:31,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:10:31,104 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:10:31,104 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:10:31,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-12-13 02:10:31,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:10:31,307 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:10:31,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:10:31,309 INFO L85 PathProgramCache]: Analyzing trace with hash -473126551, now seen corresponding path program 1 times [2022-12-13 02:10:31,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:10:31,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093068208] [2022-12-13 02:10:31,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:31,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:10:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:31,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:10:31,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093068208] [2022-12-13 02:10:31,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093068208] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:10:31,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124303768] [2022-12-13 02:10:31,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:10:31,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:10:31,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:10:31,443 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:10:31,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-12-13 02:10:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:10:31,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:10:31,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:10:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:31,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:10:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:10:31,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124303768] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:10:31,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:10:31,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-13 02:10:31,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977625982] [2022-12-13 02:10:31,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:10:31,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 02:10:31,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:10:31,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 02:10:31,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-13 02:10:31,592 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 81 [2022-12-13 02:10:31,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 1442 transitions, 78937 flow. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:10:31,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:10:31,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 81 [2022-12-13 02:10:31,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:10:45,912 INFO L130 PetriNetUnfolder]: 8724/17983 cut-off events. [2022-12-13 02:10:45,913 INFO L131 PetriNetUnfolder]: For 3565363/3565363 co-relation queries the response was YES. [2022-12-13 02:10:46,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353286 conditions, 17983 events. 8724/17983 cut-off events. For 3565363/3565363 co-relation queries the response was YES. Maximal size of possible extension queue 1453. Compared 180254 event pairs, 1889 based on Foata normal form. 96/18075 useless extension candidates. Maximal degree in co-relation 348615. Up to 7857 conditions per place. [2022-12-13 02:10:46,275 INFO L137 encePairwiseOnDemand]: 24/81 looper letters, 450 selfloop transitions, 1129 changer transitions 11/1590 dead transitions. [2022-12-13 02:10:46,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 1590 transitions, 87788 flow [2022-12-13 02:10:46,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 02:10:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 02:10:46,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2022-12-13 02:10:46,276 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19598765432098766 [2022-12-13 02:10:46,276 INFO L175 Difference]: Start difference. First operand has 460 places, 1442 transitions, 78937 flow. Second operand 8 states and 127 transitions. [2022-12-13 02:10:46,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 1590 transitions, 87788 flow [2022-12-13 02:11:09,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 1590 transitions, 87296 flow, removed 54 selfloop flow, removed 5 redundant places. [2022-12-13 02:11:09,686 INFO L231 Difference]: Finished difference. Result has 465 places, 1522 transitions, 86611 flow [2022-12-13 02:11:09,687 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=78458, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1065, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=86611, PETRI_PLACES=465, PETRI_TRANSITIONS=1522} [2022-12-13 02:11:09,688 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 445 predicate places. [2022-12-13 02:11:09,688 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:11:09,688 INFO L89 Accepts]: Start accepts. Operand has 465 places, 1522 transitions, 86611 flow [2022-12-13 02:11:09,700 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:11:09,700 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:11:09,700 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 465 places, 1522 transitions, 86611 flow [2022-12-13 02:11:09,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 465 places, 1522 transitions, 86611 flow [2022-12-13 02:11:12,893 INFO L130 PetriNetUnfolder]: 1771/7026 cut-off events. [2022-12-13 02:11:12,893 INFO L131 PetriNetUnfolder]: For 1084810/1084811 co-relation queries the response was YES. [2022-12-13 02:11:12,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130500 conditions, 7026 events. 1771/7026 cut-off events. For 1084810/1084811 co-relation queries the response was YES. Maximal size of possible extension queue 984. Compared 92647 event pairs, 104 based on Foata normal form. 1/7008 useless extension candidates. Maximal degree in co-relation 128701. Up to 2044 conditions per place. [2022-12-13 02:11:13,169 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 465 places, 1522 transitions, 86611 flow [2022-12-13 02:11:13,170 INFO L226 LiptonReduction]: Number of co-enabled transitions 5082 [2022-12-13 02:11:13,173 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 02:11:13,173 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3485 [2022-12-13 02:11:13,173 INFO L495 AbstractCegarLoop]: Abstraction has has 465 places, 1522 transitions, 86611 flow [2022-12-13 02:11:13,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:11:13,173 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:11:13,173 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:13,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-12-13 02:11:13,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable71 [2022-12-13 02:11:13,376 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:11:13,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:11:13,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1590036119, now seen corresponding path program 2 times [2022-12-13 02:11:13,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:11:13,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773201525] [2022-12-13 02:11:13,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:11:13,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:11:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:11:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:13,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:11:13,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773201525] [2022-12-13 02:11:13,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773201525] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 02:11:13,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051831158] [2022-12-13 02:11:13,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 02:11:13,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 02:11:13,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 02:11:13,469 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 02:11:13,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-12-13 02:11:13,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 02:11:13,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 02:11:13,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 02:11:13,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 02:11:13,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:13,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 02:11:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:11:13,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051831158] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 02:11:13,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 02:11:13,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 02:11:13,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983022002] [2022-12-13 02:11:13,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 02:11:13,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 02:11:13,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:11:13,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 02:11:13,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 02:11:13,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 81 [2022-12-13 02:11:13,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 465 places, 1522 transitions, 86611 flow. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:11:13,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:11:13,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 81 [2022-12-13 02:11:13,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:11:29,331 INFO L130 PetriNetUnfolder]: 8694/17905 cut-off events. [2022-12-13 02:11:29,332 INFO L131 PetriNetUnfolder]: For 3715319/3715319 co-relation queries the response was YES. [2022-12-13 02:11:29,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366225 conditions, 17905 events. 8694/17905 cut-off events. For 3715319/3715319 co-relation queries the response was YES. Maximal size of possible extension queue 1447. Compared 179245 event pairs, 810 based on Foata normal form. 26/17927 useless extension candidates. Maximal degree in co-relation 361365. Up to 6839 conditions per place. [2022-12-13 02:11:29,898 INFO L137 encePairwiseOnDemand]: 18/81 looper letters, 446 selfloop transitions, 1135 changer transitions 18/1599 dead transitions. [2022-12-13 02:11:29,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 1599 transitions, 91952 flow [2022-12-13 02:11:29,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 02:11:29,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 02:11:29,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 141 transitions. [2022-12-13 02:11:29,899 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.12433862433862433 [2022-12-13 02:11:29,900 INFO L175 Difference]: Start difference. First operand has 465 places, 1522 transitions, 86611 flow. Second operand 14 states and 141 transitions. [2022-12-13 02:11:29,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 1599 transitions, 91952 flow Received shutdown request... [2022-12-13 02:11:37,133 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 02:11:37,134 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 02:11:37,136 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 02:11:37,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-12-13 02:11:37,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2022-12-13 02:11:37,337 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2022-12-13 02:11:37,338 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 02:11:37,338 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 02:11:37,338 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:11:37,346 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 02:11:37,346 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 02:11:37,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:11:37 BasicIcfg [2022-12-13 02:11:37,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 02:11:37,348 INFO L158 Benchmark]: Toolchain (without parser) took 835576.97ms. Allocated memory was 190.8MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 150.5MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 5.2GB. Max. memory is 8.0GB. [2022-12-13 02:11:37,348 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 166.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 02:11:37,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.83ms. Allocated memory is still 190.8MB. Free memory was 150.2MB in the beginning and 139.0MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 02:11:37,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.11ms. Allocated memory is still 190.8MB. Free memory was 139.0MB in the beginning and 137.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 02:11:37,348 INFO L158 Benchmark]: Boogie Preprocessor took 29.78ms. Allocated memory is still 190.8MB. Free memory was 137.4MB in the beginning and 136.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 02:11:37,349 INFO L158 Benchmark]: RCFGBuilder took 287.14ms. Allocated memory is still 190.8MB. Free memory was 135.9MB in the beginning and 122.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 02:11:37,349 INFO L158 Benchmark]: TraceAbstraction took 835027.87ms. Allocated memory was 190.8MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 121.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 5.2GB. Max. memory is 8.0GB. [2022-12-13 02:11:37,349 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.09ms. Allocated memory is still 190.8MB. Free memory is still 166.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.83ms. Allocated memory is still 190.8MB. Free memory was 150.2MB in the beginning and 139.0MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.11ms. Allocated memory is still 190.8MB. Free memory was 139.0MB in the beginning and 137.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.78ms. Allocated memory is still 190.8MB. Free memory was 137.4MB in the beginning and 136.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 287.14ms. Allocated memory is still 190.8MB. Free memory was 135.9MB in the beginning and 122.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 835027.87ms. Allocated memory was 190.8MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 121.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 5.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 71 PlacesBefore, 20 PlacesAfterwards, 70 TransitionsBefore, 15 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 32 TrivialYvCompositions, 19 ConcurrentYvCompositions, 4 ChoiceCompositions, 55 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 266, independent: 262, independent conditional: 262, 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: 266, independent: 262, independent conditional: 0, independent unconditional: 262, 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: 266, independent: 262, independent conditional: 0, independent unconditional: 262, 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: 266, independent: 262, independent conditional: 0, independent unconditional: 262, 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: 266, independent: 262, independent conditional: 0, independent unconditional: 262, 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: 266, independent: 262, independent conditional: 0, independent unconditional: 262, 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: 38, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 266, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 266, unknown conditional: 0, unknown unconditional: 266] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 408, Positive conditional cache size: 0, Positive unconditional cache size: 408, 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.0s, 19 PlacesBefore, 19 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 24 PlacesBefore, 23 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 2, 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: 14, independent: 14, independent conditional: 2, independent unconditional: 12, 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: 14, independent: 14, independent conditional: 2, independent unconditional: 12, 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: 7, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 14, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 21 PlacesBefore, 21 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 24 PlacesBefore, 24 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 7, Positive conditional cache size: 1, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 10, Positive conditional cache size: 4, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 40 PlacesBefore, 39 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 6, 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: 12, independent: 12, independent conditional: 6, 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: 12, independent: 12, independent conditional: 6, 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: 8, independent: 8, independent conditional: 5, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 5, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 25, Positive conditional cache size: 13, 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, 41 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 26, Positive conditional cache size: 13, 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: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 40 PlacesBefore, 40 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 92 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): 30, Positive cache size: 30, Positive conditional cache size: 16, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 30, Positive conditional cache size: 16, 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.1s, 43 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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: 0.1s, 46 PlacesBefore, 46 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 38, Positive conditional cache size: 24, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 47 PlacesBefore, 46 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 47, Positive cache size: 47, Positive conditional cache size: 32, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 118 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): 47, Positive cache size: 47, Positive conditional cache size: 32, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 116 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): 47, Positive cache size: 47, Positive conditional cache size: 32, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 56 PlacesBefore, 55 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 49, Positive conditional cache size: 34, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 63 PlacesBefore, 62 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 150 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): 52, Positive cache size: 52, Positive conditional cache size: 37, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 65 PlacesBefore, 65 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 164 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): 55, Positive cache size: 55, Positive conditional cache size: 40, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 67 PlacesBefore, 65 PlacesAfterwards, 53 TransitionsBefore, 52 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 56, Positive conditional cache size: 41, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 80 PlacesBefore, 79 PlacesAfterwards, 76 TransitionsBefore, 75 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 64, Positive conditional cache size: 49, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 87 PlacesBefore, 86 PlacesAfterwards, 93 TransitionsBefore, 92 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 1, 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): 64, Positive cache size: 64, Positive conditional cache size: 49, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 92 PlacesBefore, 91 PlacesAfterwards, 97 TransitionsBefore, 95 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 69, Positive conditional cache size: 54, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 95 PlacesBefore, 95 PlacesAfterwards, 124 TransitionsBefore, 124 TransitionsAfterwards, 352 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 72, Positive conditional cache size: 57, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 105 PlacesBefore, 104 PlacesAfterwards, 140 TransitionsBefore, 139 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 77, Positive conditional cache size: 62, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 113 PlacesBefore, 113 PlacesAfterwards, 159 TransitionsBefore, 159 TransitionsAfterwards, 470 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 77, Positive conditional cache size: 62, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 124 PlacesBefore, 123 PlacesAfterwards, 178 TransitionsBefore, 177 TransitionsAfterwards, 524 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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): 78, Positive cache size: 78, Positive conditional cache size: 63, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 135 PlacesBefore, 133 PlacesAfterwards, 200 TransitionsBefore, 199 TransitionsAfterwards, 584 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 79, Positive conditional cache size: 64, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 146 PlacesBefore, 146 PlacesAfterwards, 218 TransitionsBefore, 218 TransitionsAfterwards, 644 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 81, Positive conditional cache size: 66, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.4s, 148 PlacesBefore, 147 PlacesAfterwards, 232 TransitionsBefore, 231 TransitionsAfterwards, 696 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 16, independent: 12, independent conditional: 12, 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): 85, Positive cache size: 85, Positive conditional cache size: 70, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 164 PlacesBefore, 164 PlacesAfterwards, 268 TransitionsBefore, 268 TransitionsAfterwards, 792 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): 85, Positive cache size: 85, Positive conditional cache size: 70, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 171 PlacesBefore, 171 PlacesAfterwards, 263 TransitionsBefore, 263 TransitionsAfterwards, 790 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): 85, Positive cache size: 85, Positive conditional cache size: 70, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 175 PlacesBefore, 175 PlacesAfterwards, 281 TransitionsBefore, 281 TransitionsAfterwards, 850 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): 85, Positive cache size: 85, Positive conditional cache size: 70, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 180 PlacesBefore, 181 PlacesAfterwards, 286 TransitionsBefore, 309 TransitionsAfterwards, 868 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, independent: 78, independent conditional: 78, 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: 78, independent: 78, independent conditional: 78, 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: 78, independent: 78, independent conditional: 78, 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: 78, independent: 78, independent conditional: 78, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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] , 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: 78, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 100, Positive conditional cache size: 85, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 198 PlacesBefore, 190 PlacesAfterwards, 265 TransitionsBefore, 257 TransitionsAfterwards, 790 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 0 ChoiceCompositions, 20 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, 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: 42, independent: 42, independent conditional: 42, 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: 42, independent: 42, independent conditional: 37, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 37, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 42, independent: 21, independent conditional: 16, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 121, Positive conditional cache size: 106, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 177 PlacesBefore, 177 PlacesAfterwards, 275 TransitionsBefore, 275 TransitionsAfterwards, 840 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): 121, Positive cache size: 121, Positive conditional cache size: 106, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.9s, 178 PlacesBefore, 178 PlacesAfterwards, 288 TransitionsBefore, 289 TransitionsAfterwards, 890 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: 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: 18, independent: 15, independent conditional: 15, 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): 124, Positive cache size: 124, Positive conditional cache size: 109, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 184 PlacesBefore, 183 PlacesAfterwards, 292 TransitionsBefore, 291 TransitionsAfterwards, 894 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 125, Positive conditional cache size: 110, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 198 PlacesBefore, 197 PlacesAfterwards, 320 TransitionsBefore, 319 TransitionsAfterwards, 974 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: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 132, Positive conditional cache size: 117, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 213 PlacesBefore, 212 PlacesAfterwards, 343 TransitionsBefore, 342 TransitionsAfterwards, 1052 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 5, independent: 4, independent conditional: 4, 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): 188, Positive cache size: 188, Positive conditional cache size: 173, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 220 PlacesBefore, 220 PlacesAfterwards, 379 TransitionsBefore, 379 TransitionsAfterwards, 1164 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): 188, Positive cache size: 188, Positive conditional cache size: 173, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 224 PlacesBefore, 224 PlacesAfterwards, 397 TransitionsBefore, 397 TransitionsAfterwards, 1204 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 192, Positive conditional cache size: 177, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 232 PlacesBefore, 232 PlacesAfterwards, 443 TransitionsBefore, 443 TransitionsAfterwards, 1384 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): 192, Positive cache size: 192, Positive conditional cache size: 177, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 235 PlacesBefore, 235 PlacesAfterwards, 450 TransitionsBefore, 450 TransitionsAfterwards, 1390 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): 192, Positive cache size: 192, Positive conditional cache size: 177, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 248 PlacesBefore, 248 PlacesAfterwards, 470 TransitionsBefore, 470 TransitionsAfterwards, 1446 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): 192, Positive cache size: 192, Positive conditional cache size: 177, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 264 PlacesBefore, 264 PlacesAfterwards, 516 TransitionsBefore, 516 TransitionsAfterwards, 1606 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): 192, Positive cache size: 192, Positive conditional cache size: 177, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 270 PlacesBefore, 270 PlacesAfterwards, 697 TransitionsBefore, 697 TransitionsAfterwards, 2316 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): 192, Positive cache size: 192, Positive conditional cache size: 177, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.0s, 279 PlacesBefore, 280 PlacesAfterwards, 700 TransitionsBefore, 751 TransitionsAfterwards, 2330 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 702, independent: 702, independent conditional: 702, 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: 702, independent: 702, independent conditional: 702, 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: 702, independent: 702, independent conditional: 702, 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: 702, independent: 702, independent conditional: 702, 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: 133, independent: 133, independent conditional: 133, 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: 133, independent: 133, independent conditional: 0, independent unconditional: 133, 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: 702, independent: 569, independent conditional: 569, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 133, unknown conditional: 133, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 326, Positive conditional cache size: 310, Positive unconditional cache size: 16, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 288 PlacesBefore, 286 PlacesAfterwards, 689 TransitionsBefore, 687 TransitionsAfterwards, 2276 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 328, Positive cache size: 328, Positive conditional cache size: 312, Positive unconditional cache size: 16, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.8s, 302 PlacesBefore, 302 PlacesAfterwards, 697 TransitionsBefore, 759 TransitionsAfterwards, 2304 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 618, independent: 618, independent conditional: 618, 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: 618, independent: 618, independent conditional: 618, 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: 618, independent: 618, independent conditional: 618, 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: 618, independent: 618, independent conditional: 618, 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: 17, independent: 17, independent conditional: 17, 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: 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: 618, independent: 601, independent conditional: 601, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 345, Positive cache size: 345, Positive conditional cache size: 329, Positive unconditional cache size: 16, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 305 PlacesBefore, 303 PlacesAfterwards, 672 TransitionsBefore, 670 TransitionsAfterwards, 2194 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 460, Positive cache size: 460, Positive conditional cache size: 444, Positive unconditional cache size: 16, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 317 PlacesBefore, 317 PlacesAfterwards, 706 TransitionsBefore, 706 TransitionsAfterwards, 2286 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): 460, Positive cache size: 460, Positive conditional cache size: 444, Positive unconditional cache size: 16, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 328 PlacesBefore, 328 PlacesAfterwards, 721 TransitionsBefore, 721 TransitionsAfterwards, 2340 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): 460, Positive cache size: 460, Positive conditional cache size: 444, Positive unconditional cache size: 16, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 334 PlacesBefore, 334 PlacesAfterwards, 719 TransitionsBefore, 719 TransitionsAfterwards, 2344 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): 460, Positive cache size: 460, Positive conditional cache size: 444, Positive unconditional cache size: 16, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 346 PlacesBefore, 346 PlacesAfterwards, 764 TransitionsBefore, 764 TransitionsAfterwards, 2494 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): 460, Positive cache size: 460, Positive conditional cache size: 444, Positive unconditional cache size: 16, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 350 PlacesBefore, 350 PlacesAfterwards, 800 TransitionsBefore, 800 TransitionsAfterwards, 2618 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): 460, Positive cache size: 460, Positive conditional cache size: 444, Positive unconditional cache size: 16, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 360 PlacesBefore, 358 PlacesAfterwards, 812 TransitionsBefore, 810 TransitionsAfterwards, 2666 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 467, Positive cache size: 467, Positive conditional cache size: 451, Positive unconditional cache size: 16, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 402 PlacesBefore, 397 PlacesAfterwards, 1052 TransitionsBefore, 1048 TransitionsAfterwards, 3374 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, 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: 17, independent: 17, independent conditional: 17, 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: 17, independent: 17, independent conditional: 17, 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: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 510, Positive cache size: 510, Positive conditional cache size: 493, Positive unconditional cache size: 17, 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, 393 PlacesBefore, 392 PlacesAfterwards, 1057 TransitionsBefore, 1056 TransitionsAfterwards, 3408 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: 0, 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: 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] , Statistics on independence cache: Total cache size (in pairs): 742, Positive cache size: 742, Positive conditional cache size: 725, Positive unconditional cache size: 17, 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.8s, 395 PlacesBefore, 394 PlacesAfterwards, 1107 TransitionsBefore, 1106 TransitionsAfterwards, 3612 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 861, Positive cache size: 861, Positive conditional cache size: 844, Positive unconditional cache size: 17, 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.1s, 398 PlacesBefore, 397 PlacesAfterwards, 1108 TransitionsBefore, 1107 TransitionsAfterwards, 3610 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): 864, Positive cache size: 864, Positive conditional cache size: 847, Positive unconditional cache size: 17, 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, 402 PlacesBefore, 402 PlacesAfterwards, 1137 TransitionsBefore, 1137 TransitionsAfterwards, 3684 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): 864, Positive cache size: 864, Positive conditional cache size: 847, Positive unconditional cache size: 17, 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.6s, 412 PlacesBefore, 411 PlacesAfterwards, 1141 TransitionsBefore, 1140 TransitionsAfterwards, 3696 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 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] , Statistics on independence cache: Total cache size (in pairs): 868, Positive cache size: 868, Positive conditional cache size: 851, Positive unconditional cache size: 17, 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.3s, 417 PlacesBefore, 417 PlacesAfterwards, 1210 TransitionsBefore, 1210 TransitionsAfterwards, 3958 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 882, Positive cache size: 882, Positive conditional cache size: 864, Positive unconditional cache size: 18, 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.8s, 412 PlacesBefore, 412 PlacesAfterwards, 1224 TransitionsBefore, 1224 TransitionsAfterwards, 3986 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 885, Positive cache size: 885, Positive conditional cache size: 867, Positive unconditional cache size: 18, 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, 415 PlacesBefore, 415 PlacesAfterwards, 1252 TransitionsBefore, 1252 TransitionsAfterwards, 4082 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): 885, Positive cache size: 885, Positive conditional cache size: 867, Positive unconditional cache size: 18, 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, 419 PlacesBefore, 418 PlacesAfterwards, 1267 TransitionsBefore, 1266 TransitionsAfterwards, 4112 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 1, 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): 886, Positive cache size: 886, Positive conditional cache size: 868, Positive unconditional cache size: 18, 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, 424 PlacesBefore, 423 PlacesAfterwards, 1301 TransitionsBefore, 1300 TransitionsAfterwards, 4256 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 887, Positive cache size: 887, Positive conditional cache size: 869, Positive unconditional cache size: 18, 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.6s, 432 PlacesBefore, 430 PlacesAfterwards, 1351 TransitionsBefore, 1349 TransitionsAfterwards, 4468 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1355, Positive cache size: 1355, Positive conditional cache size: 1337, Positive unconditional cache size: 18, 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, 442 PlacesBefore, 442 PlacesAfterwards, 1405 TransitionsBefore, 1405 TransitionsAfterwards, 4656 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): 1355, Positive cache size: 1355, Positive conditional cache size: 1337, Positive unconditional cache size: 18, 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, 447 PlacesBefore, 447 PlacesAfterwards, 1401 TransitionsBefore, 1401 TransitionsAfterwards, 4640 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): 1355, Positive cache size: 1355, Positive conditional cache size: 1337, Positive unconditional cache size: 18, 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, 450 PlacesBefore, 450 PlacesAfterwards, 1420 TransitionsBefore, 1420 TransitionsAfterwards, 4686 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): 1355, Positive cache size: 1355, Positive conditional cache size: 1337, Positive unconditional cache size: 18, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 461 PlacesBefore, 460 PlacesAfterwards, 1443 TransitionsBefore, 1442 TransitionsAfterwards, 4776 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1358, Positive cache size: 1358, Positive conditional cache size: 1340, Positive unconditional cache size: 18, 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, 465 PlacesBefore, 465 PlacesAfterwards, 1522 TransitionsBefore, 1522 TransitionsAfterwards, 5082 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): 1358, Positive cache size: 1358, Positive conditional cache size: 1340, Positive unconditional cache size: 18, 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 - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 95 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 834.9s, OverallIterations: 73, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 641.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3003 SdHoareTripleChecker+Valid, 46.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3003 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 43.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 4218 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25877 IncrementalHoareTripleChecker+Invalid, 30095 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4218 mSolverCounterUnsat, 6 mSDtfsCounter, 25877 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2289 GetRequests, 1456 SyntacticMatches, 68 SemanticMatches, 765 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2219 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86611occurred in iteration=72, InterpolantAutomatonStates: 609, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 1819 NumberOfCodeBlocks, 1819 NumberOfCodeBlocksAsserted, 141 NumberOfCheckSat, 2446 ConstructedInterpolants, 0 QuantifiedInterpolants, 13340 SizeOfPredicates, 134 NumberOfNonLiveVariables, 7972 ConjunctsInSsa, 541 ConjunctsInUnsatCore, 191 InterpolantComputations, 15 PerfectInterpolantSequences, 40/400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown