/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:45:27,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:45:27,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:45:27,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:45:27,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:45:27,533 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:45:27,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:45:27,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:45:27,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:45:27,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:45:27,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:45:27,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:45:27,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:45:27,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:45:27,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:45:27,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:45:27,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:45:27,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:45:27,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:45:27,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:45:27,566 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:45:27,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:45:27,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:45:27,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:45:27,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:45:27,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:45:27,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:45:27,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:45:27,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:45:27,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:45:27,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:45:27,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:45:27,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:45:27,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:45:27,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:45:27,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:45:27,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:45:27,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:45:27,589 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:45:27,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:45:27,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:45:27,591 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:45:27,622 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:45:27,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:45:27,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:45:27,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:45:27,625 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:45:27,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:45:27,626 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:45:27,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:45:27,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:45:27,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:45:27,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:45:27,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:45:27,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:45:27,627 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:45:27,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:45:27,628 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:45:27,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:45:27,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:45:27,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:45:27,628 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:45:27,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:45:27,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:45:27,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:45:27,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:45:27,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:45:27,629 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:45:27,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:45:27,629 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:45:27,629 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:45:27,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:45:27,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:45:27,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:45:27,986 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:45:27,986 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:45:27,988 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-5.wvr.c [2022-12-06 05:45:29,080 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:45:29,243 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:45:29,244 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c [2022-12-06 05:45:29,253 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/726034b1b/e00974030102486abf8960a3671562a5/FLAG6f9820172 [2022-12-06 05:45:29,275 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/726034b1b/e00974030102486abf8960a3671562a5 [2022-12-06 05:45:29,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:45:29,278 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:45:29,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:45:29,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:45:29,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:45:29,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:45:29" (1/1) ... [2022-12-06 05:45:29,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@94a5df0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:29, skipping insertion in model container [2022-12-06 05:45:29,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:45:29" (1/1) ... [2022-12-06 05:45:29,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:45:29,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:45:29,500 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c[2644,2657] [2022-12-06 05:45:29,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:45:29,526 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:45:29,557 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c[2644,2657] [2022-12-06 05:45:29,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:45:29,573 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:45:29,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:29 WrapperNode [2022-12-06 05:45:29,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:45:29,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:45:29,575 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:45:29,576 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:45:29,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:29" (1/1) ... [2022-12-06 05:45:29,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:29" (1/1) ... [2022-12-06 05:45:29,628 INFO L138 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 164 [2022-12-06 05:45:29,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:45:29,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:45:29,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:45:29,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:45:29,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:29" (1/1) ... [2022-12-06 05:45:29,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:29" (1/1) ... [2022-12-06 05:45:29,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:29" (1/1) ... [2022-12-06 05:45:29,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:29" (1/1) ... [2022-12-06 05:45:29,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:29" (1/1) ... [2022-12-06 05:45:29,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:29" (1/1) ... [2022-12-06 05:45:29,653 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:29" (1/1) ... [2022-12-06 05:45:29,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:29" (1/1) ... [2022-12-06 05:45:29,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:45:29,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:45:29,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:45:29,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:45:29,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:29" (1/1) ... [2022-12-06 05:45:29,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:45:29,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:29,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:45:29,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:45:29,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:45:29,743 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:45:29,746 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:45:29,746 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:45:29,746 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:45:29,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:45:29,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:45:29,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:45:29,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:45:29,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:45:29,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:45:29,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:45:29,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:45:29,752 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:45:29,892 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:45:29,894 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:45:30,221 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:45:30,233 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:45:30,233 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 05:45:30,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:45:30 BoogieIcfgContainer [2022-12-06 05:45:30,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:45:30,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:45:30,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:45:30,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:45:30,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:45:29" (1/3) ... [2022-12-06 05:45:30,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6105e463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:45:30, skipping insertion in model container [2022-12-06 05:45:30,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:45:29" (2/3) ... [2022-12-06 05:45:30,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6105e463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:45:30, skipping insertion in model container [2022-12-06 05:45:30,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:45:30" (3/3) ... [2022-12-06 05:45:30,242 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-5.wvr.c [2022-12-06 05:45:30,257 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:45:30,257 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:45:30,257 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:45:30,361 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:45:30,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 193 transitions, 402 flow [2022-12-06 05:45:30,504 INFO L130 PetriNetUnfolder]: 17/191 cut-off events. [2022-12-06 05:45:30,504 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:45:30,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 191 events. 17/191 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 163 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-12-06 05:45:30,510 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 193 transitions, 402 flow [2022-12-06 05:45:30,519 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 183 transitions, 378 flow [2022-12-06 05:45:30,520 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:30,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 183 transitions, 378 flow [2022-12-06 05:45:30,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 183 transitions, 378 flow [2022-12-06 05:45:30,600 INFO L130 PetriNetUnfolder]: 17/183 cut-off events. [2022-12-06 05:45:30,600 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:45:30,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 183 events. 17/183 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 143 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-12-06 05:45:30,607 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 183 transitions, 378 flow [2022-12-06 05:45:30,607 INFO L188 LiptonReduction]: Number of co-enabled transitions 3892 [2022-12-06 05:45:36,640 INFO L203 LiptonReduction]: Total number of compositions: 166 [2022-12-06 05:45:36,654 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:45:36,659 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;@1cb2b371, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:45:36,659 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:45:36,663 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 05:45:36,664 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:45:36,664 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:36,664 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:36,665 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:36,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:36,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1379268505, now seen corresponding path program 1 times [2022-12-06 05:45:36,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:36,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311242292] [2022-12-06 05:45:36,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:36,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:37,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:37,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311242292] [2022-12-06 05:45:37,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311242292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:37,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:37,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:45:37,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376296617] [2022-12-06 05:45:37,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:37,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:45:37,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:37,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:45:37,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:45:37,058 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 05:45:37,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:37,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:37,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 05:45:37,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:37,117 INFO L130 PetriNetUnfolder]: 45/80 cut-off events. [2022-12-06 05:45:37,118 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 05:45:37,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 80 events. 45/80 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 181 event pairs, 18 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 120. Up to 76 conditions per place. [2022-12-06 05:45:37,122 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-06 05:45:37,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-06 05:45:37,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:45:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:45:37,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 05:45:37,132 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-06 05:45:37,134 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 23 transitions. [2022-12-06 05:45:37,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 80 flow [2022-12-06 05:45:37,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 05:45:37,137 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-06 05:45:37,139 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2022-12-06 05:45:37,142 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 05:45:37,142 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:37,143 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 05:45:37,145 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:37,145 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:37,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 05:45:37,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 05:45:37,155 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-06 05:45:37,155 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:45:37,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 3/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2022-12-06 05:45:37,155 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 05:45:37,155 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 05:45:37,822 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:37,829 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 687 [2022-12-06 05:45:37,829 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-06 05:45:37,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:37,830 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:37,830 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:37,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:45:37,836 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:37,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:37,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1222658235, now seen corresponding path program 1 times [2022-12-06 05:45:37,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:37,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728112631] [2022-12-06 05:45:37,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:37,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:38,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:38,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:38,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728112631] [2022-12-06 05:45:38,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728112631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:38,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:38,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 05:45:38,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984654033] [2022-12-06 05:45:38,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:38,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:45:38,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:38,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:45:38,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:45:38,049 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 05:45:38,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:38,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:38,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 05:45:38,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:38,093 INFO L130 PetriNetUnfolder]: 66/116 cut-off events. [2022-12-06 05:45:38,093 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:45:38,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 116 events. 66/116 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 321 event pairs, 9 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 234. Up to 85 conditions per place. [2022-12-06 05:45:38,094 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-06 05:45:38,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 27 transitions, 119 flow [2022-12-06 05:45:38,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:45:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:45:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 05:45:38,096 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 05:45:38,096 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 3 states and 32 transitions. [2022-12-06 05:45:38,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 27 transitions, 119 flow [2022-12-06 05:45:38,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 27 transitions, 111 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:45:38,098 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2022-12-06 05:45:38,098 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=20, PETRI_TRANSITIONS=19} [2022-12-06 05:45:38,098 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 05:45:38,099 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:38,099 INFO L89 Accepts]: Start accepts. Operand has 20 places, 19 transitions, 57 flow [2022-12-06 05:45:38,100 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:38,100 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:38,101 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-06 05:45:38,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 19 transitions, 57 flow [2022-12-06 05:45:38,107 INFO L130 PetriNetUnfolder]: 8/31 cut-off events. [2022-12-06 05:45:38,107 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:45:38,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 8/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 47 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 25. Up to 10 conditions per place. [2022-12-06 05:45:38,108 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-06 05:45:38,108 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 05:45:38,109 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:45:38,110 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 05:45:38,111 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2022-12-06 05:45:38,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:38,111 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:38,111 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:38,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:45:38,111 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:38,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:38,112 INFO L85 PathProgramCache]: Analyzing trace with hash -759918174, now seen corresponding path program 1 times [2022-12-06 05:45:38,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:38,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900725261] [2022-12-06 05:45:38,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:38,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:38,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:38,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900725261] [2022-12-06 05:45:38,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900725261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:38,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:38,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:45:38,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505939543] [2022-12-06 05:45:38,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:38,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:45:38,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:38,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:45:38,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:45:38,278 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 05:45:38,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 57 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:38,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:38,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 05:45:38,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:38,373 INFO L130 PetriNetUnfolder]: 74/142 cut-off events. [2022-12-06 05:45:38,373 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-06 05:45:38,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 142 events. 74/142 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 475 event pairs, 21 based on Foata normal form. 8/147 useless extension candidates. Maximal degree in co-relation 128. Up to 82 conditions per place. [2022-12-06 05:45:38,375 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 28 selfloop transitions, 4 changer transitions 2/35 dead transitions. [2022-12-06 05:45:38,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 35 transitions, 170 flow [2022-12-06 05:45:38,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:45:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:45:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 05:45:38,377 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2022-12-06 05:45:38,377 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 4 states and 36 transitions. [2022-12-06 05:45:38,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 35 transitions, 170 flow [2022-12-06 05:45:38,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 35 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:45:38,379 INFO L231 Difference]: Finished difference. Result has 24 places, 21 transitions, 81 flow [2022-12-06 05:45:38,379 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=81, PETRI_PLACES=24, PETRI_TRANSITIONS=21} [2022-12-06 05:45:38,380 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-06 05:45:38,380 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:38,380 INFO L89 Accepts]: Start accepts. Operand has 24 places, 21 transitions, 81 flow [2022-12-06 05:45:38,382 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:38,382 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:38,382 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 21 transitions, 81 flow [2022-12-06 05:45:38,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 21 transitions, 81 flow [2022-12-06 05:45:38,388 INFO L130 PetriNetUnfolder]: 7/35 cut-off events. [2022-12-06 05:45:38,389 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2022-12-06 05:45:38,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 35 events. 7/35 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 63 event pairs, 0 based on Foata normal form. 1/33 useless extension candidates. Maximal degree in co-relation 40. Up to 11 conditions per place. [2022-12-06 05:45:38,389 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 21 transitions, 81 flow [2022-12-06 05:45:38,389 INFO L188 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-06 05:45:38,577 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:38,578 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 05:45:38,578 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 79 flow [2022-12-06 05:45:38,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:38,578 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:38,579 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:38,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:45:38,579 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:38,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:38,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1410610101, now seen corresponding path program 1 times [2022-12-06 05:45:38,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:38,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83183107] [2022-12-06 05:45:38,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:38,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:38,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:38,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:38,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83183107] [2022-12-06 05:45:38,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83183107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:38,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:38,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:45:38,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868073921] [2022-12-06 05:45:38,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:38,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:45:38,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:38,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:45:38,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:45:38,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:45:38,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 79 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:38,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:38,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:45:38,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:38,775 INFO L130 PetriNetUnfolder]: 68/127 cut-off events. [2022-12-06 05:45:38,775 INFO L131 PetriNetUnfolder]: For 160/160 co-relation queries the response was YES. [2022-12-06 05:45:38,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 127 events. 68/127 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 348 event pairs, 15 based on Foata normal form. 10/136 useless extension candidates. Maximal degree in co-relation 210. Up to 72 conditions per place. [2022-12-06 05:45:38,785 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 26 selfloop transitions, 4 changer transitions 4/34 dead transitions. [2022-12-06 05:45:38,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 34 transitions, 189 flow [2022-12-06 05:45:38,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:45:38,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:45:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 05:45:38,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-06 05:45:38,787 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 79 flow. Second operand 4 states and 36 transitions. [2022-12-06 05:45:38,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 34 transitions, 189 flow [2022-12-06 05:45:38,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 34 transitions, 166 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-06 05:45:38,791 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 84 flow [2022-12-06 05:45:38,792 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2022-12-06 05:45:38,793 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 05:45:38,793 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:38,793 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 84 flow [2022-12-06 05:45:38,794 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:38,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:38,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 84 flow [2022-12-06 05:45:38,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 84 flow [2022-12-06 05:45:38,799 INFO L130 PetriNetUnfolder]: 7/28 cut-off events. [2022-12-06 05:45:38,799 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 05:45:38,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 28 events. 7/28 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 43. Up to 11 conditions per place. [2022-12-06 05:45:38,800 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 84 flow [2022-12-06 05:45:38,801 INFO L188 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-06 05:45:38,803 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:38,807 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 05:45:38,807 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 67 flow [2022-12-06 05:45:38,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:38,808 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:38,808 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:38,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:45:38,808 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:38,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:38,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1029282063, now seen corresponding path program 2 times [2022-12-06 05:45:38,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:38,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938527256] [2022-12-06 05:45:38,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:38,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:38,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:38,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938527256] [2022-12-06 05:45:38,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938527256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:38,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:38,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:45:38,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171237078] [2022-12-06 05:45:38,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:38,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:45:38,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:38,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:45:38,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:45:38,890 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 05:45:38,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 67 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:38,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:38,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 05:45:38,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:38,969 INFO L130 PetriNetUnfolder]: 53/107 cut-off events. [2022-12-06 05:45:38,969 INFO L131 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2022-12-06 05:45:38,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 107 events. 53/107 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 264 event pairs, 14 based on Foata normal form. 4/110 useless extension candidates. Maximal degree in co-relation 297. Up to 64 conditions per place. [2022-12-06 05:45:38,970 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 27 selfloop transitions, 3 changer transitions 2/32 dead transitions. [2022-12-06 05:45:38,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 32 transitions, 173 flow [2022-12-06 05:45:38,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:45:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:45:38,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-12-06 05:45:38,972 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-06 05:45:38,972 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 67 flow. Second operand 4 states and 33 transitions. [2022-12-06 05:45:38,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 32 transitions, 173 flow [2022-12-06 05:45:38,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 32 transitions, 164 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 05:45:38,973 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 80 flow [2022-12-06 05:45:38,973 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2022-12-06 05:45:38,974 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 7 predicate places. [2022-12-06 05:45:38,974 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:38,974 INFO L89 Accepts]: Start accepts. Operand has 28 places, 19 transitions, 80 flow [2022-12-06 05:45:38,975 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:38,975 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:38,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 19 transitions, 80 flow [2022-12-06 05:45:38,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 80 flow [2022-12-06 05:45:38,979 INFO L130 PetriNetUnfolder]: 5/28 cut-off events. [2022-12-06 05:45:38,979 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 05:45:38,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 28 events. 5/28 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 35 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 42. Up to 8 conditions per place. [2022-12-06 05:45:38,980 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 80 flow [2022-12-06 05:45:38,980 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 05:45:38,980 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:45:38,981 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 05:45:38,981 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 80 flow [2022-12-06 05:45:38,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:38,981 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:38,981 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:38,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:45:38,982 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:38,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:38,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1153767717, now seen corresponding path program 3 times [2022-12-06 05:45:38,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:38,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135123388] [2022-12-06 05:45:38,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:38,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:39,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:39,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:39,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135123388] [2022-12-06 05:45:39,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135123388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:39,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:39,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:45:39,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017305530] [2022-12-06 05:45:39,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:39,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:45:39,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:39,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:45:39,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:45:39,067 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 05:45:39,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:39,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:39,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 05:45:39,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:39,117 INFO L130 PetriNetUnfolder]: 39/79 cut-off events. [2022-12-06 05:45:39,118 INFO L131 PetriNetUnfolder]: For 145/145 co-relation queries the response was YES. [2022-12-06 05:45:39,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 79 events. 39/79 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 150 event pairs, 14 based on Foata normal form. 6/84 useless extension candidates. Maximal degree in co-relation 120. Up to 64 conditions per place. [2022-12-06 05:45:39,119 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 2/26 dead transitions. [2022-12-06 05:45:39,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 156 flow [2022-12-06 05:45:39,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:45:39,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:45:39,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-06 05:45:39,120 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39705882352941174 [2022-12-06 05:45:39,120 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 80 flow. Second operand 4 states and 27 transitions. [2022-12-06 05:45:39,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 156 flow [2022-12-06 05:45:39,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 26 transitions, 140 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 05:45:39,122 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 66 flow [2022-12-06 05:45:39,122 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2022-12-06 05:45:39,122 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2022-12-06 05:45:39,122 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:39,123 INFO L89 Accepts]: Start accepts. Operand has 27 places, 18 transitions, 66 flow [2022-12-06 05:45:39,123 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:39,123 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:39,124 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 18 transitions, 66 flow [2022-12-06 05:45:39,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 18 transitions, 66 flow [2022-12-06 05:45:39,127 INFO L130 PetriNetUnfolder]: 4/19 cut-off events. [2022-12-06 05:45:39,127 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 05:45:39,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 19 events. 4/19 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 6 conditions per place. [2022-12-06 05:45:39,127 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 18 transitions, 66 flow [2022-12-06 05:45:39,128 INFO L188 LiptonReduction]: Number of co-enabled transitions 34 [2022-12-06 05:45:39,134 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [475] $Ultimate##0-->L59-2: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1] and [774] $Ultimate##0-->L49-2: Formula: (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| 0)) (= v_~x1~0_60 (select (select |v_#memory_int_151| v_~f~0.base_97) (+ (* v_~x1~0_61 4) v_~f~0.offset_97))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (= |v_thread1Thread1of1ForFork0_~i~0#1_51| 1) (= (ite (and (< v_~x1~0_61 v_~size~0_119) (<= 0 v_~x1~0_61)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_51| 4294967295) 4294967296) (mod (* v_~n~0_84 5) 4294967296))) InVars {~size~0=v_~size~0_119, ~f~0.base=v_~f~0.base_97, #memory_int=|v_#memory_int_151|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_61, ~f~0.offset=v_~f~0.offset_97} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_25|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, ~size~0=v_~size~0_119, ~f~0.base=v_~f~0.base_97, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_51|, #memory_int=|v_#memory_int_151|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31|, ~n~0=v_~n~0_84, ~x1~0=v_~x1~0_60, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_37|, ~f~0.offset=v_~f~0.offset_97} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:45:39,188 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:39,189 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 05:45:39,189 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 62 flow [2022-12-06 05:45:39,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:39,189 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:39,189 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:39,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:45:39,189 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:39,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:39,190 INFO L85 PathProgramCache]: Analyzing trace with hash 733568056, now seen corresponding path program 1 times [2022-12-06 05:45:39,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:39,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717811908] [2022-12-06 05:45:39,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:39,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:45:39,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:39,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717811908] [2022-12-06 05:45:39,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717811908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:39,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:39,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:45:39,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554349523] [2022-12-06 05:45:39,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:39,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:45:39,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:39,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:45:39,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:45:39,362 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 05:45:39,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:39,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:39,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 05:45:39,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:39,435 INFO L130 PetriNetUnfolder]: 36/68 cut-off events. [2022-12-06 05:45:39,435 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-06 05:45:39,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 68 events. 36/68 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 121 event pairs, 6 based on Foata normal form. 6/73 useless extension candidates. Maximal degree in co-relation 150. Up to 55 conditions per place. [2022-12-06 05:45:39,436 INFO L137 encePairwiseOnDemand]: 12/16 looper letters, 19 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2022-12-06 05:45:39,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 22 transitions, 128 flow [2022-12-06 05:45:39,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:45:39,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:45:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2022-12-06 05:45:39,437 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.328125 [2022-12-06 05:45:39,437 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 62 flow. Second operand 4 states and 21 transitions. [2022-12-06 05:45:39,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 22 transitions, 128 flow [2022-12-06 05:45:39,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 22 transitions, 117 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-06 05:45:39,438 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 69 flow [2022-12-06 05:45:39,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=69, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2022-12-06 05:45:39,439 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-06 05:45:39,439 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:39,439 INFO L89 Accepts]: Start accepts. Operand has 24 places, 18 transitions, 69 flow [2022-12-06 05:45:39,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:39,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:39,440 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 18 transitions, 69 flow [2022-12-06 05:45:39,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 18 transitions, 69 flow [2022-12-06 05:45:39,444 INFO L130 PetriNetUnfolder]: 6/25 cut-off events. [2022-12-06 05:45:39,444 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 05:45:39,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 25 events. 6/25 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 1 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 37. Up to 10 conditions per place. [2022-12-06 05:45:39,444 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 18 transitions, 69 flow [2022-12-06 05:45:39,444 INFO L188 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-06 05:45:39,456 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:45:39,457 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 05:45:39,457 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 69 flow [2022-12-06 05:45:39,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:39,457 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:39,457 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:39,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:45:39,458 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:39,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:39,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1377289343, now seen corresponding path program 1 times [2022-12-06 05:45:39,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:39,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800503550] [2022-12-06 05:45:39,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:39,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:39,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:45:39,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:39,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800503550] [2022-12-06 05:45:39,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800503550] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:39,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120666640] [2022-12-06 05:45:39,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:39,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:39,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:39,711 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:39,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:45:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:39,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 05:45:39,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:39,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 05:45:40,012 INFO L321 Elim1Store]: treesize reduction 69, result has 44.4 percent of original size [2022-12-06 05:45:40,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 91 treesize of output 87 [2022-12-06 05:45:40,075 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-06 05:45:40,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:40,306 INFO L321 Elim1Store]: treesize reduction 5, result has 96.8 percent of original size [2022-12-06 05:45:40,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 122 treesize of output 193 [2022-12-06 05:45:41,796 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-06 05:45:41,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120666640] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:41,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:41,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-06 05:45:41,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020657911] [2022-12-06 05:45:41,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:41,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:45:41,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:41,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:45:41,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:45:41,799 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 05:45:41,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 69 flow. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 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-06 05:45:41,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:41,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 05:45:41,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:42,694 INFO L130 PetriNetUnfolder]: 111/204 cut-off events. [2022-12-06 05:45:42,694 INFO L131 PetriNetUnfolder]: For 116/116 co-relation queries the response was YES. [2022-12-06 05:45:42,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 204 events. 111/204 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 584 event pairs, 0 based on Foata normal form. 17/221 useless extension candidates. Maximal degree in co-relation 191. Up to 97 conditions per place. [2022-12-06 05:45:42,696 INFO L137 encePairwiseOnDemand]: 8/16 looper letters, 42 selfloop transitions, 11 changer transitions 23/76 dead transitions. [2022-12-06 05:45:42,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 76 transitions, 449 flow [2022-12-06 05:45:42,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:45:42,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:45:42,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 78 transitions. [2022-12-06 05:45:42,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2867647058823529 [2022-12-06 05:45:42,701 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 69 flow. Second operand 17 states and 78 transitions. [2022-12-06 05:45:42,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 76 transitions, 449 flow [2022-12-06 05:45:42,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 76 transitions, 437 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 05:45:42,704 INFO L231 Difference]: Finished difference. Result has 48 places, 25 transitions, 160 flow [2022-12-06 05:45:42,704 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=160, PETRI_PLACES=48, PETRI_TRANSITIONS=25} [2022-12-06 05:45:42,707 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 27 predicate places. [2022-12-06 05:45:42,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:42,707 INFO L89 Accepts]: Start accepts. Operand has 48 places, 25 transitions, 160 flow [2022-12-06 05:45:42,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:42,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:42,709 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 25 transitions, 160 flow [2022-12-06 05:45:42,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 25 transitions, 160 flow [2022-12-06 05:45:42,718 INFO L130 PetriNetUnfolder]: 11/49 cut-off events. [2022-12-06 05:45:42,718 INFO L131 PetriNetUnfolder]: For 66/67 co-relation queries the response was YES. [2022-12-06 05:45:42,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 49 events. 11/49 cut-off events. For 66/67 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 91 event pairs, 3 based on Foata normal form. 1/49 useless extension candidates. Maximal degree in co-relation 156. Up to 21 conditions per place. [2022-12-06 05:45:42,719 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 25 transitions, 160 flow [2022-12-06 05:45:42,719 INFO L188 LiptonReduction]: Number of co-enabled transitions 52 [2022-12-06 05:45:45,016 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:45:45,017 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2310 [2022-12-06 05:45:45,017 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 22 transitions, 144 flow [2022-12-06 05:45:45,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 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-06 05:45:45,017 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:45,017 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:45,023 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-06 05:45:45,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:45,227 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:45,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:45,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1379591520, now seen corresponding path program 1 times [2022-12-06 05:45:45,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:45,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718457983] [2022-12-06 05:45:45,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:45,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:45,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:45:45,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:45,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718457983] [2022-12-06 05:45:45,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718457983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:45:45,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:45:45,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:45:45,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233669627] [2022-12-06 05:45:45,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:45:45,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:45:45,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:45,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:45:45,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:45:45,499 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 05:45:45,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 22 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:45,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:45,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 05:45:45,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:45,568 INFO L130 PetriNetUnfolder]: 72/141 cut-off events. [2022-12-06 05:45:45,568 INFO L131 PetriNetUnfolder]: For 425/425 co-relation queries the response was YES. [2022-12-06 05:45:45,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 141 events. 72/141 cut-off events. For 425/425 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 372 event pairs, 23 based on Foata normal form. 6/146 useless extension candidates. Maximal degree in co-relation 606. Up to 117 conditions per place. [2022-12-06 05:45:45,569 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 21 selfloop transitions, 6 changer transitions 1/28 dead transitions. [2022-12-06 05:45:45,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 28 transitions, 246 flow [2022-12-06 05:45:45,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:45:45,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:45:45,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-12-06 05:45:45,570 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3194444444444444 [2022-12-06 05:45:45,570 INFO L175 Difference]: Start difference. First operand has 41 places, 22 transitions, 144 flow. Second operand 4 states and 23 transitions. [2022-12-06 05:45:45,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 28 transitions, 246 flow [2022-12-06 05:45:45,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 206 flow, removed 17 selfloop flow, removed 8 redundant places. [2022-12-06 05:45:45,573 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 142 flow [2022-12-06 05:45:45,573 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2022-12-06 05:45:45,573 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 16 predicate places. [2022-12-06 05:45:45,573 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:45,573 INFO L89 Accepts]: Start accepts. Operand has 37 places, 23 transitions, 142 flow [2022-12-06 05:45:45,575 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:45,575 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:45,575 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 23 transitions, 142 flow [2022-12-06 05:45:45,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 23 transitions, 142 flow [2022-12-06 05:45:45,583 INFO L130 PetriNetUnfolder]: 12/50 cut-off events. [2022-12-06 05:45:45,583 INFO L131 PetriNetUnfolder]: For 73/75 co-relation queries the response was YES. [2022-12-06 05:45:45,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 50 events. 12/50 cut-off events. For 73/75 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 99 event pairs, 3 based on Foata normal form. 1/51 useless extension candidates. Maximal degree in co-relation 96. Up to 22 conditions per place. [2022-12-06 05:45:45,584 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 23 transitions, 142 flow [2022-12-06 05:45:45,584 INFO L188 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-06 05:45:45,584 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:45:45,585 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 05:45:45,585 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 142 flow [2022-12-06 05:45:45,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:45,586 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:45,586 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:45,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:45:45,586 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:45,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:45,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1440845469, now seen corresponding path program 1 times [2022-12-06 05:45:45,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:45,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971947210] [2022-12-06 05:45:45,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:45,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:45,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:45:45,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:45,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971947210] [2022-12-06 05:45:45,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971947210] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:45,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025679314] [2022-12-06 05:45:45,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:45,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:45,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:45,904 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:45,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:45:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:45,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 05:45:45,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:46,169 INFO L321 Elim1Store]: treesize reduction 45, result has 68.1 percent of original size [2022-12-06 05:45:46,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 97 treesize of output 128 [2022-12-06 05:45:46,537 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-06 05:45:46,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:46,740 INFO L321 Elim1Store]: treesize reduction 5, result has 96.8 percent of original size [2022-12-06 05:45:46,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 122 treesize of output 193 [2022-12-06 05:45:48,149 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-06 05:45:48,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025679314] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:48,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:48,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-06 05:45:48,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018765698] [2022-12-06 05:45:48,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:48,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:45:48,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:48,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:45:48,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:45:48,152 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 05:45:48,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 142 flow. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:48,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:48,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 05:45:48,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:48,493 INFO L130 PetriNetUnfolder]: 77/151 cut-off events. [2022-12-06 05:45:48,494 INFO L131 PetriNetUnfolder]: For 350/350 co-relation queries the response was YES. [2022-12-06 05:45:48,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 151 events. 77/151 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 412 event pairs, 8 based on Foata normal form. 7/158 useless extension candidates. Maximal degree in co-relation 328. Up to 69 conditions per place. [2022-12-06 05:45:48,495 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 20 selfloop transitions, 4 changer transitions 25/49 dead transitions. [2022-12-06 05:45:48,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 369 flow [2022-12-06 05:45:48,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:45:48,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:45:48,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2022-12-06 05:45:48,496 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-06 05:45:48,496 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 142 flow. Second operand 10 states and 45 transitions. [2022-12-06 05:45:48,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 369 flow [2022-12-06 05:45:48,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 347 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 05:45:48,498 INFO L231 Difference]: Finished difference. Result has 46 places, 19 transitions, 105 flow [2022-12-06 05:45:48,499 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=105, PETRI_PLACES=46, PETRI_TRANSITIONS=19} [2022-12-06 05:45:48,499 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2022-12-06 05:45:48,499 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:45:48,499 INFO L89 Accepts]: Start accepts. Operand has 46 places, 19 transitions, 105 flow [2022-12-06 05:45:48,500 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:45:48,500 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:45:48,500 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 19 transitions, 105 flow [2022-12-06 05:45:48,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 19 transitions, 105 flow [2022-12-06 05:45:48,506 INFO L130 PetriNetUnfolder]: 9/31 cut-off events. [2022-12-06 05:45:48,506 INFO L131 PetriNetUnfolder]: For 59/60 co-relation queries the response was YES. [2022-12-06 05:45:48,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 31 events. 9/31 cut-off events. For 59/60 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 3 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 95. Up to 15 conditions per place. [2022-12-06 05:45:48,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 19 transitions, 105 flow [2022-12-06 05:45:48,506 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 05:45:48,507 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:45:48,507 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 05:45:48,508 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 19 transitions, 105 flow [2022-12-06 05:45:48,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:48,508 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:45:48,508 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:45:48,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:45:48,714 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,SelfDestructingSolverStorable9 [2022-12-06 05:45:48,715 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:45:48,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:45:48,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1160221917, now seen corresponding path program 1 times [2022-12-06 05:45:48,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:45:48,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435300140] [2022-12-06 05:45:48,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:48,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:45:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:49,077 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-06 05:45:49,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:45:49,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435300140] [2022-12-06 05:45:49,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435300140] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:45:49,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498372215] [2022-12-06 05:45:49,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:45:49,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:45:49,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:45:49,080 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:45:49,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:45:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:45:49,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-06 05:45:49,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:45:49,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:45:49,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2022-12-06 05:45:49,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:45:49,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:45:49,594 INFO L321 Elim1Store]: treesize reduction 63, result has 22.2 percent of original size [2022-12-06 05:45:49,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 56 [2022-12-06 05:45:49,637 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-06 05:45:49,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:45:50,402 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-06 05:45:50,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498372215] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:45:50,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:45:50,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-06 05:45:50,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661423709] [2022-12-06 05:45:50,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:45:50,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 05:45:50,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:45:50,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 05:45:50,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=391, Unknown=2, NotChecked=0, Total=462 [2022-12-06 05:45:50,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 05:45:50,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 19 transitions, 105 flow. Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:45:50,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:45:50,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 05:45:50,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:45:53,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:46:03,830 INFO L130 PetriNetUnfolder]: 295/532 cut-off events. [2022-12-06 05:46:03,830 INFO L131 PetriNetUnfolder]: For 1448/1448 co-relation queries the response was YES. [2022-12-06 05:46:03,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2229 conditions, 532 events. 295/532 cut-off events. For 1448/1448 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2204 event pairs, 5 based on Foata normal form. 31/563 useless extension candidates. Maximal degree in co-relation 2201. Up to 264 conditions per place. [2022-12-06 05:46:03,834 INFO L137 encePairwiseOnDemand]: 6/16 looper letters, 94 selfloop transitions, 81 changer transitions 3/178 dead transitions. [2022-12-06 05:46:03,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 178 transitions, 1371 flow [2022-12-06 05:46:03,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-06 05:46:03,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-12-06 05:46:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 172 transitions. [2022-12-06 05:46:03,836 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2986111111111111 [2022-12-06 05:46:03,836 INFO L175 Difference]: Start difference. First operand has 39 places, 19 transitions, 105 flow. Second operand 36 states and 172 transitions. [2022-12-06 05:46:03,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 178 transitions, 1371 flow [2022-12-06 05:46:03,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 178 transitions, 1210 flow, removed 55 selfloop flow, removed 11 redundant places. [2022-12-06 05:46:03,844 INFO L231 Difference]: Finished difference. Result has 82 places, 101 transitions, 913 flow [2022-12-06 05:46:03,844 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=913, PETRI_PLACES=82, PETRI_TRANSITIONS=101} [2022-12-06 05:46:03,845 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 61 predicate places. [2022-12-06 05:46:03,845 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:03,845 INFO L89 Accepts]: Start accepts. Operand has 82 places, 101 transitions, 913 flow [2022-12-06 05:46:03,846 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:03,846 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:03,846 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 101 transitions, 913 flow [2022-12-06 05:46:03,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 101 transitions, 913 flow [2022-12-06 05:46:03,887 INFO L130 PetriNetUnfolder]: 117/293 cut-off events. [2022-12-06 05:46:03,887 INFO L131 PetriNetUnfolder]: For 1481/1508 co-relation queries the response was YES. [2022-12-06 05:46:03,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 293 events. 117/293 cut-off events. For 1481/1508 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1432 event pairs, 9 based on Foata normal form. 2/281 useless extension candidates. Maximal degree in co-relation 1397. Up to 160 conditions per place. [2022-12-06 05:46:03,891 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 101 transitions, 913 flow [2022-12-06 05:46:03,891 INFO L188 LiptonReduction]: Number of co-enabled transitions 212 [2022-12-06 05:46:03,900 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] and [725] L92-4-->L93-1: Formula: (= (select (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t1~0#1.base_27|) |v_ULTIMATE.start_main_~#t1~0#1.offset_27|) |v_ULTIMATE.start_main_#t~mem20#1_10|) InVars {#memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_27|} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~nondet19#1] [2022-12-06 05:46:04,060 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:46:04,766 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [725] L92-4-->L93-1: Formula: (= (select (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t1~0#1.base_27|) |v_ULTIMATE.start_main_~#t1~0#1.offset_27|) |v_ULTIMATE.start_main_#t~mem20#1_10|) InVars {#memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_27|} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~nondet19#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:46:04,914 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [725] L92-4-->L93-1: Formula: (= (select (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t1~0#1.base_27|) |v_ULTIMATE.start_main_~#t1~0#1.offset_27|) |v_ULTIMATE.start_main_#t~mem20#1_10|) InVars {#memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_27|} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~nondet19#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:46:05,316 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:46:08,026 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:46:08,699 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] and [725] L92-4-->L93-1: Formula: (= (select (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t1~0#1.base_27|) |v_ULTIMATE.start_main_~#t1~0#1.offset_27|) |v_ULTIMATE.start_main_#t~mem20#1_10|) InVars {#memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_27|} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~nondet19#1] [2022-12-06 05:46:08,853 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] $Ultimate##0-->L49-2: Formula: (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_61| 4294967295) 4294967296) (mod (* v_~n~0_90 5) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_61| 1) (= (ite (and (< v_~x1~0_69 v_~size~0_123) (<= 0 v_~x1~0_69)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork1_~i~1#1_163| 0) (= (select (select |v_#memory_int_155| v_~f~0.base_101) (+ v_~f~0.offset_101 (* v_~x1~0_69 4))) v_~x1~0_68) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|)) InVars {~size~0=v_~size~0_123, ~f~0.base=v_~f~0.base_101, #memory_int=|v_#memory_int_155|, ~n~0=v_~n~0_90, ~x1~0=v_~x1~0_69, ~f~0.offset=v_~f~0.offset_101} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_123, ~f~0.base=v_~f~0.base_101, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_61|, #memory_int=|v_#memory_int_155|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_163|, ~n~0=v_~n~0_90, ~x1~0=v_~x1~0_68, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_41|, ~f~0.offset=v_~f~0.offset_101} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:46:09,423 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] $Ultimate##0-->L49-2: Formula: (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_61| 4294967295) 4294967296) (mod (* v_~n~0_90 5) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_61| 1) (= (ite (and (< v_~x1~0_69 v_~size~0_123) (<= 0 v_~x1~0_69)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) (= |v_thread2Thread1of1ForFork1_~i~1#1_163| 0) (= (select (select |v_#memory_int_155| v_~f~0.base_101) (+ v_~f~0.offset_101 (* v_~x1~0_69 4))) v_~x1~0_68) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|)) InVars {~size~0=v_~size~0_123, ~f~0.base=v_~f~0.base_101, #memory_int=|v_#memory_int_155|, ~n~0=v_~n~0_90, ~x1~0=v_~x1~0_69, ~f~0.offset=v_~f~0.offset_101} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_29|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|, ~size~0=v_~size~0_123, ~f~0.base=v_~f~0.base_101, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_61|, #memory_int=|v_#memory_int_155|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_163|, ~n~0=v_~n~0_90, ~x1~0=v_~x1~0_68, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_41|, ~f~0.offset=v_~f~0.offset_101} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:46:09,898 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [808] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_223| v_~f~0.base_151))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_151 (* v_~x2~0_243 4))))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_151 (* .cse1 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_151 (* .cse4 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_151 (* .cse0 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_167)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_167)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_151 (* 4 .cse3))) v_~x2~0_242) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_85| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|) (not (= (ite (and (< v_~x2~0_243 v_~size~0_167) (<= 0 v_~x2~0_243)) 1 0) 0)) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_224|) (= v_~x1~0_154 (select .cse2 (+ v_~f~0.offset_151 (* v_~x1~0_155 4)))) (= (ite (and (< v_~x1~0_155 v_~size~0_167) (<= 0 v_~x1~0_155)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_163| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_167)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_201| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_163| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_201|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_85| 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_167)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_125| 1) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_125| 4294967295) 4294967296) (mod (* 5 v_~n~0_134) 4294967296)))))))) InVars {~x2~0=v_~x2~0_243, ~size~0=v_~size~0_167, ~f~0.base=v_~f~0.base_151, #memory_int=|v_#memory_int_223|, ~n~0=v_~n~0_134, ~x1~0=v_~x1~0_155, ~f~0.offset=v_~f~0.offset_151} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_79|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_55|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_59|, ~f~0.base=v_~f~0.base_151, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_57|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_163|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_224|, ~x1~0=v_~x1~0_154, ~f~0.offset=v_~f~0.offset_151, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_55|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_85|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_67|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_61|, ~x2~0=v_~x2~0_242, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_53|, ~size~0=v_~size~0_167, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_69|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_201|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_71|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_75|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_125|, #memory_int=|v_#memory_int_223|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_57|, ~n~0=v_~n~0_134, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_91|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:46:11,681 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [805] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_219| v_~f~0.base_147))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_147 (* v_~x1~0_144 4))))) (and (not (= (ite (and (< v_~x1~0_144 v_~size~0_163) (<= 0 v_~x1~0_144)) 1 0) 0)) (= v_~x1~0_142 (select .cse0 (+ v_~f~0.offset_147 (* 4 .cse1)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_117| 2) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_163)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) (= |v_thread2Thread1of1ForFork1_~i~1#1_220| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_77| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) (< 1 (mod (* 5 v_~n~0_130) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_77| 0))))) InVars {~size~0=v_~size~0_163, ~f~0.base=v_~f~0.base_147, #memory_int=|v_#memory_int_219|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_144, ~f~0.offset=v_~f~0.offset_147} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_71|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|, ~size~0=v_~size~0_163, ~f~0.base=v_~f~0.base_147, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_117|, #memory_int=|v_#memory_int_219|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_77|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_220|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_142, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_83|, ~f~0.offset=v_~f~0.offset_147} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [788] L92-4-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_187| v_~f~0.base_121))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_121 (* v_~x2~0_213 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_121 (* .cse1 4))))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_121 (* .cse0 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_121 (* .cse4 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_187| 0)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_139)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_139) (<= 0 .cse1)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_149| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_187|) (not (= (ite (and (<= 0 v_~x2~0_213) (< v_~x2~0_213 v_~size~0_139)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_193| 4294967296) (mod (* 5 v_~n~0_106) 4294967296)) (= v_~x2~0_212 (select .cse2 (+ v_~f~0.offset_121 (* 4 .cse3)))) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_139)) 1 0) 0)) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_139)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_149|) (= |v_thread2Thread1of1ForFork1_~i~1#1_192| (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_193|)) (= (select (select |v_#memory_int_187| |v_ULTIMATE.start_main_~#t1~0#1.base_55|) |v_ULTIMATE.start_main_~#t1~0#1.offset_55|) |v_ULTIMATE.start_main_#t~mem20#1_36|))))))) InVars {~x2~0=v_~x2~0_213, ~size~0=v_~size~0_139, ~f~0.base=v_~f~0.base_121, #memory_int=|v_#memory_int_187|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_193|, ~n~0=v_~n~0_106, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_55|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, ~f~0.offset=v_~f~0.offset_121} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_43|, ~x2~0=v_~x2~0_212, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_41|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_45|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_39|, ~size~0=v_~size~0_139, ~f~0.base=v_~f~0.base_121, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_55|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_43|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_149|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_192|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_55|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, ~f~0.offset=v_~f~0.offset_121, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_187|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_36|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_41|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_61|, #memory_int=|v_#memory_int_187|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_43|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_53|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_28|, ~n~0=v_~n~0_106, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_47|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem20#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, ULTIMATE.start_main_#t~nondet19#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:46:12,033 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [805] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_219| v_~f~0.base_147))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_147 (* v_~x1~0_144 4))))) (and (not (= (ite (and (< v_~x1~0_144 v_~size~0_163) (<= 0 v_~x1~0_144)) 1 0) 0)) (= v_~x1~0_142 (select .cse0 (+ v_~f~0.offset_147 (* 4 .cse1)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_117| 2) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_163)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) (= |v_thread2Thread1of1ForFork1_~i~1#1_220| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_77| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) (< 1 (mod (* 5 v_~n~0_130) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_77| 0))))) InVars {~size~0=v_~size~0_163, ~f~0.base=v_~f~0.base_147, #memory_int=|v_#memory_int_219|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_144, ~f~0.offset=v_~f~0.offset_147} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_71|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|, ~size~0=v_~size~0_163, ~f~0.base=v_~f~0.base_147, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_117|, #memory_int=|v_#memory_int_219|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_77|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_220|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_142, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_83|, ~f~0.offset=v_~f~0.offset_147} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [789] L92-4-->L49-2: Formula: (and (= v_~x1~0_104 (select (select |v_#memory_int_189| v_~f~0.base_123) (+ v_~f~0.offset_123 (* v_~x1~0_105 4)))) (= (ite (and (<= 0 v_~x1~0_105) (< v_~x1~0_105 v_~size~0_141)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_43|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_57| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_43|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_57| 0)) (= |v_ULTIMATE.start_main_#t~mem20#1_38| (select (select |v_#memory_int_189| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) |v_ULTIMATE.start_main_~#t1~0#1.offset_57|)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_86| 1) |v_thread1Thread1of1ForFork0_~i~0#1_85|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_86| 4294967296) (mod (* 5 v_~n~0_108) 4294967296))) InVars {~size~0=v_~size~0_141, ~f~0.base=v_~f~0.base_123, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_86|, #memory_int=|v_#memory_int_189|, ~n~0=v_~n~0_108, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~x1~0=v_~x1~0_105, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_57|, ~f~0.offset=v_~f~0.offset_123} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_45|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_51|, ~size~0=v_~size~0_141, ~f~0.base=v_~f~0.base_123, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~x1~0=v_~x1~0_104, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_57|, ~f~0.offset=v_~f~0.offset_123, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_38|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_43|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_85|, #memory_int=|v_#memory_int_189|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_57|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_30|, ~n~0=v_~n~0_108, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_63|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~mem20#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet19#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:46:12,390 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [805] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_219| v_~f~0.base_147))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_147 (* v_~x1~0_144 4))))) (and (not (= (ite (and (< v_~x1~0_144 v_~size~0_163) (<= 0 v_~x1~0_144)) 1 0) 0)) (= v_~x1~0_142 (select .cse0 (+ v_~f~0.offset_147 (* 4 .cse1)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_117| 2) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_163)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) (= |v_thread2Thread1of1ForFork1_~i~1#1_220| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_77| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|) (< 1 (mod (* 5 v_~n~0_130) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_77| 0))))) InVars {~size~0=v_~size~0_163, ~f~0.base=v_~f~0.base_147, #memory_int=|v_#memory_int_219|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_144, ~f~0.offset=v_~f~0.offset_147} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_71|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_63|, ~size~0=v_~size~0_163, ~f~0.base=v_~f~0.base_147, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_117|, #memory_int=|v_#memory_int_219|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_77|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_220|, ~n~0=v_~n~0_130, ~x1~0=v_~x1~0_142, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_83|, ~f~0.offset=v_~f~0.offset_147} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:46:12,856 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [815] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse2 (select |v_#memory_int_231| v_~f~0.base_159))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_159 (* v_~x2~0_257 4))))) (let ((.cse5 (select .cse2 (+ v_~f~0.offset_159 (* .cse4 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_159 (* .cse5 4))))) (let ((.cse1 (mod (* 5 v_~n~0_142) 4294967296)) (.cse0 (select .cse2 (+ v_~f~0.offset_159 (* .cse3 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_171| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_175)) 1 0)) (= (ite (and (< v_~x1~0_175 v_~size~0_175) (<= 0 v_~x1~0_175)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (not (= (ite (and (< v_~x2~0_257 v_~size~0_175) (<= 0 v_~x2~0_257)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_97| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_234| 4294967296) .cse1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_97| 0)) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_234|) (= (select .cse2 (+ v_~f~0.offset_159 (* v_~x1~0_175 4))) v_~x1~0_174) (not (= 0 (ite (and (< .cse3 v_~size~0_175) (<= 0 .cse3)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_171| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_209|) (not (= (ite (and (< .cse4 v_~size~0_175) (<= 0 .cse4)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_209| 0)) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_21|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_139| 4294967295) 4294967296) .cse1) (= |v_thread2Thread1of1ForFork1_#res#1.offset_21| 0) (= (select .cse2 (+ v_~f~0.offset_159 (* .cse0 4))) v_~x2~0_256) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_175)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_139| 1))))))) InVars {~x2~0=v_~x2~0_257, ~size~0=v_~size~0_175, ~f~0.base=v_~f~0.base_159, #memory_int=|v_#memory_int_231|, ~n~0=v_~n~0_142, ~x1~0=v_~x1~0_175, ~f~0.offset=v_~f~0.offset_159} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_91|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_63|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_67|, ~f~0.base=v_~f~0.base_159, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_21|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_65|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_171|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_234|, ~x1~0=v_~x1~0_174, ~f~0.offset=v_~f~0.offset_159, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_63|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_97|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_75|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_69|, ~x2~0=v_~x2~0_256, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_61|, ~size~0=v_~size~0_175, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_77|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_209|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_83|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_21|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_83|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_139|, #memory_int=|v_#memory_int_231|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_65|, ~n~0=v_~n~0_142, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_103|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:46:13,513 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [802] L59-2-->L93-1: Formula: (let ((.cse3 (select |v_#memory_int_215| v_~f~0.base_143))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_143 (* v_~x2~0_235 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_143 (* .cse2 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_143 (* 4 .cse1))))) (let ((.cse4 (select .cse3 (+ (* .cse0 4) v_~f~0.offset_143)))) (and (not (= (ite (and (< .cse0 v_~size~0_159) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_213| 4294967296) (mod (* 5 v_~n~0_126) 4294967296)) (= |v_ULTIMATE.start_main_#t~mem20#1_44| (select (select |v_#memory_int_215| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) |v_ULTIMATE.start_main_~#t1~0#1.offset_63|)) (not (= (ite (and (< .cse1 v_~size~0_159) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_235) (< v_~x2~0_235 v_~size~0_159)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_159)) 1 0) 0)) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_213|) |v_thread2Thread1of1ForFork1_~i~1#1_212|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197|) (= (select .cse3 (+ v_~f~0.offset_143 (* .cse4 4))) v_~x2~0_234) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_159)) 1 0)))))))) InVars {~x2~0=v_~x2~0_235, ~size~0=v_~size~0_159, ~f~0.base=v_~f~0.base_143, #memory_int=|v_#memory_int_215|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_213|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_63|, ~n~0=v_~n~0_126, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_63|, ~f~0.offset=v_~f~0.offset_143} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_51|, ~x2~0=v_~x2~0_234, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_51|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_55|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_49|, ~size~0=v_~size~0_159, ~f~0.base=v_~f~0.base_143, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_65|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_212|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_63|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_63|, ~f~0.offset=v_~f~0.offset_143, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_44|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_51|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_71|, #memory_int=|v_#memory_int_215|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_53|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_63|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_36|, ~n~0=v_~n~0_126, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_57|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ULTIMATE.start_main_#t~mem20#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, ULTIMATE.start_main_#t~nondet19#1, thread2Thread1of1ForFork1_#t~post6#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:46:13,834 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [802] L59-2-->L93-1: Formula: (let ((.cse3 (select |v_#memory_int_215| v_~f~0.base_143))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_143 (* v_~x2~0_235 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_143 (* .cse2 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_143 (* 4 .cse1))))) (let ((.cse4 (select .cse3 (+ (* .cse0 4) v_~f~0.offset_143)))) (and (not (= (ite (and (< .cse0 v_~size~0_159) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_213| 4294967296) (mod (* 5 v_~n~0_126) 4294967296)) (= |v_ULTIMATE.start_main_#t~mem20#1_44| (select (select |v_#memory_int_215| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) |v_ULTIMATE.start_main_~#t1~0#1.offset_63|)) (not (= (ite (and (< .cse1 v_~size~0_159) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_235) (< v_~x2~0_235 v_~size~0_159)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_159)) 1 0) 0)) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_213|) |v_thread2Thread1of1ForFork1_~i~1#1_212|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197|) (= (select .cse3 (+ v_~f~0.offset_143 (* .cse4 4))) v_~x2~0_234) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_159)) 1 0)))))))) InVars {~x2~0=v_~x2~0_235, ~size~0=v_~size~0_159, ~f~0.base=v_~f~0.base_143, #memory_int=|v_#memory_int_215|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_213|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_63|, ~n~0=v_~n~0_126, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_63|, ~f~0.offset=v_~f~0.offset_143} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_51|, ~x2~0=v_~x2~0_234, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_51|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_55|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_49|, ~size~0=v_~size~0_159, ~f~0.base=v_~f~0.base_143, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_65|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_53|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_212|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_63|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_63|, ~f~0.offset=v_~f~0.offset_143, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_44|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_51|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_71|, #memory_int=|v_#memory_int_215|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_53|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_63|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_36|, ~n~0=v_~n~0_126, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_57|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ULTIMATE.start_main_#t~mem20#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, ULTIMATE.start_main_#t~nondet19#1, thread2Thread1of1ForFork1_#t~post6#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:46:14,291 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [803] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_217| v_~f~0.base_145))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_145 (* v_~x2~0_239 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_145 (* 4 .cse4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_145 (* .cse2 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_145 (* .cse3 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_161| (ite (and (< .cse0 v_~size~0_161) (<= 0 .cse0)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_161| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_199|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_75| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_199| 0)) (not (= (ite (and (< v_~x2~0_239 v_~size~0_161) (<= 0 v_~x2~0_239)) 1 0) 0)) (= v_~x1~0_138 (select .cse1 (+ v_~f~0.offset_145 (* v_~x1~0_139 4)))) (= (select .cse1 (+ v_~f~0.offset_145 (* .cse0 4))) v_~x2~0_238) (= (ite (and (< v_~x1~0_139 v_~size~0_161) (<= 0 v_~x1~0_139)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|) (< (mod (+ 4294967291 |v_thread2Thread1of1ForFork1_~i~1#1_216|) 4294967296) (mod (* 5 v_~n~0_128) 4294967296)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_161)) 1 0))) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_216|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_161)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_75| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_115| 1) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_161)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_239, ~size~0=v_~size~0_161, ~f~0.base=v_~f~0.base_145, #memory_int=|v_#memory_int_217|, ~n~0=v_~n~0_128, ~x1~0=v_~x1~0_139, ~f~0.offset=v_~f~0.offset_145} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_69|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_53|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_57|, ~f~0.base=v_~f~0.base_145, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_55|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_161|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_216|, ~x1~0=v_~x1~0_138, ~f~0.offset=v_~f~0.offset_145, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_53|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_75|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_65|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_59|, ~x2~0=v_~x2~0_238, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_51|, ~size~0=v_~size~0_161, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_67|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_199|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_61|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_73|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_115|, #memory_int=|v_#memory_int_217|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_55|, ~n~0=v_~n~0_128, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_81|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:46:16,028 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [801] L59-2-->L59-2: Formula: (let ((.cse9 (select |v_#memory_int_213| v_~f~0.base_141))) (let ((.cse7 (select .cse9 (+ v_~f~0.offset_141 (* v_~x2~0_230 4))))) (let ((.cse1 (select .cse9 (+ v_~f~0.offset_141 (* .cse7 4))))) (let ((.cse6 (select .cse9 (+ v_~f~0.offset_141 (* .cse1 4))))) (let ((.cse4 (select .cse9 (+ v_~f~0.offset_141 (* .cse6 4))))) (let ((.cse3 (select .cse9 (+ v_~f~0.offset_141 (* 4 .cse4))))) (let ((.cse0 (select .cse9 (+ v_~f~0.offset_141 (* .cse3 4))))) (let ((.cse10 (select .cse9 (+ v_~f~0.offset_141 (* .cse0 4))))) (let ((.cse5 (select .cse9 (+ v_~f~0.offset_141 (* .cse10 4))))) (let ((.cse8 (mod (* 5 v_~n~0_124) 4294967296)) (.cse2 (select .cse9 (+ v_~f~0.offset_141 (* .cse5 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_157) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_157)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_193|) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_208| 10) |v_thread2Thread1of1ForFork1_~i~1#1_206|) (not (= (ite (and (<= 0 v_~x2~0_230) (< v_~x2~0_230 v_~size~0_157)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_157)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_193| 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_157)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_157) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_157) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_157) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_157)) 1 0) 0)) (< (mod (+ 4294967291 |v_thread2Thread1of1ForFork1_~i~1#1_206|) 4294967296) .cse8) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_208| 4294967296) .cse8) (= (select .cse9 (+ v_~f~0.offset_141 (* .cse2 4))) v_~x2~0_228) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_157)) 1 0) 0))))))))))))) InVars {~x2~0=v_~x2~0_230, ~size~0=v_~size~0_157, ~f~0.base=v_~f~0.base_141, #memory_int=|v_#memory_int_213|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_208|, ~n~0=v_~n~0_124, ~f~0.offset=v_~f~0.offset_141} OutVars{~x2~0=v_~x2~0_228, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_47|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_51|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_45|, ~size~0=v_~size~0_157, ~f~0.base=v_~f~0.base_141, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_61|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_206|, ~f~0.offset=v_~f~0.offset_141, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_193|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_47|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_67|, #memory_int=|v_#memory_int_213|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_49|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_59|, ~n~0=v_~n~0_124, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_53|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] and [725] L92-4-->L93-1: Formula: (= (select (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t1~0#1.base_27|) |v_ULTIMATE.start_main_~#t1~0#1.offset_27|) |v_ULTIMATE.start_main_#t~mem20#1_10|) InVars {#memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_27|} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_10|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~nondet19#1] [2022-12-06 05:46:18,283 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [801] L59-2-->L59-2: Formula: (let ((.cse9 (select |v_#memory_int_213| v_~f~0.base_141))) (let ((.cse7 (select .cse9 (+ v_~f~0.offset_141 (* v_~x2~0_230 4))))) (let ((.cse1 (select .cse9 (+ v_~f~0.offset_141 (* .cse7 4))))) (let ((.cse6 (select .cse9 (+ v_~f~0.offset_141 (* .cse1 4))))) (let ((.cse4 (select .cse9 (+ v_~f~0.offset_141 (* .cse6 4))))) (let ((.cse3 (select .cse9 (+ v_~f~0.offset_141 (* 4 .cse4))))) (let ((.cse0 (select .cse9 (+ v_~f~0.offset_141 (* .cse3 4))))) (let ((.cse10 (select .cse9 (+ v_~f~0.offset_141 (* .cse0 4))))) (let ((.cse5 (select .cse9 (+ v_~f~0.offset_141 (* .cse10 4))))) (let ((.cse8 (mod (* 5 v_~n~0_124) 4294967296)) (.cse2 (select .cse9 (+ v_~f~0.offset_141 (* .cse5 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_157) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_157)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_193|) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_208| 10) |v_thread2Thread1of1ForFork1_~i~1#1_206|) (not (= (ite (and (<= 0 v_~x2~0_230) (< v_~x2~0_230 v_~size~0_157)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_157)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_193| 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_157)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_157) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_157) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_157) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_157)) 1 0) 0)) (< (mod (+ 4294967291 |v_thread2Thread1of1ForFork1_~i~1#1_206|) 4294967296) .cse8) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_208| 4294967296) .cse8) (= (select .cse9 (+ v_~f~0.offset_141 (* .cse2 4))) v_~x2~0_228) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_157)) 1 0) 0))))))))))))) InVars {~x2~0=v_~x2~0_230, ~size~0=v_~size~0_157, ~f~0.base=v_~f~0.base_141, #memory_int=|v_#memory_int_213|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_208|, ~n~0=v_~n~0_124, ~f~0.offset=v_~f~0.offset_141} OutVars{~x2~0=v_~x2~0_228, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_47|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_51|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_45|, ~size~0=v_~size~0_157, ~f~0.base=v_~f~0.base_141, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_61|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_206|, ~f~0.offset=v_~f~0.offset_141, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_193|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_47|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_67|, #memory_int=|v_#memory_int_213|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_49|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_59|, ~n~0=v_~n~0_124, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_53|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:46:24,168 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [801] L59-2-->L59-2: Formula: (let ((.cse9 (select |v_#memory_int_213| v_~f~0.base_141))) (let ((.cse7 (select .cse9 (+ v_~f~0.offset_141 (* v_~x2~0_230 4))))) (let ((.cse1 (select .cse9 (+ v_~f~0.offset_141 (* .cse7 4))))) (let ((.cse6 (select .cse9 (+ v_~f~0.offset_141 (* .cse1 4))))) (let ((.cse4 (select .cse9 (+ v_~f~0.offset_141 (* .cse6 4))))) (let ((.cse3 (select .cse9 (+ v_~f~0.offset_141 (* 4 .cse4))))) (let ((.cse0 (select .cse9 (+ v_~f~0.offset_141 (* .cse3 4))))) (let ((.cse10 (select .cse9 (+ v_~f~0.offset_141 (* .cse0 4))))) (let ((.cse5 (select .cse9 (+ v_~f~0.offset_141 (* .cse10 4))))) (let ((.cse8 (mod (* 5 v_~n~0_124) 4294967296)) (.cse2 (select .cse9 (+ v_~f~0.offset_141 (* .cse5 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_157) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_157)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_193|) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_208| 10) |v_thread2Thread1of1ForFork1_~i~1#1_206|) (not (= (ite (and (<= 0 v_~x2~0_230) (< v_~x2~0_230 v_~size~0_157)) 1 0) 0)) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_157)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_193| 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_157)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_157) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_157) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_157) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_157)) 1 0) 0)) (< (mod (+ 4294967291 |v_thread2Thread1of1ForFork1_~i~1#1_206|) 4294967296) .cse8) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_208| 4294967296) .cse8) (= (select .cse9 (+ v_~f~0.offset_141 (* .cse2 4))) v_~x2~0_228) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_157)) 1 0) 0))))))))))))) InVars {~x2~0=v_~x2~0_230, ~size~0=v_~size~0_157, ~f~0.base=v_~f~0.base_141, #memory_int=|v_#memory_int_213|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_208|, ~n~0=v_~n~0_124, ~f~0.offset=v_~f~0.offset_141} OutVars{~x2~0=v_~x2~0_228, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_47|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_51|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_45|, ~size~0=v_~size~0_157, ~f~0.base=v_~f~0.base_141, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_61|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_49|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_155|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_206|, ~f~0.offset=v_~f~0.offset_141, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_193|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_47|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_67|, #memory_int=|v_#memory_int_213|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_49|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_59|, ~n~0=v_~n~0_124, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_53|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] and [791] L49-2-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_191| v_~f~0.base_125))) (let ((.cse0 (mod (* 5 v_~n~0_110) 4294967296)) (.cse2 (select .cse1 (+ v_~f~0.offset_125 (* v_~x1~0_110 4))))) (and (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_91| 2) |v_thread1Thread1of1ForFork0_~i~0#1_89|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_91| 1) 4294967296) .cse0) (= (select .cse1 (+ v_~f~0.offset_125 (* .cse2 4))) v_~x1~0_108) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_91| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_143)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|) (not (= (ite (and (< v_~x1~0_110 v_~size~0_143) (<= 0 v_~x1~0_110)) 1 0) 0))))) InVars {~size~0=v_~size~0_143, ~f~0.base=v_~f~0.base_125, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_91|, #memory_int=|v_#memory_int_191|, ~n~0=v_~n~0_110, ~x1~0=v_~x1~0_110, ~f~0.offset=v_~f~0.offset_125} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_53|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|, ~size~0=v_~size~0_143, ~f~0.base=v_~f~0.base_125, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_89|, #memory_int=|v_#memory_int_191|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~n~0=v_~n~0_110, ~x1~0=v_~x1~0_108, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_65|, ~f~0.offset=v_~f~0.offset_125} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:46:25,011 INFO L203 LiptonReduction]: Total number of compositions: 20 [2022-12-06 05:46:25,011 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21166 [2022-12-06 05:46:25,012 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 95 transitions, 1111 flow [2022-12-06 05:46:25,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:25,012 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:25,012 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:25,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 05:46:25,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:25,213 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:25,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:25,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1327886483, now seen corresponding path program 1 times [2022-12-06 05:46:25,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:25,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930888961] [2022-12-06 05:46:25,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:25,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:25,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:25,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930888961] [2022-12-06 05:46:25,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930888961] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:46:25,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703293322] [2022-12-06 05:46:25,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:25,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:25,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:25,756 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:46:25,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 05:46:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:25,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-06 05:46:25,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:46:25,984 INFO L321 Elim1Store]: treesize reduction 63, result has 22.2 percent of original size [2022-12-06 05:46:25,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 56 [2022-12-06 05:46:26,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-06 05:46:26,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:46:26,396 INFO L321 Elim1Store]: treesize reduction 15, result has 94.6 percent of original size [2022-12-06 05:46:26,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 258 treesize of output 343 [2022-12-06 05:46:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:31,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703293322] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:46:31,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:46:31,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2022-12-06 05:46:31,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050608426] [2022-12-06 05:46:31,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:46:31,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:46:31,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:31,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:46:31,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:46:31,097 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 05:46:31,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 95 transitions, 1111 flow. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:31,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:31,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 05:46:31,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:33,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:46:37,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:46:43,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:46:47,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:46:47,933 INFO L130 PetriNetUnfolder]: 514/910 cut-off events. [2022-12-06 05:46:47,934 INFO L131 PetriNetUnfolder]: For 9178/9178 co-relation queries the response was YES. [2022-12-06 05:46:47,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6023 conditions, 910 events. 514/910 cut-off events. For 9178/9178 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4546 event pairs, 32 based on Foata normal form. 45/930 useless extension candidates. Maximal degree in co-relation 5204. Up to 472 conditions per place. [2022-12-06 05:46:47,944 INFO L137 encePairwiseOnDemand]: 9/48 looper letters, 86 selfloop transitions, 128 changer transitions 10/224 dead transitions. [2022-12-06 05:46:47,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 224 transitions, 2786 flow [2022-12-06 05:46:47,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 05:46:47,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 05:46:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 125 transitions. [2022-12-06 05:46:47,945 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14467592592592593 [2022-12-06 05:46:47,946 INFO L175 Difference]: Start difference. First operand has 76 places, 95 transitions, 1111 flow. Second operand 18 states and 125 transitions. [2022-12-06 05:46:47,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 224 transitions, 2786 flow [2022-12-06 05:46:47,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 224 transitions, 2199 flow, removed 281 selfloop flow, removed 7 redundant places. [2022-12-06 05:46:47,969 INFO L231 Difference]: Finished difference. Result has 94 places, 167 transitions, 1758 flow [2022-12-06 05:46:47,969 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1758, PETRI_PLACES=94, PETRI_TRANSITIONS=167} [2022-12-06 05:46:47,969 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 73 predicate places. [2022-12-06 05:46:47,969 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:47,969 INFO L89 Accepts]: Start accepts. Operand has 94 places, 167 transitions, 1758 flow [2022-12-06 05:46:47,971 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:47,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:47,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 167 transitions, 1758 flow [2022-12-06 05:46:47,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 167 transitions, 1758 flow [2022-12-06 05:46:48,040 INFO L130 PetriNetUnfolder]: 201/471 cut-off events. [2022-12-06 05:46:48,040 INFO L131 PetriNetUnfolder]: For 3778/3833 co-relation queries the response was YES. [2022-12-06 05:46:48,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2759 conditions, 471 events. 201/471 cut-off events. For 3778/3833 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 2792 event pairs, 20 based on Foata normal form. 1/452 useless extension candidates. Maximal degree in co-relation 2475. Up to 185 conditions per place. [2022-12-06 05:46:48,046 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 167 transitions, 1758 flow [2022-12-06 05:46:48,046 INFO L188 LiptonReduction]: Number of co-enabled transitions 340 [2022-12-06 05:46:48,057 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [820] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_237| v_~f~0.base_165))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_165 (* v_~x1~0_184 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_165 (* 4 .cse2))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_101| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_87|) (= |v_ULTIMATE.start_main_#t~mem20#1_48| (select (select |v_#memory_int_237| |v_ULTIMATE.start_main_~#t1~0#1.base_67|) |v_ULTIMATE.start_main_~#t1~0#1.offset_67|)) (not (= (ite (and (<= 0 v_~x1~0_184) (< v_~x1~0_184 v_~size~0_181)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_165 (* .cse1 4))) v_~x1~0_182) (< 2 (mod (* 5 v_~n~0_148) 4294967296)) (= |v_thread1Thread1of1ForFork0_~i~0#1_143| 3) (not (= (ite (and (< .cse2 v_~size~0_181) (<= 0 .cse2)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_246| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_101| 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_181)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_87|))))) InVars {~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_165, #memory_int=|v_#memory_int_237|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_67|, ~n~0=v_~n~0_148, ~x1~0=v_~x1~0_184, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_67|, ~f~0.offset=v_~f~0.offset_165} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_55|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_95|, ~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_165, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_246|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_67|, ~x1~0=v_~x1~0_182, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_67|, ~f~0.offset=v_~f~0.offset_165, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_48|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_87|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_143|, #memory_int=|v_#memory_int_237|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_101|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_40|, ~n~0=v_~n~0_148, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_107|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~mem20#1, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~i~1#1, ULTIMATE.start_main_#t~nondet19#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:46:48,511 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:48,511 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 542 [2022-12-06 05:46:48,512 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 166 transitions, 1752 flow [2022-12-06 05:46:48,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:48,512 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:48,512 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:48,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 05:46:48,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:48,716 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:48,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:48,716 INFO L85 PathProgramCache]: Analyzing trace with hash -897090107, now seen corresponding path program 1 times [2022-12-06 05:46:48,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:48,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017658788] [2022-12-06 05:46:48,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:48,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:48,894 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-06 05:46:48,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:48,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017658788] [2022-12-06 05:46:48,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017658788] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:46:48,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976908446] [2022-12-06 05:46:48,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:48,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:48,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:48,896 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:46:48,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 05:46:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:49,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:46:49,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:46:49,159 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-06 05:46:49,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:46:49,206 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-06 05:46:49,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976908446] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:46:49,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:46:49,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 05:46:49,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912135316] [2022-12-06 05:46:49,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:46:49,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:46:49,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:49,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:46:49,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:46:49,208 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 05:46:49,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 166 transitions, 1752 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-06 05:46:49,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:49,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 05:46:49,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:50,145 INFO L130 PetriNetUnfolder]: 587/1024 cut-off events. [2022-12-06 05:46:50,145 INFO L131 PetriNetUnfolder]: For 12666/12666 co-relation queries the response was YES. [2022-12-06 05:46:50,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6699 conditions, 1024 events. 587/1024 cut-off events. For 12666/12666 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5197 event pairs, 95 based on Foata normal form. 34/1053 useless extension candidates. Maximal degree in co-relation 5515. Up to 545 conditions per place. [2022-12-06 05:46:50,156 INFO L137 encePairwiseOnDemand]: 13/42 looper letters, 115 selfloop transitions, 138 changer transitions 0/253 dead transitions. [2022-12-06 05:46:50,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 253 transitions, 3029 flow [2022-12-06 05:46:50,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:46:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:46:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 93 transitions. [2022-12-06 05:46:50,158 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17032967032967034 [2022-12-06 05:46:50,158 INFO L175 Difference]: Start difference. First operand has 85 places, 166 transitions, 1752 flow. Second operand 13 states and 93 transitions. [2022-12-06 05:46:50,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 253 transitions, 3029 flow [2022-12-06 05:46:50,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 253 transitions, 2833 flow, removed 87 selfloop flow, removed 9 redundant places. [2022-12-06 05:46:50,206 INFO L231 Difference]: Finished difference. Result has 94 places, 205 transitions, 2470 flow [2022-12-06 05:46:50,207 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1622, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2470, PETRI_PLACES=94, PETRI_TRANSITIONS=205} [2022-12-06 05:46:50,207 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 73 predicate places. [2022-12-06 05:46:50,208 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:50,208 INFO L89 Accepts]: Start accepts. Operand has 94 places, 205 transitions, 2470 flow [2022-12-06 05:46:50,210 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:50,210 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:50,210 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 205 transitions, 2470 flow [2022-12-06 05:46:50,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 205 transitions, 2470 flow [2022-12-06 05:46:50,314 INFO L130 PetriNetUnfolder]: 271/620 cut-off events. [2022-12-06 05:46:50,315 INFO L131 PetriNetUnfolder]: For 4709/4771 co-relation queries the response was YES. [2022-12-06 05:46:50,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3512 conditions, 620 events. 271/620 cut-off events. For 4709/4771 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 3799 event pairs, 21 based on Foata normal form. 0/610 useless extension candidates. Maximal degree in co-relation 3272. Up to 286 conditions per place. [2022-12-06 05:46:50,322 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 205 transitions, 2470 flow [2022-12-06 05:46:50,322 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-06 05:46:50,323 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:46:50,325 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-06 05:46:50,325 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 205 transitions, 2470 flow [2022-12-06 05:46:50,325 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-06 05:46:50,325 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:50,325 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:50,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 05:46:50,534 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,SelfDestructingSolverStorable12 [2022-12-06 05:46:50,534 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:50,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:50,535 INFO L85 PathProgramCache]: Analyzing trace with hash 375340999, now seen corresponding path program 1 times [2022-12-06 05:46:50,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:50,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971005387] [2022-12-06 05:46:50,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:50,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:51,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:51,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:51,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971005387] [2022-12-06 05:46:51,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971005387] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:46:51,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624084705] [2022-12-06 05:46:51,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:51,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:46:51,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:51,092 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-06 05:46:51,094 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-06 05:46:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:51,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 05:46:51,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:46:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:51,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:46:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:46:51,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624084705] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:46:51,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:46:51,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-06 05:46:51,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75839071] [2022-12-06 05:46:51,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:46:51,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:46:51,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:51,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:46:51,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:46:51,409 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 05:46:51,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 205 transitions, 2470 flow. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:51,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:51,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 05:46:51,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:55,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:46:59,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:47:00,002 INFO L130 PetriNetUnfolder]: 687/1204 cut-off events. [2022-12-06 05:47:00,002 INFO L131 PetriNetUnfolder]: For 14987/14987 co-relation queries the response was YES. [2022-12-06 05:47:00,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7907 conditions, 1204 events. 687/1204 cut-off events. For 14987/14987 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6428 event pairs, 78 based on Foata normal form. 14/1211 useless extension candidates. Maximal degree in co-relation 7181. Up to 498 conditions per place. [2022-12-06 05:47:00,015 INFO L137 encePairwiseOnDemand]: 17/42 looper letters, 173 selfloop transitions, 110 changer transitions 1/284 dead transitions. [2022-12-06 05:47:00,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 284 transitions, 3808 flow [2022-12-06 05:47:00,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:47:00,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:47:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 77 transitions. [2022-12-06 05:47:00,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18333333333333332 [2022-12-06 05:47:00,018 INFO L175 Difference]: Start difference. First operand has 94 places, 205 transitions, 2470 flow. Second operand 10 states and 77 transitions. [2022-12-06 05:47:00,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 284 transitions, 3808 flow [2022-12-06 05:47:00,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 284 transitions, 3660 flow, removed 59 selfloop flow, removed 1 redundant places. [2022-12-06 05:47:00,062 INFO L231 Difference]: Finished difference. Result has 106 places, 225 transitions, 2994 flow [2022-12-06 05:47:00,062 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2338, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2994, PETRI_PLACES=106, PETRI_TRANSITIONS=225} [2022-12-06 05:47:00,063 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 85 predicate places. [2022-12-06 05:47:00,063 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:00,063 INFO L89 Accepts]: Start accepts. Operand has 106 places, 225 transitions, 2994 flow [2022-12-06 05:47:00,064 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:00,064 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:00,064 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 225 transitions, 2994 flow [2022-12-06 05:47:00,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 225 transitions, 2994 flow [2022-12-06 05:47:00,155 INFO L130 PetriNetUnfolder]: 281/648 cut-off events. [2022-12-06 05:47:00,155 INFO L131 PetriNetUnfolder]: For 6464/6558 co-relation queries the response was YES. [2022-12-06 05:47:00,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3997 conditions, 648 events. 281/648 cut-off events. For 6464/6558 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4107 event pairs, 23 based on Foata normal form. 2/633 useless extension candidates. Maximal degree in co-relation 3802. Up to 287 conditions per place. [2022-12-06 05:47:00,161 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 225 transitions, 2994 flow [2022-12-06 05:47:00,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 428 [2022-12-06 05:47:00,178 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [852] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_278| v_~f~0.base_205))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_205 (* v_~x2~0_345 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_205 (* .cse5 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_205 (* .cse0 4)))) (.cse3 (select .cse1 (+ v_~f~0.offset_205 (* v_~x1~0_267 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_205 (* .cse3 4)))) (.cse6 (select .cse1 (+ (* 4 .cse4) v_~f~0.offset_205)))) (and (not (= (ite (and (< .cse0 v_~size~0_221) (<= 0 .cse0)) 1 0) 0)) (= v_~x1~0_266 (select .cse1 (+ v_~f~0.offset_205 (* .cse2 4)))) (not (= (ite (and (< .cse3 v_~size~0_221) (<= 0 .cse3)) 1 0) 0)) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_318|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_138| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_152|) (= |v_thread1Thread1of1ForFork0_~i~0#1_206| 3) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_221)) 1 0) 0)) (= (ite (and (< .cse2 v_~size~0_221) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_138|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_261| 0)) (not (= (ite (and (< .cse5 v_~size~0_221) (<= 0 .cse5)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_152| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_261|) (not (= (ite (and (< v_~x1~0_267 v_~size~0_221) (<= 0 v_~x1~0_267)) 1 0) 0)) (< 2 (mod (* 5 v_~n~0_188) 4294967296)) (not (= (ite (and (<= 0 v_~x2~0_345) (< v_~x2~0_345 v_~size~0_221)) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~mem20#1_62| (select (select |v_#memory_int_278| |v_ULTIMATE.start_main_~#t1~0#1.base_79|) |v_ULTIMATE.start_main_~#t1~0#1.offset_79|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223| (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_221)) 1 0)) (= v_~x2~0_344 (select .cse1 (+ v_~f~0.offset_205 (* 4 .cse6)))))))))) InVars {~x2~0=v_~x2~0_345, ~size~0=v_~size~0_221, ~f~0.base=v_~f~0.base_205, #memory_int=|v_#memory_int_278|, ~n~0=v_~n~0_188, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_79|, ~x1~0=v_~x1~0_267, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_79|, ~f~0.offset=v_~f~0.offset_205} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_69|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_146|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_115|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_119|, ~f~0.base=v_~f~0.base_205, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_117|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_223|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_318|, ~x1~0=v_~x1~0_266, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_79|, ~f~0.offset=v_~f~0.offset_205, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_115|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_152|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_127|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_121|, ~x2~0=v_~x2~0_344, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_113|, ~size~0=v_~size~0_221, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_129|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_79|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_261|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_62|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_138|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_135|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_206|, #memory_int=|v_#memory_int_278|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_117|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_53|, ~n~0=v_~n~0_188, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_158|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem20#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, ULTIMATE.start_main_#t~nondet19#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:01,441 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:01,442 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1379 [2022-12-06 05:47:01,442 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 225 transitions, 3018 flow [2022-12-06 05:47:01,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:01,442 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:01,442 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:01,449 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-06 05:47:01,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:01,647 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:01,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:01,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1231703519, now seen corresponding path program 1 times [2022-12-06 05:47:01,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:01,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945645220] [2022-12-06 05:47:01,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:01,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:01,774 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-06 05:47:01,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:01,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945645220] [2022-12-06 05:47:01,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945645220] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:01,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200191661] [2022-12-06 05:47:01,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:01,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:01,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:01,776 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-06 05:47:01,803 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-06 05:47:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:01,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:47:01,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:01,992 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-06 05:47:01,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:02,020 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-06 05:47:02,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200191661] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:02,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:02,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 05:47:02,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732248104] [2022-12-06 05:47:02,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:02,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:47:02,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:02,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:47:02,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:47:02,022 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 05:47:02,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 225 transitions, 3018 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-06 05:47:02,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:02,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 05:47:02,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:02,532 INFO L130 PetriNetUnfolder]: 690/1225 cut-off events. [2022-12-06 05:47:02,532 INFO L131 PetriNetUnfolder]: For 15938/15938 co-relation queries the response was YES. [2022-12-06 05:47:02,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8533 conditions, 1225 events. 690/1225 cut-off events. For 15938/15938 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6616 event pairs, 226 based on Foata normal form. 2/1223 useless extension candidates. Maximal degree in co-relation 8104. Up to 1200 conditions per place. [2022-12-06 05:47:02,544 INFO L137 encePairwiseOnDemand]: 39/44 looper letters, 223 selfloop transitions, 8 changer transitions 11/242 dead transitions. [2022-12-06 05:47:02,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 242 transitions, 3702 flow [2022-12-06 05:47:02,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:47:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:47:02,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-12-06 05:47:02,545 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2159090909090909 [2022-12-06 05:47:02,546 INFO L175 Difference]: Start difference. First operand has 106 places, 225 transitions, 3018 flow. Second operand 6 states and 57 transitions. [2022-12-06 05:47:02,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 242 transitions, 3702 flow [2022-12-06 05:47:02,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 242 transitions, 3602 flow, removed 49 selfloop flow, removed 1 redundant places. [2022-12-06 05:47:02,612 INFO L231 Difference]: Finished difference. Result has 113 places, 228 transitions, 3005 flow [2022-12-06 05:47:02,612 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2924, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3005, PETRI_PLACES=113, PETRI_TRANSITIONS=228} [2022-12-06 05:47:02,612 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 92 predicate places. [2022-12-06 05:47:02,612 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:02,613 INFO L89 Accepts]: Start accepts. Operand has 113 places, 228 transitions, 3005 flow [2022-12-06 05:47:02,615 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:02,615 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:02,616 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 228 transitions, 3005 flow [2022-12-06 05:47:02,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 228 transitions, 3005 flow [2022-12-06 05:47:02,723 INFO L130 PetriNetUnfolder]: 298/685 cut-off events. [2022-12-06 05:47:02,724 INFO L131 PetriNetUnfolder]: For 5433/5539 co-relation queries the response was YES. [2022-12-06 05:47:02,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3987 conditions, 685 events. 298/685 cut-off events. For 5433/5539 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 4313 event pairs, 17 based on Foata normal form. 0/679 useless extension candidates. Maximal degree in co-relation 3768. Up to 329 conditions per place. [2022-12-06 05:47:02,731 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 228 transitions, 3005 flow [2022-12-06 05:47:02,731 INFO L188 LiptonReduction]: Number of co-enabled transitions 426 [2022-12-06 05:47:02,732 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:47:02,733 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-06 05:47:02,733 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 228 transitions, 3005 flow [2022-12-06 05:47:02,733 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-06 05:47:02,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:02,733 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:02,741 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-06 05:47:02,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:02,940 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:02,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:02,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1174112041, now seen corresponding path program 1 times [2022-12-06 05:47:02,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:02,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377392086] [2022-12-06 05:47:02,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:02,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:06,377 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-06 05:47:06,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:06,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377392086] [2022-12-06 05:47:06,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377392086] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:06,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126372183] [2022-12-06 05:47:06,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:06,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:06,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:06,384 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-06 05:47:06,388 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-06 05:47:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:06,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 05:47:06,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:06,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:47:06,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 107 [2022-12-06 05:47:06,741 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-06 05:47:06,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:07,502 INFO L321 Elim1Store]: treesize reduction 25, result has 94.2 percent of original size [2022-12-06 05:47:07,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 83 treesize of output 471 [2022-12-06 05:47:10,291 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-06 05:47:10,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126372183] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:10,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:10,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-06 05:47:10,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175226162] [2022-12-06 05:47:10,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:10,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:47:10,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:10,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:47:10,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:47:10,293 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 05:47:10,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 228 transitions, 3005 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:10,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:10,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 05:47:10,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:11,632 INFO L130 PetriNetUnfolder]: 722/1276 cut-off events. [2022-12-06 05:47:11,632 INFO L131 PetriNetUnfolder]: For 15091/15091 co-relation queries the response was YES. [2022-12-06 05:47:11,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8604 conditions, 1276 events. 722/1276 cut-off events. For 15091/15091 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 6922 event pairs, 120 based on Foata normal form. 1/1277 useless extension candidates. Maximal degree in co-relation 8336. Up to 1157 conditions per place. [2022-12-06 05:47:11,646 INFO L137 encePairwiseOnDemand]: 12/43 looper letters, 197 selfloop transitions, 61 changer transitions 1/259 dead transitions. [2022-12-06 05:47:11,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 259 transitions, 3817 flow [2022-12-06 05:47:11,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:47:11,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:47:11,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2022-12-06 05:47:11,647 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19476744186046513 [2022-12-06 05:47:11,648 INFO L175 Difference]: Start difference. First operand has 110 places, 228 transitions, 3005 flow. Second operand 8 states and 67 transitions. [2022-12-06 05:47:11,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 259 transitions, 3817 flow [2022-12-06 05:47:11,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 259 transitions, 3745 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 05:47:11,705 INFO L231 Difference]: Finished difference. Result has 117 places, 242 transitions, 3308 flow [2022-12-06 05:47:11,705 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2936, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3308, PETRI_PLACES=117, PETRI_TRANSITIONS=242} [2022-12-06 05:47:11,706 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 96 predicate places. [2022-12-06 05:47:11,707 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:11,707 INFO L89 Accepts]: Start accepts. Operand has 117 places, 242 transitions, 3308 flow [2022-12-06 05:47:11,708 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:11,708 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:11,708 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 242 transitions, 3308 flow [2022-12-06 05:47:11,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 242 transitions, 3308 flow [2022-12-06 05:47:11,825 INFO L130 PetriNetUnfolder]: 311/720 cut-off events. [2022-12-06 05:47:11,825 INFO L131 PetriNetUnfolder]: For 6292/6403 co-relation queries the response was YES. [2022-12-06 05:47:11,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4356 conditions, 720 events. 311/720 cut-off events. For 6292/6403 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 4614 event pairs, 22 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 4135. Up to 344 conditions per place. [2022-12-06 05:47:11,836 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 242 transitions, 3308 flow [2022-12-06 05:47:11,837 INFO L188 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-06 05:47:11,839 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:47:11,840 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-06 05:47:11,840 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 242 transitions, 3308 flow [2022-12-06 05:47:11,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:11,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:11,840 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:11,850 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-06 05:47:12,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 05:47:12,049 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:12,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:12,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2054988473, now seen corresponding path program 2 times [2022-12-06 05:47:12,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:12,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995790237] [2022-12-06 05:47:12,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:12,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:14,252 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-06 05:47:14,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:14,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995790237] [2022-12-06 05:47:14,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995790237] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:14,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497677702] [2022-12-06 05:47:14,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:47:14,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:14,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:14,254 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-06 05:47:14,256 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-06 05:47:14,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:47:14,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:47:14,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-06 05:47:14,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:14,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:47:14,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 05:47:14,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:47:14,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:47:14,611 INFO L321 Elim1Store]: treesize reduction 50, result has 38.3 percent of original size [2022-12-06 05:47:14,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 141 treesize of output 75 [2022-12-06 05:47:14,657 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-06 05:47:14,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:14,947 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-06 05:47:14,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497677702] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:14,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:14,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 05:47:14,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812774365] [2022-12-06 05:47:14,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:14,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 05:47:14,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:14,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 05:47:14,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=178, Unknown=2, NotChecked=0, Total=240 [2022-12-06 05:47:14,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 05:47:14,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 242 transitions, 3308 flow. Second operand has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 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-06 05:47:14,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:14,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 05:47:14,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:16,644 INFO L130 PetriNetUnfolder]: 829/1467 cut-off events. [2022-12-06 05:47:16,645 INFO L131 PetriNetUnfolder]: For 18902/18902 co-relation queries the response was YES. [2022-12-06 05:47:16,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10201 conditions, 1467 events. 829/1467 cut-off events. For 18902/18902 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 8231 event pairs, 105 based on Foata normal form. 3/1470 useless extension candidates. Maximal degree in co-relation 9998. Up to 1216 conditions per place. [2022-12-06 05:47:16,661 INFO L137 encePairwiseOnDemand]: 13/43 looper letters, 222 selfloop transitions, 81 changer transitions 2/305 dead transitions. [2022-12-06 05:47:16,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 305 transitions, 4659 flow [2022-12-06 05:47:16,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:47:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:47:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 90 transitions. [2022-12-06 05:47:16,663 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20930232558139536 [2022-12-06 05:47:16,663 INFO L175 Difference]: Start difference. First operand has 117 places, 242 transitions, 3308 flow. Second operand 10 states and 90 transitions. [2022-12-06 05:47:16,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 305 transitions, 4659 flow [2022-12-06 05:47:16,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 305 transitions, 4638 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:16,733 INFO L231 Difference]: Finished difference. Result has 127 places, 266 transitions, 3862 flow [2022-12-06 05:47:16,734 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3287, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3862, PETRI_PLACES=127, PETRI_TRANSITIONS=266} [2022-12-06 05:47:16,734 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 106 predicate places. [2022-12-06 05:47:16,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:16,734 INFO L89 Accepts]: Start accepts. Operand has 127 places, 266 transitions, 3862 flow [2022-12-06 05:47:16,736 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:16,736 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:16,736 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 266 transitions, 3862 flow [2022-12-06 05:47:16,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 266 transitions, 3862 flow [2022-12-06 05:47:16,845 INFO L130 PetriNetUnfolder]: 351/829 cut-off events. [2022-12-06 05:47:16,845 INFO L131 PetriNetUnfolder]: For 8681/8799 co-relation queries the response was YES. [2022-12-06 05:47:16,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5379 conditions, 829 events. 351/829 cut-off events. For 8681/8799 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 5538 event pairs, 31 based on Foata normal form. 0/821 useless extension candidates. Maximal degree in co-relation 5180. Up to 395 conditions per place. [2022-12-06 05:47:16,857 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 266 transitions, 3862 flow [2022-12-06 05:47:16,857 INFO L188 LiptonReduction]: Number of co-enabled transitions 534 [2022-12-06 05:47:16,859 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:47:16,859 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-06 05:47:16,859 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 266 transitions, 3862 flow [2022-12-06 05:47:16,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 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-06 05:47:16,860 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:16,860 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:16,868 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-06 05:47:17,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 05:47:17,066 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:17,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:17,066 INFO L85 PathProgramCache]: Analyzing trace with hash 298701224, now seen corresponding path program 2 times [2022-12-06 05:47:17,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:17,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576537167] [2022-12-06 05:47:17,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:17,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:17,420 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-06 05:47:17,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:17,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576537167] [2022-12-06 05:47:17,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576537167] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:17,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65156308] [2022-12-06 05:47:17,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:47:17,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:17,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:17,424 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-06 05:47:17,437 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-06 05:47:17,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:47:17,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:47:17,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 05:47:17,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:17,729 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-06 05:47:17,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:17,909 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-06 05:47:17,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65156308] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:17,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:17,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 05:47:17,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704683491] [2022-12-06 05:47:17,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:17,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 05:47:17,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:17,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 05:47:17,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-12-06 05:47:17,911 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 05:47:17,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 266 transitions, 3862 flow. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:17,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:17,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 05:47:17,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:20,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:47:28,934 INFO L130 PetriNetUnfolder]: 986/1740 cut-off events. [2022-12-06 05:47:28,934 INFO L131 PetriNetUnfolder]: For 29657/29657 co-relation queries the response was YES. [2022-12-06 05:47:28,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12946 conditions, 1740 events. 986/1740 cut-off events. For 29657/29657 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 10010 event pairs, 50 based on Foata normal form. 38/1778 useless extension candidates. Maximal degree in co-relation 12555. Up to 691 conditions per place. [2022-12-06 05:47:28,949 INFO L137 encePairwiseOnDemand]: 11/43 looper letters, 206 selfloop transitions, 190 changer transitions 5/401 dead transitions. [2022-12-06 05:47:28,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 401 transitions, 6333 flow [2022-12-06 05:47:28,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 05:47:28,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 05:47:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 108 transitions. [2022-12-06 05:47:28,951 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13953488372093023 [2022-12-06 05:47:28,951 INFO L175 Difference]: Start difference. First operand has 127 places, 266 transitions, 3862 flow. Second operand 18 states and 108 transitions. [2022-12-06 05:47:28,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 401 transitions, 6333 flow [2022-12-06 05:47:29,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 401 transitions, 6261 flow, removed 26 selfloop flow, removed 3 redundant places. [2022-12-06 05:47:29,021 INFO L231 Difference]: Finished difference. Result has 144 places, 307 transitions, 5034 flow [2022-12-06 05:47:29,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3808, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5034, PETRI_PLACES=144, PETRI_TRANSITIONS=307} [2022-12-06 05:47:29,022 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 123 predicate places. [2022-12-06 05:47:29,022 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:29,022 INFO L89 Accepts]: Start accepts. Operand has 144 places, 307 transitions, 5034 flow [2022-12-06 05:47:29,024 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:29,024 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:29,024 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 307 transitions, 5034 flow [2022-12-06 05:47:29,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 307 transitions, 5034 flow [2022-12-06 05:47:29,134 INFO L130 PetriNetUnfolder]: 374/889 cut-off events. [2022-12-06 05:47:29,134 INFO L131 PetriNetUnfolder]: For 10967/11095 co-relation queries the response was YES. [2022-12-06 05:47:29,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6540 conditions, 889 events. 374/889 cut-off events. For 10967/11095 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 6032 event pairs, 34 based on Foata normal form. 1/871 useless extension candidates. Maximal degree in co-relation 6119. Up to 401 conditions per place. [2022-12-06 05:47:29,142 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 307 transitions, 5034 flow [2022-12-06 05:47:29,142 INFO L188 LiptonReduction]: Number of co-enabled transitions 622 [2022-12-06 05:47:29,436 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:47:30,706 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:47:30,707 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1685 [2022-12-06 05:47:30,707 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 306 transitions, 5090 flow [2022-12-06 05:47:30,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:30,708 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:30,708 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:30,713 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-06 05:47:30,911 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,SelfDestructingSolverStorable17 [2022-12-06 05:47:30,911 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:30,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:30,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1062576574, now seen corresponding path program 1 times [2022-12-06 05:47:30,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:30,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023307691] [2022-12-06 05:47:30,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:30,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:31,024 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-06 05:47:31,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:31,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023307691] [2022-12-06 05:47:31,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023307691] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:31,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161288704] [2022-12-06 05:47:31,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:31,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:31,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:31,028 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-06 05:47:31,054 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-06 05:47:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:31,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:47:31,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:31,163 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-06 05:47:31,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:31,210 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-06 05:47:31,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161288704] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:31,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:31,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 05:47:31,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058153261] [2022-12-06 05:47:31,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:31,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:47:31,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:31,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:47:31,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:47:31,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 05:47:31,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 306 transitions, 5090 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-06 05:47:31,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:31,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 05:47:31,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:33,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:47:36,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:47:38,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:47:40,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:47:42,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:47:44,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:47:45,473 INFO L130 PetriNetUnfolder]: 997/1769 cut-off events. [2022-12-06 05:47:45,473 INFO L131 PetriNetUnfolder]: For 29858/29858 co-relation queries the response was YES. [2022-12-06 05:47:45,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14331 conditions, 1769 events. 997/1769 cut-off events. For 29858/29858 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 10355 event pairs, 270 based on Foata normal form. 3/1772 useless extension candidates. Maximal degree in co-relation 14002. Up to 1394 conditions per place. [2022-12-06 05:47:45,486 INFO L137 encePairwiseOnDemand]: 26/52 looper letters, 238 selfloop transitions, 172 changer transitions 0/410 dead transitions. [2022-12-06 05:47:45,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 410 transitions, 7339 flow [2022-12-06 05:47:45,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:47:45,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:47:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 98 transitions. [2022-12-06 05:47:45,487 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11085972850678733 [2022-12-06 05:47:45,487 INFO L175 Difference]: Start difference. First operand has 143 places, 306 transitions, 5090 flow. Second operand 17 states and 98 transitions. [2022-12-06 05:47:45,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 410 transitions, 7339 flow [2022-12-06 05:47:45,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 410 transitions, 6503 flow, removed 268 selfloop flow, removed 10 redundant places. [2022-12-06 05:47:45,584 INFO L231 Difference]: Finished difference. Result has 152 places, 376 transitions, 5740 flow [2022-12-06 05:47:45,585 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=4367, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5740, PETRI_PLACES=152, PETRI_TRANSITIONS=376} [2022-12-06 05:47:45,585 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 131 predicate places. [2022-12-06 05:47:45,585 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:45,585 INFO L89 Accepts]: Start accepts. Operand has 152 places, 376 transitions, 5740 flow [2022-12-06 05:47:45,588 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:45,588 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:45,588 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 376 transitions, 5740 flow [2022-12-06 05:47:45,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 376 transitions, 5740 flow [2022-12-06 05:47:45,729 INFO L130 PetriNetUnfolder]: 538/1179 cut-off events. [2022-12-06 05:47:45,729 INFO L131 PetriNetUnfolder]: For 10580/10696 co-relation queries the response was YES. [2022-12-06 05:47:45,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8025 conditions, 1179 events. 538/1179 cut-off events. For 10580/10696 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 8087 event pairs, 39 based on Foata normal form. 2/1162 useless extension candidates. Maximal degree in co-relation 7853. Up to 481 conditions per place. [2022-12-06 05:47:45,740 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 376 transitions, 5740 flow [2022-12-06 05:47:45,740 INFO L188 LiptonReduction]: Number of co-enabled transitions 522 [2022-12-06 05:47:45,754 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:45,860 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:45,949 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:46,057 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:46,146 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:46,235 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:46,328 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:46,417 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:46,506 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:46,598 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:46,687 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:46,774 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:46,862 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:46,950 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:47,036 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:47,126 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:47,217 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:47,309 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:47,403 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:47,493 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:47,584 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:47,686 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:47,830 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:47,946 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:48,039 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:48,130 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:48,222 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:48,312 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:48,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:48,494 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:48,583 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:48,671 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:48,762 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:48,854 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:48,944 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:49,032 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:49,122 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:49,209 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:49,297 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:49,385 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:49,475 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:49,567 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:49,655 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:49,766 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:49,855 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:49,952 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:50,040 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:50,128 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:50,219 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:50,306 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:50,397 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:50,490 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:47:50,491 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4906 [2022-12-06 05:47:50,491 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 371 transitions, 6006 flow [2022-12-06 05:47:50,491 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-06 05:47:50,491 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:50,491 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:50,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 05:47:50,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:50,695 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:50,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:50,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1133350972, now seen corresponding path program 1 times [2022-12-06 05:47:50,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:50,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78399790] [2022-12-06 05:47:50,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:50,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:53,108 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-06 05:47:53,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:53,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78399790] [2022-12-06 05:47:53,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78399790] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:47:53,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548013446] [2022-12-06 05:47:53,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:53,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:47:53,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:47:53,112 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-06 05:47:53,118 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-06 05:47:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:53,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 05:47:53,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:47:53,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:47:53,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 79 treesize of output 115 [2022-12-06 05:47:53,439 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-06 05:47:53,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:47:54,248 INFO L321 Elim1Store]: treesize reduction 25, result has 94.2 percent of original size [2022-12-06 05:47:54,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 83 treesize of output 471 [2022-12-06 05:47:57,488 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-06 05:47:57,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548013446] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:47:57,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:47:57,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-06 05:47:57,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176695987] [2022-12-06 05:47:57,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:47:57,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:47:57,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:57,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:47:57,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:47:57,489 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 103 [2022-12-06 05:47:57,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 371 transitions, 6006 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:57,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:57,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 103 [2022-12-06 05:47:57,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:59,935 INFO L130 PetriNetUnfolder]: 1155/1996 cut-off events. [2022-12-06 05:47:59,935 INFO L131 PetriNetUnfolder]: For 22647/22647 co-relation queries the response was YES. [2022-12-06 05:47:59,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15462 conditions, 1996 events. 1155/1996 cut-off events. For 22647/22647 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 11400 event pairs, 102 based on Foata normal form. 2/1993 useless extension candidates. Maximal degree in co-relation 15193. Up to 1267 conditions per place. [2022-12-06 05:47:59,951 INFO L137 encePairwiseOnDemand]: 44/103 looper letters, 270 selfloop transitions, 202 changer transitions 7/479 dead transitions. [2022-12-06 05:47:59,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 479 transitions, 8215 flow [2022-12-06 05:47:59,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:47:59,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:47:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 185 transitions. [2022-12-06 05:47:59,960 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12829403606102635 [2022-12-06 05:47:59,960 INFO L175 Difference]: Start difference. First operand has 147 places, 371 transitions, 6006 flow. Second operand 14 states and 185 transitions. [2022-12-06 05:47:59,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 479 transitions, 8215 flow [2022-12-06 05:48:00,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 479 transitions, 7871 flow, removed 140 selfloop flow, removed 3 redundant places. [2022-12-06 05:48:00,087 INFO L231 Difference]: Finished difference. Result has 161 places, 412 transitions, 6950 flow [2022-12-06 05:48:00,088 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=5697, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6950, PETRI_PLACES=161, PETRI_TRANSITIONS=412} [2022-12-06 05:48:00,088 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 140 predicate places. [2022-12-06 05:48:00,088 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:00,088 INFO L89 Accepts]: Start accepts. Operand has 161 places, 412 transitions, 6950 flow [2022-12-06 05:48:00,091 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:00,091 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:00,091 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 412 transitions, 6950 flow [2022-12-06 05:48:00,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 412 transitions, 6950 flow [2022-12-06 05:48:00,274 INFO L130 PetriNetUnfolder]: 621/1306 cut-off events. [2022-12-06 05:48:00,275 INFO L131 PetriNetUnfolder]: For 12983/13082 co-relation queries the response was YES. [2022-12-06 05:48:00,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9695 conditions, 1306 events. 621/1306 cut-off events. For 12983/13082 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 8705 event pairs, 50 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 9479. Up to 583 conditions per place. [2022-12-06 05:48:00,287 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 412 transitions, 6950 flow [2022-12-06 05:48:00,287 INFO L188 LiptonReduction]: Number of co-enabled transitions 614 [2022-12-06 05:48:00,829 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:48:00,830 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 742 [2022-12-06 05:48:00,830 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 412 transitions, 6956 flow [2022-12-06 05:48:00,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:00,830 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:00,830 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:00,835 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-06 05:48:01,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:01,031 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:48:01,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:01,032 INFO L85 PathProgramCache]: Analyzing trace with hash 270091266, now seen corresponding path program 2 times [2022-12-06 05:48:01,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:01,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855001137] [2022-12-06 05:48:01,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:01,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:01,169 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-06 05:48:01,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:01,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855001137] [2022-12-06 05:48:01,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855001137] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:48:01,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630626057] [2022-12-06 05:48:01,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:48:01,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:01,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:48:01,171 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-06 05:48:01,173 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-06 05:48:01,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:48:01,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:48:01,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:48:01,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:48:01,345 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-06 05:48:01,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:48:01,408 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-06 05:48:01,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630626057] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:48:01,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:48:01,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 05:48:01,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741287973] [2022-12-06 05:48:01,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:48:01,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:48:01,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:01,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:48:01,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:48:01,410 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 103 [2022-12-06 05:48:01,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 412 transitions, 6956 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-06 05:48:01,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:01,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 103 [2022-12-06 05:48:01,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:03,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:48:07,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:48:09,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:48:11,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:48:13,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:48:15,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:48:19,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:48:21,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:48:23,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:48:25,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:48:27,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:48:29,385 INFO L130 PetriNetUnfolder]: 1229/2273 cut-off events. [2022-12-06 05:48:29,385 INFO L131 PetriNetUnfolder]: For 30913/30913 co-relation queries the response was YES. [2022-12-06 05:48:29,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18267 conditions, 2273 events. 1229/2273 cut-off events. For 30913/30913 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 14640 event pairs, 112 based on Foata normal form. 7/2277 useless extension candidates. Maximal degree in co-relation 17911. Up to 1010 conditions per place. [2022-12-06 05:48:29,405 INFO L137 encePairwiseOnDemand]: 24/103 looper letters, 403 selfloop transitions, 243 changer transitions 14/660 dead transitions. [2022-12-06 05:48:29,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 660 transitions, 12095 flow [2022-12-06 05:48:29,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:48:29,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:48:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 174 transitions. [2022-12-06 05:48:29,407 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09937178754997145 [2022-12-06 05:48:29,407 INFO L175 Difference]: Start difference. First operand has 161 places, 412 transitions, 6956 flow. Second operand 17 states and 174 transitions. [2022-12-06 05:48:29,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 660 transitions, 12095 flow [2022-12-06 05:48:29,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 660 transitions, 12019 flow, removed 25 selfloop flow, removed 3 redundant places. [2022-12-06 05:48:29,578 INFO L231 Difference]: Finished difference. Result has 180 places, 526 transitions, 9679 flow [2022-12-06 05:48:29,579 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=6902, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=9679, PETRI_PLACES=180, PETRI_TRANSITIONS=526} [2022-12-06 05:48:29,579 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 159 predicate places. [2022-12-06 05:48:29,579 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:29,579 INFO L89 Accepts]: Start accepts. Operand has 180 places, 526 transitions, 9679 flow [2022-12-06 05:48:29,582 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:29,582 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:29,582 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 526 transitions, 9679 flow [2022-12-06 05:48:29,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 526 transitions, 9679 flow [2022-12-06 05:48:29,887 INFO L130 PetriNetUnfolder]: 802/1723 cut-off events. [2022-12-06 05:48:29,887 INFO L131 PetriNetUnfolder]: For 22655/22729 co-relation queries the response was YES. [2022-12-06 05:48:29,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13883 conditions, 1723 events. 802/1723 cut-off events. For 22655/22729 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 12342 event pairs, 59 based on Foata normal form. 4/1711 useless extension candidates. Maximal degree in co-relation 13701. Up to 764 conditions per place. [2022-12-06 05:48:29,909 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 526 transitions, 9679 flow [2022-12-06 05:48:29,909 INFO L188 LiptonReduction]: Number of co-enabled transitions 580 [2022-12-06 05:48:30,593 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:48:30,938 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [854] $Ultimate##0-->L49-2: Formula: (let ((.cse3 (select |v_#memory_int_281| v_~f~0.base_207))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_207 (* v_~x2~0_352 4))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_207 (* .cse7 4)))) (.cse2 (select .cse3 (+ v_~f~0.offset_207 (* v_~x1~0_276 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_207 (* 4 .cse2)))) (.cse6 (select .cse3 (+ v_~f~0.offset_207 (* 4 .cse5))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_207 (* .cse6 4)))) (.cse4 (select .cse3 (+ v_~f~0.offset_207 (* .cse1 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_229| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_223)) 1 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_223)) 1 0) 0)) (< 3 (mod (* 5 v_~n~0_190) 4294967296)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_223)) 1 0) 0)) (= v_~x1~0_274 (select .cse3 (+ v_~f~0.offset_207 (* 4 .cse4)))) (not (= (ite (and (<= 0 v_~x2~0_352) (< v_~x2~0_352 v_~size~0_223)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_223)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_207 (* .cse0 4))) v_~x2~0_351) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_159| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_229| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_267|) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_326|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_145| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_159|) (not (= (ite (and (< .cse6 v_~size~0_223) (<= 0 .cse6)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_215| 4) (= |v_ULTIMATE.start_main_#t~mem20#1_68| (select (select |v_#memory_int_281| |v_ULTIMATE.start_main_~#t1~0#1.base_81|) |v_ULTIMATE.start_main_~#t1~0#1.offset_81|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_145| (ite (and (< .cse4 v_~size~0_223) (<= 0 .cse4)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_267| 0)) (not (= (ite (and (< v_~x1~0_276 v_~size~0_223) (<= 0 v_~x1~0_276)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_223)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_352, ~size~0=v_~size~0_223, ~f~0.base=v_~f~0.base_207, #memory_int=|v_#memory_int_281|, ~n~0=v_~n~0_190, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_81|, ~x1~0=v_~x1~0_276, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_81|, ~f~0.offset=v_~f~0.offset_207} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_74|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_153|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_121|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_125|, ~f~0.base=v_~f~0.base_207, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_123|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_229|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_326|, ~x1~0=v_~x1~0_274, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_81|, ~f~0.offset=v_~f~0.offset_207, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_121|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_159|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_133|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_127|, ~x2~0=v_~x2~0_351, ~size~0=v_~size~0_223, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_119|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_135|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_81|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_267|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_145|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_141|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_215|, #memory_int=|v_#memory_int_281|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_123|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_57|, ~n~0=v_~n~0_190, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_165|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem20#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, ULTIMATE.start_main_#t~nondet19#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [931] L59-2-->L59-2: Formula: (let ((.cse7 (select |v_#memory_int_417| v_~f~0.base_337))) (let ((.cse4 (select .cse7 (+ v_~f~0.offset_337 (* v_~x2~0_383 4))))) (let ((.cse1 (select .cse7 (+ v_~f~0.offset_337 (* .cse4 4))))) (let ((.cse3 (select .cse7 (+ v_~f~0.offset_337 (* .cse1 4))))) (let ((.cse5 (select .cse7 (+ v_~f~0.offset_337 (* 4 .cse3))))) (let ((.cse9 (select .cse7 (+ v_~f~0.offset_337 (* .cse5 4))))) (let ((.cse10 (select .cse7 (+ v_~f~0.offset_337 (* .cse9 4))))) (let ((.cse8 (select .cse7 (+ v_~f~0.offset_337 (* .cse10 4))))) (let ((.cse2 (select .cse7 (+ v_~f~0.offset_337 (* 4 .cse8))))) (let ((.cse6 (select .cse7 (+ (* .cse2 4) v_~f~0.offset_337))) (.cse0 (mod (* 5 v_~n~0_320) 4294967296))) (and (< (mod (+ 4294967291 |v_thread2Thread1of1ForFork1_~i~1#1_457|) 4294967296) .cse0) (not (= (ite (and (< .cse1 v_~size~0_353) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_353)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_353)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_252| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_290|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_353)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_353) (<= 0 .cse5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_252| (ite (and (< .cse6 v_~size~0_353) (<= 0 .cse6)) 1 0)) (= (select .cse7 (+ v_~f~0.offset_337 (* .cse6 4))) v_~x2~0_381) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_459| 4294967296) .cse0) (= |v_thread2Thread1of1ForFork1_~i~1#1_457| (+ |v_thread2Thread1of1ForFork1_~i~1#1_459| 10)) (not (= (ite (and (< .cse8 v_~size~0_353) (<= 0 .cse8)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_290| 0)) (not (= (ite (and (<= 0 v_~x2~0_383) (< v_~x2~0_383 v_~size~0_353)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_353)) 1 0))) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_353)) 1 0) 0))))))))))))) InVars {~x2~0=v_~x2~0_383, ~size~0=v_~size~0_353, ~f~0.base=v_~f~0.base_337, #memory_int=|v_#memory_int_417|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_459|, ~n~0=v_~n~0_320, ~f~0.offset=v_~f~0.offset_337} OutVars{~x2~0=v_~x2~0_381, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_144|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_148|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_142|, ~size~0=v_~size~0_353, ~f~0.base=v_~f~0.base_337, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_158|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_146|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_252|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_457|, ~f~0.offset=v_~f~0.offset_337, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_290|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_144|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_164|, #memory_int=|v_#memory_int_417|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_146|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_156|, ~n~0=v_~n~0_320, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_150|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:48:32,559 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [854] $Ultimate##0-->L49-2: Formula: (let ((.cse3 (select |v_#memory_int_281| v_~f~0.base_207))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_207 (* v_~x2~0_352 4))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_207 (* .cse7 4)))) (.cse2 (select .cse3 (+ v_~f~0.offset_207 (* v_~x1~0_276 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_207 (* 4 .cse2)))) (.cse6 (select .cse3 (+ v_~f~0.offset_207 (* 4 .cse5))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_207 (* .cse6 4)))) (.cse4 (select .cse3 (+ v_~f~0.offset_207 (* .cse1 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_229| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_223)) 1 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_223)) 1 0) 0)) (< 3 (mod (* 5 v_~n~0_190) 4294967296)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_223)) 1 0) 0)) (= v_~x1~0_274 (select .cse3 (+ v_~f~0.offset_207 (* 4 .cse4)))) (not (= (ite (and (<= 0 v_~x2~0_352) (< v_~x2~0_352 v_~size~0_223)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_223)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_207 (* .cse0 4))) v_~x2~0_351) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_159| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_229| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_267|) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_326|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_145| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_159|) (not (= (ite (and (< .cse6 v_~size~0_223) (<= 0 .cse6)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_215| 4) (= |v_ULTIMATE.start_main_#t~mem20#1_68| (select (select |v_#memory_int_281| |v_ULTIMATE.start_main_~#t1~0#1.base_81|) |v_ULTIMATE.start_main_~#t1~0#1.offset_81|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_145| (ite (and (< .cse4 v_~size~0_223) (<= 0 .cse4)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_267| 0)) (not (= (ite (and (< v_~x1~0_276 v_~size~0_223) (<= 0 v_~x1~0_276)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_223)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_352, ~size~0=v_~size~0_223, ~f~0.base=v_~f~0.base_207, #memory_int=|v_#memory_int_281|, ~n~0=v_~n~0_190, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_81|, ~x1~0=v_~x1~0_276, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_81|, ~f~0.offset=v_~f~0.offset_207} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_74|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_153|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_121|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_125|, ~f~0.base=v_~f~0.base_207, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_123|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_229|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_326|, ~x1~0=v_~x1~0_274, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_81|, ~f~0.offset=v_~f~0.offset_207, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_121|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_159|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_133|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_127|, ~x2~0=v_~x2~0_351, ~size~0=v_~size~0_223, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_119|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_135|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_81|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_267|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_145|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_141|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_215|, #memory_int=|v_#memory_int_281|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_123|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_57|, ~n~0=v_~n~0_190, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_165|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem20#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, ULTIMATE.start_main_#t~nondet19#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [932] L59-2-->L49-2: Formula: (let ((.cse5 (select |v_#memory_int_419| v_~f~0.base_339))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_339 (* v_~x2~0_388 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_339 (* 4 .cse4))))) (let ((.cse0 (select .cse5 (+ v_~f~0.offset_339 (* .cse3 4))))) (let ((.cse1 (mod (* 5 v_~n~0_322) 4294967296)) (.cse2 (select .cse5 (+ v_~f~0.offset_339 (* .cse0 4))))) (and (not (= 0 (ite (and (< .cse0 v_~size~0_355) (<= 0 .cse0)) 1 0))) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_464| 4294967296) .cse1) (= (ite (and (<= 0 v_~x1~0_577) (< v_~x1~0_577 v_~size~0_355)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_316|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_517| 4294967296) .cse1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_316| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_330|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_294| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_256| (ite (and (< .cse2 v_~size~0_355) (<= 0 .cse2)) 1 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_355)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_355)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_463| (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_464|)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_330| 0)) (= (select .cse5 (+ v_~f~0.offset_339 (* .cse2 4))) v_~x2~0_387) (= |v_thread1Thread1of1ForFork0_~i~0#1_516| (+ |v_thread1Thread1of1ForFork0_~i~0#1_517| 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_256| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_294|) (not (= (ite (and (< v_~x2~0_388 v_~size~0_355) (<= 0 v_~x2~0_388)) 1 0) 0)) (= (select .cse5 (+ v_~f~0.offset_339 (* v_~x1~0_577 4))) v_~x1~0_576))))))) InVars {~x2~0=v_~x2~0_388, ~size~0=v_~size~0_355, ~f~0.base=v_~f~0.base_339, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_517|, #memory_int=|v_#memory_int_419|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_464|, ~n~0=v_~n~0_322, ~x1~0=v_~x1~0_577, ~f~0.offset=v_~f~0.offset_339} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_324|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_148|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_152|, ~f~0.base=v_~f~0.base_339, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_150|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_256|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_463|, ~x1~0=v_~x1~0_576, ~f~0.offset=v_~f~0.offset_339, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_330|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_160|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_154|, ~x2~0=v_~x2~0_387, ~size~0=v_~size~0_355, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_146|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_162|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_294|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_316|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_168|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_516|, #memory_int=|v_#memory_int_419|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_150|, ~n~0=v_~n~0_322, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_336|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:48:34,224 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [854] $Ultimate##0-->L49-2: Formula: (let ((.cse3 (select |v_#memory_int_281| v_~f~0.base_207))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_207 (* v_~x2~0_352 4))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_207 (* .cse7 4)))) (.cse2 (select .cse3 (+ v_~f~0.offset_207 (* v_~x1~0_276 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_207 (* 4 .cse2)))) (.cse6 (select .cse3 (+ v_~f~0.offset_207 (* 4 .cse5))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_207 (* .cse6 4)))) (.cse4 (select .cse3 (+ v_~f~0.offset_207 (* .cse1 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_229| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_223)) 1 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_223)) 1 0) 0)) (< 3 (mod (* 5 v_~n~0_190) 4294967296)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_223)) 1 0) 0)) (= v_~x1~0_274 (select .cse3 (+ v_~f~0.offset_207 (* 4 .cse4)))) (not (= (ite (and (<= 0 v_~x2~0_352) (< v_~x2~0_352 v_~size~0_223)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_223)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_207 (* .cse0 4))) v_~x2~0_351) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_159| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_229| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_267|) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_326|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_145| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_159|) (not (= (ite (and (< .cse6 v_~size~0_223) (<= 0 .cse6)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_215| 4) (= |v_ULTIMATE.start_main_#t~mem20#1_68| (select (select |v_#memory_int_281| |v_ULTIMATE.start_main_~#t1~0#1.base_81|) |v_ULTIMATE.start_main_~#t1~0#1.offset_81|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_145| (ite (and (< .cse4 v_~size~0_223) (<= 0 .cse4)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_267| 0)) (not (= (ite (and (< v_~x1~0_276 v_~size~0_223) (<= 0 v_~x1~0_276)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_223)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_352, ~size~0=v_~size~0_223, ~f~0.base=v_~f~0.base_207, #memory_int=|v_#memory_int_281|, ~n~0=v_~n~0_190, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_81|, ~x1~0=v_~x1~0_276, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_81|, ~f~0.offset=v_~f~0.offset_207} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_74|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_153|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_121|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_125|, ~f~0.base=v_~f~0.base_207, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_123|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_229|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_326|, ~x1~0=v_~x1~0_274, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_81|, ~f~0.offset=v_~f~0.offset_207, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_121|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_159|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_133|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_127|, ~x2~0=v_~x2~0_351, ~size~0=v_~size~0_223, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_119|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_135|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_81|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_267|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_145|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_141|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_215|, #memory_int=|v_#memory_int_281|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_123|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_57|, ~n~0=v_~n~0_190, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_165|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem20#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, ULTIMATE.start_main_#t~nondet19#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:48:35,127 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [854] $Ultimate##0-->L49-2: Formula: (let ((.cse3 (select |v_#memory_int_281| v_~f~0.base_207))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_207 (* v_~x2~0_352 4))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_207 (* .cse7 4)))) (.cse2 (select .cse3 (+ v_~f~0.offset_207 (* v_~x1~0_276 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_207 (* 4 .cse2)))) (.cse6 (select .cse3 (+ v_~f~0.offset_207 (* 4 .cse5))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_207 (* .cse6 4)))) (.cse4 (select .cse3 (+ v_~f~0.offset_207 (* .cse1 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_229| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_223)) 1 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_223)) 1 0) 0)) (< 3 (mod (* 5 v_~n~0_190) 4294967296)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_223)) 1 0) 0)) (= v_~x1~0_274 (select .cse3 (+ v_~f~0.offset_207 (* 4 .cse4)))) (not (= (ite (and (<= 0 v_~x2~0_352) (< v_~x2~0_352 v_~size~0_223)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_223)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_207 (* .cse0 4))) v_~x2~0_351) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_159| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_229| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_267|) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_326|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_145| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_159|) (not (= (ite (and (< .cse6 v_~size~0_223) (<= 0 .cse6)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_215| 4) (= |v_ULTIMATE.start_main_#t~mem20#1_68| (select (select |v_#memory_int_281| |v_ULTIMATE.start_main_~#t1~0#1.base_81|) |v_ULTIMATE.start_main_~#t1~0#1.offset_81|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_145| (ite (and (< .cse4 v_~size~0_223) (<= 0 .cse4)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_267| 0)) (not (= (ite (and (< v_~x1~0_276 v_~size~0_223) (<= 0 v_~x1~0_276)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_223)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_352, ~size~0=v_~size~0_223, ~f~0.base=v_~f~0.base_207, #memory_int=|v_#memory_int_281|, ~n~0=v_~n~0_190, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_81|, ~x1~0=v_~x1~0_276, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_81|, ~f~0.offset=v_~f~0.offset_207} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_74|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_153|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_121|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_125|, ~f~0.base=v_~f~0.base_207, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_123|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_229|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_326|, ~x1~0=v_~x1~0_274, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_81|, ~f~0.offset=v_~f~0.offset_207, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_121|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_159|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_133|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_127|, ~x2~0=v_~x2~0_351, ~size~0=v_~size~0_223, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_119|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_135|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_81|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_267|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_145|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_141|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_215|, #memory_int=|v_#memory_int_281|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_123|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_57|, ~n~0=v_~n~0_190, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_165|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem20#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, ULTIMATE.start_main_#t~nondet19#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [929] L59-2-->thread2EXIT: Formula: (let ((.cse1 (select |v_#memory_int_415| v_~f~0.base_335))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_335 (* v_~x2~0_378 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_335 (* 4 .cse5))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_335 (* .cse4 4))))) (let ((.cse0 (mod (* 5 v_~n~0_318) 4294967296)) (.cse2 (select .cse1 (+ v_~f~0.offset_335 (* .cse3 4))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_288| 0)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_147| 0) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_454| 4294967296) .cse0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_453| 4294967296) .cse0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_453| (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_454|)) (= (select .cse1 (+ v_~f~0.offset_335 (* .cse2 4))) v_~x2~0_377) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_351)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_351)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_#res#1.base_147| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_250| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_288|) (not (= (ite (and (< .cse5 v_~size~0_351) (<= 0 .cse5)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_250| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_351)) 1 0)) (not (= (ite (and (< v_~x2~0_378 v_~size~0_351) (<= 0 v_~x2~0_378)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_378, ~size~0=v_~size~0_351, ~f~0.base=v_~f~0.base_335, #memory_int=|v_#memory_int_415|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_454|, ~n~0=v_~n~0_318, ~f~0.offset=v_~f~0.offset_335} OutVars{~x2~0=v_~x2~0_377, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_142|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_146|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_140|, ~size~0=v_~size~0_351, ~f~0.base=v_~f~0.base_335, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_147|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_156|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_144|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_250|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_453|, ~f~0.offset=v_~f~0.offset_335, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_288|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_147|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_142|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_162|, #memory_int=|v_#memory_int_415|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_144|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_154|, ~n~0=v_~n~0_318, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_148|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:48:36,204 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [937] $Ultimate##0-->L49-2: Formula: (let ((.cse3 (select |v_#memory_int_425| v_~f~0.base_345))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_345 (* v_~x2~0_404 4)))) (.cse8 (select .cse3 (+ v_~f~0.offset_345 (* v_~x1~0_592 4))))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_345 (* 4 .cse8)))) (.cse6 (select .cse3 (+ v_~f~0.offset_345 (* .cse0 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_345 (* .cse6 4)))) (.cse1 (select .cse3 (+ v_~f~0.offset_345 (* .cse7 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_345 (* .cse1 4)))) (.cse5 (select .cse3 (+ v_~f~0.offset_345 (* .cse2 4))))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_338| 0)) (= |v_ULTIMATE.start_main_#t~mem20#1_90| (select (select |v_#memory_int_425| |v_ULTIMATE.start_main_~#t1~0#1.base_89|) |v_ULTIMATE.start_main_~#t1~0#1.offset_89|)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_361)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_526| 4294967295) 4294967296) (mod (* 5 v_~n~0_328) 4294967296)) (not (= (ite (and (<= 0 v_~x2~0_404) (< v_~x2~0_404 v_~size~0_361)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_361)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_592) (< v_~x1~0_592 v_~size~0_361)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_361) (<= 0 .cse2)) 1 0) 0)) (= v_~x1~0_590 (select .cse3 (+ v_~f~0.offset_345 (* .cse4 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_266| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_361)) 1 0)) (= (ite (and (< .cse4 v_~size~0_361) (<= 0 .cse4)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_324|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_266| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_304|) (= |v_thread1Thread1of1ForFork0_~i~0#1_526| 5) (not (= (ite (and (< .cse6 v_~size~0_361) (<= 0 .cse6)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_304| 0)) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_475|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_324| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_338|) (not (= (ite (and (< .cse7 v_~size~0_361) (<= 0 .cse7)) 1 0) 0)) (= (select .cse3 (+ (* .cse5 4) v_~f~0.offset_345)) v_~x2~0_403) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_361)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_404, ~size~0=v_~size~0_361, ~f~0.base=v_~f~0.base_345, #memory_int=|v_#memory_int_425|, ~n~0=v_~n~0_328, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_89|, ~x1~0=v_~x1~0_592, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_89|, ~f~0.offset=v_~f~0.offset_345} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_93|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_332|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_158|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_162|, ~f~0.base=v_~f~0.base_345, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_160|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_266|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_475|, ~x1~0=v_~x1~0_590, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_89|, ~f~0.offset=v_~f~0.offset_345, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_158|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_338|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_170|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_164|, ~x2~0=v_~x2~0_403, ~size~0=v_~size~0_361, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_156|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_172|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_89|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_304|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_90|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_324|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_178|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_526|, #memory_int=|v_#memory_int_425|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_160|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_72|, ~n~0=v_~n~0_328, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_344|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem20#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, ULTIMATE.start_main_#t~nondet19#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:48:38,050 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [939] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse2 (select |v_#memory_int_429| v_~f~0.base_349))) (let ((.cse6 (select .cse2 (+ v_~f~0.offset_349 (* v_~x2~0_415 4))))) (let ((.cse11 (select .cse2 (+ v_~f~0.offset_349 (* .cse6 4))))) (let ((.cse9 (select .cse2 (+ v_~f~0.offset_349 (* .cse11 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_349 (* .cse9 4))))) (let ((.cse7 (select .cse2 (+ v_~f~0.offset_349 (* .cse0 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_349 (* .cse7 4))))) (let ((.cse5 (select .cse2 (+ v_~f~0.offset_349 (* .cse1 4)))) (.cse10 (select .cse2 (+ v_~f~0.offset_349 (* v_~x1~0_601 4))))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_349 (* 4 .cse10)))) (.cse13 (select .cse2 (+ v_~f~0.offset_349 (* .cse5 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_349 (* .cse13 4)))) (.cse8 (mod (* 5 v_~n~0_332) 4294967296)) (.cse12 (select .cse2 (+ v_~f~0.offset_349 (* 4 .cse4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_365)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_365) (<= 0 .cse1)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_272| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_310|) (not (= (ite (and (< v_~x2~0_415 v_~size~0_365) (<= 0 v_~x2~0_415)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_349 (* .cse3 4))) v_~x2~0_413) (not (= (ite (and (< .cse4 v_~size~0_365) (<= 0 .cse4)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_532| 4) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_344| 0)) (not (= (ite (and (< .cse5 v_~size~0_365) (<= 0 .cse5)) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~mem20#1_94| (select (select |v_#memory_int_429| |v_ULTIMATE.start_main_~#t1~0#1.base_93|) |v_ULTIMATE.start_main_~#t1~0#1.offset_93|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_272| (ite (and (< .cse3 v_~size~0_365) (<= 0 .cse3)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_310| 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_365)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_365) (<= 0 .cse7)) 1 0) 0)) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_481| 4294967296) .cse8)) (not (= (ite (and (< .cse9 v_~size~0_365) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_365)) 1 0) 0)) (< (mod (+ 4294967291 |v_thread2Thread1of1ForFork1_~i~1#1_481|) 4294967296) .cse8) (= |v_thread2Thread1of1ForFork1_#res#1.offset_149| 0) (not (= (ite (and (< v_~x1~0_601 v_~size~0_365) (<= 0 v_~x1~0_601)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_481| 10) (not (= (ite (and (< .cse11 v_~size~0_365) (<= 0 .cse11)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_349 (* .cse12 4))) v_~x1~0_600) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_330| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_344|) (not (= (ite (and (< .cse13 v_~size~0_365) (<= 0 .cse13)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_#res#1.base_149| 0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_330| (ite (and (< .cse12 v_~size~0_365) (<= 0 .cse12)) 1 0))))))))))))) InVars {~x2~0=v_~x2~0_415, ~size~0=v_~size~0_365, ~f~0.base=v_~f~0.base_349, #memory_int=|v_#memory_int_429|, ~n~0=v_~n~0_332, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_93|, ~x1~0=v_~x1~0_601, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_93|, ~f~0.offset=v_~f~0.offset_349} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_97|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_338|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_164|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_168|, ~f~0.base=v_~f~0.base_349, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_149|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_166|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_272|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_481|, ~x1~0=v_~x1~0_600, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_93|, ~f~0.offset=v_~f~0.offset_349, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_164|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_344|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_176|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_170|, ~x2~0=v_~x2~0_413, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_162|, ~size~0=v_~size~0_365, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_178|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_93|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_310|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_94|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_330|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_149|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_184|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_532|, #memory_int=|v_#memory_int_429|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_166|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_76|, ~n~0=v_~n~0_332, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_350|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_#t~mem9#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, ~x2~0, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem20#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, ULTIMATE.start_main_#t~nondet19#1, thread1Thread1of1ForFork0_#t~mem1#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:48:39,133 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [935] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_423| v_~f~0.base_343))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_343 (* v_~x2~0_399 4))))) (let ((.cse8 (select .cse0 (+ (* .cse2 4) v_~f~0.offset_343)))) (let ((.cse12 (select .cse0 (+ v_~f~0.offset_343 (* 4 .cse8))))) (let ((.cse9 (select .cse0 (+ v_~f~0.offset_343 (* .cse12 4))))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_343 (* .cse9 4))))) (let ((.cse13 (select .cse0 (+ v_~f~0.offset_343 (* v_~x1~0_586 4)))) (.cse7 (select .cse0 (+ v_~f~0.offset_343 (* .cse6 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_343 (* 4 .cse7)))) (.cse5 (select .cse0 (+ v_~f~0.offset_343 (* .cse13 4))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_343 (* .cse5 4)))) (.cse11 (select .cse0 (+ v_~f~0.offset_343 (* .cse3 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_343 (* .cse11 4)))) (.cse10 (select .cse0 (+ v_~f~0.offset_343 (* .cse4 4))))) (and (= (select .cse0 (+ v_~f~0.offset_343 (* .cse1 4))) v_~x2~0_397) (not (= (ite (and (< .cse2 v_~size~0_359) (<= 0 .cse2)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_359)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_262| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_300|) (not (= (ite (and (< .cse4 v_~size~0_359) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_359) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_586) (< v_~x1~0_586 v_~size~0_359)) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~mem20#1_88| (select (select |v_#memory_int_423| |v_ULTIMATE.start_main_~#t1~0#1.base_87|) |v_ULTIMATE.start_main_~#t1~0#1.offset_87|)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_359)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_359) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_359)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_359) (<= 0 .cse9)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_343 (* .cse10 4))) v_~x1~0_584) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_262| (ite (and (< .cse1 v_~size~0_359) (<= 0 .cse1)) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_471| 10) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_359)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_300| 0)) (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_359)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_320|) (not (= (ite (and (< .cse12 v_~size~0_359) (<= 0 .cse12)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_320| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_334|) (not (= (ite (and (< .cse13 v_~size~0_359) (<= 0 .cse13)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_334| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_522| 5) (< 5 (mod (* 5 v_~n~0_326) 4294967296)) (not (= (ite (and (<= 0 v_~x2~0_399) (< v_~x2~0_399 v_~size~0_359)) 1 0) 0))))))))))))) InVars {~x2~0=v_~x2~0_399, ~size~0=v_~size~0_359, ~f~0.base=v_~f~0.base_343, #memory_int=|v_#memory_int_423|, ~n~0=v_~n~0_326, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_87|, ~x1~0=v_~x1~0_586, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_87|, ~f~0.offset=v_~f~0.offset_343} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_91|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_328|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_154|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_158|, ~f~0.base=v_~f~0.base_343, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_156|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_262|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_471|, ~x1~0=v_~x1~0_584, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_87|, ~f~0.offset=v_~f~0.offset_343, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_154|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_334|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_166|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_160|, ~x2~0=v_~x2~0_397, ~size~0=v_~size~0_359, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_152|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_168|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_87|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_300|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_88|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_320|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_174|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_522|, #memory_int=|v_#memory_int_423|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_156|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_70|, ~n~0=v_~n~0_326, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_340|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem20#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, ULTIMATE.start_main_#t~nondet19#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:48:41,118 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [935] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_423| v_~f~0.base_343))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_343 (* v_~x2~0_399 4))))) (let ((.cse8 (select .cse0 (+ (* .cse2 4) v_~f~0.offset_343)))) (let ((.cse12 (select .cse0 (+ v_~f~0.offset_343 (* 4 .cse8))))) (let ((.cse9 (select .cse0 (+ v_~f~0.offset_343 (* .cse12 4))))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_343 (* .cse9 4))))) (let ((.cse13 (select .cse0 (+ v_~f~0.offset_343 (* v_~x1~0_586 4)))) (.cse7 (select .cse0 (+ v_~f~0.offset_343 (* .cse6 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_343 (* 4 .cse7)))) (.cse5 (select .cse0 (+ v_~f~0.offset_343 (* .cse13 4))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_343 (* .cse5 4)))) (.cse11 (select .cse0 (+ v_~f~0.offset_343 (* .cse3 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_343 (* .cse11 4)))) (.cse10 (select .cse0 (+ v_~f~0.offset_343 (* .cse4 4))))) (and (= (select .cse0 (+ v_~f~0.offset_343 (* .cse1 4))) v_~x2~0_397) (not (= (ite (and (< .cse2 v_~size~0_359) (<= 0 .cse2)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_359)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_262| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_300|) (not (= (ite (and (< .cse4 v_~size~0_359) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_359) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_586) (< v_~x1~0_586 v_~size~0_359)) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~mem20#1_88| (select (select |v_#memory_int_423| |v_ULTIMATE.start_main_~#t1~0#1.base_87|) |v_ULTIMATE.start_main_~#t1~0#1.offset_87|)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_359)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_359) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_359)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_359) (<= 0 .cse9)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_343 (* .cse10 4))) v_~x1~0_584) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_262| (ite (and (< .cse1 v_~size~0_359) (<= 0 .cse1)) 1 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_471| 10) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_359)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_300| 0)) (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_359)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_320|) (not (= (ite (and (< .cse12 v_~size~0_359) (<= 0 .cse12)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_320| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_334|) (not (= (ite (and (< .cse13 v_~size~0_359) (<= 0 .cse13)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_334| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_522| 5) (< 5 (mod (* 5 v_~n~0_326) 4294967296)) (not (= (ite (and (<= 0 v_~x2~0_399) (< v_~x2~0_399 v_~size~0_359)) 1 0) 0))))))))))))) InVars {~x2~0=v_~x2~0_399, ~size~0=v_~size~0_359, ~f~0.base=v_~f~0.base_343, #memory_int=|v_#memory_int_423|, ~n~0=v_~n~0_326, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_87|, ~x1~0=v_~x1~0_586, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_87|, ~f~0.offset=v_~f~0.offset_343} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_91|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_328|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_154|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_158|, ~f~0.base=v_~f~0.base_343, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_156|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_262|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_471|, ~x1~0=v_~x1~0_584, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_87|, ~f~0.offset=v_~f~0.offset_343, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_154|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_334|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_166|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_160|, ~x2~0=v_~x2~0_397, ~size~0=v_~size~0_359, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_152|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_168|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_87|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_300|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_88|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_320|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_174|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_522|, #memory_int=|v_#memory_int_423|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_156|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_70|, ~n~0=v_~n~0_326, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_340|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem20#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, ULTIMATE.start_main_#t~nondet19#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [895] L59-2-->L49-2: Formula: (let ((.cse0 (mod (* 5 v_~n~0_254) 4294967296))) (and (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_256| 0)) (= (ite (and (<= 0 v_~x1~0_437) (< v_~x1~0_437 v_~size~0_287)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_242|) (= |v_thread1Thread1of1ForFork0_~i~0#1_377| (+ |v_thread1Thread1of1ForFork0_~i~0#1_378| 1)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_242| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_256|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_84| 0) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_378| 4294967296) .cse0) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_84|) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_389| 4294967296) .cse0)) (= (select (select |v_#memory_int_350| v_~f~0.base_271) (+ v_~f~0.offset_271 (* v_~x1~0_437 4))) v_~x1~0_436))) InVars {~size~0=v_~size~0_287, ~f~0.base=v_~f~0.base_271, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_378|, #memory_int=|v_#memory_int_350|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_389|, ~n~0=v_~n~0_254, ~x1~0=v_~x1~0_437, ~f~0.offset=v_~f~0.offset_271} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_250|, ~size~0=v_~size~0_287, ~f~0.base=v_~f~0.base_271, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_84|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_389|, ~x1~0=v_~x1~0_436, ~f~0.offset=v_~f~0.offset_271, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_242|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_84|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_377|, #memory_int=|v_#memory_int_350|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_256|, ~n~0=v_~n~0_254, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_262|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:48:43,484 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [858] L49-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_290| v_~f~0.base_211))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_211 (* v_~x1~0_300 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_211 (* .cse3 4)))) (.cse2 (mod (* 5 v_~n~0_194) 4294967296))) (and (= v_~x1~0_298 (select .cse0 (+ v_~f~0.offset_211 (* .cse1 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_178| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_240| 4294967296) .cse2) (not (= (ite (and (< .cse3 v_~size~0_227) (<= 0 .cse3)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_238| (+ |v_thread1Thread1of1ForFork0_~i~0#1_240| 3)) (not (= (ite (and (< v_~x1~0_300 v_~size~0_227) (<= 0 v_~x1~0_300)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_164| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_178|) (= (ite (and (< .cse1 v_~size~0_227) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_164|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_238| 4294967295) 4294967296) .cse2) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_238| 4294967294) 4294967296) .cse2))))) InVars {~size~0=v_~size~0_227, ~f~0.base=v_~f~0.base_211, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_240|, #memory_int=|v_#memory_int_290|, ~n~0=v_~n~0_194, ~x1~0=v_~x1~0_300, ~f~0.offset=v_~f~0.offset_211} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_172|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_164|, ~size~0=v_~size~0_227, ~f~0.base=v_~f~0.base_211, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_238|, #memory_int=|v_#memory_int_290|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_178|, ~n~0=v_~n~0_194, ~x1~0=v_~x1~0_298, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_184|, ~f~0.offset=v_~f~0.offset_211} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:48:44,005 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:48:44,284 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:48:44,555 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 05:48:44,556 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14977 [2022-12-06 05:48:44,556 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 526 transitions, 9937 flow [2022-12-06 05:48:44,556 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-06 05:48:44,556 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:44,556 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:44,563 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-06 05:48:44,757 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,SelfDestructingSolverStorable20 [2022-12-06 05:48:44,757 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:48:44,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:44,757 INFO L85 PathProgramCache]: Analyzing trace with hash 103053954, now seen corresponding path program 1 times [2022-12-06 05:48:44,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:44,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791351135] [2022-12-06 05:48:44,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:44,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:44,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:44,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791351135] [2022-12-06 05:48:44,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791351135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:48:44,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:48:44,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:48:44,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275441126] [2022-12-06 05:48:44,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:48:44,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:48:44,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:44,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:48:44,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:48:44,844 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 116 [2022-12-06 05:48:44,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 526 transitions, 9937 flow. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:44,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:44,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 116 [2022-12-06 05:48:44,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:45,636 INFO L130 PetriNetUnfolder]: 1217/2239 cut-off events. [2022-12-06 05:48:45,636 INFO L131 PetriNetUnfolder]: For 34774/34774 co-relation queries the response was YES. [2022-12-06 05:48:45,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19608 conditions, 2239 events. 1217/2239 cut-off events. For 34774/34774 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 14214 event pairs, 315 based on Foata normal form. 4/2239 useless extension candidates. Maximal degree in co-relation 19228. Up to 2185 conditions per place. [2022-12-06 05:48:45,653 INFO L137 encePairwiseOnDemand]: 102/116 looper letters, 491 selfloop transitions, 45 changer transitions 6/542 dead transitions. [2022-12-06 05:48:45,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 542 transitions, 11274 flow [2022-12-06 05:48:45,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:48:45,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:48:45,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-12-06 05:48:45,654 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27801724137931033 [2022-12-06 05:48:45,654 INFO L175 Difference]: Start difference. First operand has 177 places, 526 transitions, 9937 flow. Second operand 4 states and 129 transitions. [2022-12-06 05:48:45,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 542 transitions, 11274 flow [2022-12-06 05:48:45,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 542 transitions, 11001 flow, removed 125 selfloop flow, removed 3 redundant places. [2022-12-06 05:48:45,793 INFO L231 Difference]: Finished difference. Result has 179 places, 527 transitions, 9832 flow [2022-12-06 05:48:45,793 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=9631, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=9832, PETRI_PLACES=179, PETRI_TRANSITIONS=527} [2022-12-06 05:48:45,793 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 158 predicate places. [2022-12-06 05:48:45,793 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:45,794 INFO L89 Accepts]: Start accepts. Operand has 179 places, 527 transitions, 9832 flow [2022-12-06 05:48:45,795 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:45,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:45,796 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 527 transitions, 9832 flow [2022-12-06 05:48:45,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 527 transitions, 9832 flow [2022-12-06 05:48:46,024 INFO L130 PetriNetUnfolder]: 709/1520 cut-off events. [2022-12-06 05:48:46,024 INFO L131 PetriNetUnfolder]: For 20972/21056 co-relation queries the response was YES. [2022-12-06 05:48:46,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12560 conditions, 1520 events. 709/1520 cut-off events. For 20972/21056 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 10678 event pairs, 61 based on Foata normal form. 0/1485 useless extension candidates. Maximal degree in co-relation 12443. Up to 695 conditions per place. [2022-12-06 05:48:46,038 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 527 transitions, 9832 flow [2022-12-06 05:48:46,039 INFO L188 LiptonReduction]: Number of co-enabled transitions 566 [2022-12-06 05:48:47,948 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [933] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_421| v_~f~0.base_341))) (let ((.cse16 (select .cse3 (+ v_~f~0.offset_341 (* v_~x2~0_393 4))))) (let ((.cse14 (select .cse3 (+ v_~f~0.offset_341 (* .cse16 4))))) (let ((.cse12 (select .cse3 (+ v_~f~0.offset_341 (* 4 .cse14))))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_341 (* 4 .cse12))))) (let ((.cse15 (select .cse3 (+ v_~f~0.offset_341 (* .cse7 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_341 (* .cse15 4))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_341 (* 4 .cse1))))) (let ((.cse17 (select .cse3 (+ v_~f~0.offset_341 (* .cse6 4))))) (let ((.cse5 (select .cse3 (+ (* .cse17 4) v_~f~0.offset_341)))) (let ((.cse9 (select .cse3 (+ v_~f~0.offset_341 (* .cse5 4))))) (let ((.cse8 (select .cse3 (+ v_~f~0.offset_341 (* .cse9 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_341 (* v_~x1~0_581 4)))) (.cse13 (select .cse3 (+ v_~f~0.offset_341 (* .cse8 4))))) (let ((.cse11 (select .cse3 (+ v_~f~0.offset_341 (* .cse13 4)))) (.cse2 (select .cse3 (+ v_~f~0.offset_341 (* .cse0 4))))) (let ((.cse10 (select .cse3 (+ v_~f~0.offset_341 (* .cse2 4)))) (.cse4 (select .cse3 (+ v_~f~0.offset_341 (* .cse11 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_357)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_357)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_357) (<= 0 .cse2)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_341 (* .cse4 4))) v_~x2~0_391) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_357)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_357)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_357) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_357)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_258| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_296|) (not (= (ite (and (<= 0 v_~x1~0_581) (< v_~x1~0_581 v_~size~0_357)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_332| 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_357)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_318| (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_357)) 1 0)) (= (select (select |v_#memory_int_421| |v_ULTIMATE.start_main_~#t1~0#1.base_85|) |v_ULTIMATE.start_main_~#t1~0#1.offset_85|) |v_ULTIMATE.start_main_#t~mem20#1_86|) (< (mod (+ 4294967291 |v_thread2Thread1of1ForFork1_~i~1#1_467|) 4294967296) (mod (* 5 v_~n~0_324) 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_296| 0)) (= v_~x1~0_580 (select .cse3 (+ v_~f~0.offset_341 (* .cse10 4)))) (not (= (ite (and (< .cse11 v_~size~0_357) (<= 0 .cse11)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_318| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_332|) (= |v_thread2Thread1of1ForFork1_~i~1#1_467| 15) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_357)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_520| 4) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_258| (ite (and (< .cse4 v_~size~0_357) (<= 0 .cse4)) 1 0)) (not (= (ite (and (< .cse13 v_~size~0_357) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_393) (< v_~x2~0_393 v_~size~0_357)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_357)) 1 0) 0)) (not (= (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_357)) 1 0) 0)) (not (= (ite (and (<= 0 .cse16) (< .cse16 v_~size~0_357)) 1 0) 0)) (not (= (ite (and (<= 0 .cse17) (< .cse17 v_~size~0_357)) 1 0) 0)))))))))))))))))) InVars {~x2~0=v_~x2~0_393, ~size~0=v_~size~0_357, ~f~0.base=v_~f~0.base_341, #memory_int=|v_#memory_int_421|, ~n~0=v_~n~0_324, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_85|, ~x1~0=v_~x1~0_581, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_85|, ~f~0.offset=v_~f~0.offset_341} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_89|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_326|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_150|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_154|, ~f~0.base=v_~f~0.base_341, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_152|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_258|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_467|, ~x1~0=v_~x1~0_580, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_85|, ~f~0.offset=v_~f~0.offset_341, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_150|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_332|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_162|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_156|, ~x2~0=v_~x2~0_391, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_148|, ~size~0=v_~size~0_357, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_164|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_85|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_296|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_86|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_318|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_170|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_520|, #memory_int=|v_#memory_int_421|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_152|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_68|, ~n~0=v_~n~0_324, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_338|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem20#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, ULTIMATE.start_main_#t~nondet19#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:48:54,255 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [841] L59-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_263| v_~f~0.base_191))) (let ((.cse8 (select .cse2 (+ v_~f~0.offset_191 (* v_~x2~0_312 4))))) (let ((.cse9 (select .cse2 (+ v_~f~0.offset_191 (* .cse8 4))))) (let ((.cse10 (select .cse2 (+ v_~f~0.offset_191 (* .cse9 4))))) (let ((.cse11 (select .cse2 (+ v_~f~0.offset_191 (* .cse10 4))))) (let ((.cse13 (select .cse2 (+ (* .cse11 4) v_~f~0.offset_191)))) (let ((.cse16 (select .cse2 (+ v_~f~0.offset_191 (* .cse13 4))))) (let ((.cse12 (select .cse2 (+ v_~f~0.offset_191 (* .cse16 4))))) (let ((.cse14 (select .cse2 (+ v_~f~0.offset_191 (* .cse12 4))))) (let ((.cse0 (select .cse2 (+ (* .cse14 4) v_~f~0.offset_191)))) (let ((.cse5 (select .cse2 (+ v_~f~0.offset_191 (* .cse0 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_191 (* .cse5 4))))) (let ((.cse7 (select .cse2 (+ v_~f~0.offset_191 (* .cse1 4))))) (let ((.cse15 (select .cse2 (+ v_~f~0.offset_191 (* .cse7 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_191 (* v_~x1~0_241 4)))) (.cse4 (mod (* 5 v_~n~0_174) 4294967296)) (.cse6 (select .cse2 (+ v_~f~0.offset_191 (* .cse15 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_201| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_239|) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_207)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_207)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_191 (* .cse3 4))) v_~x1~0_240) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_207)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_123|) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_286| 4294967296) .cse4) (not (= (ite (and (< .cse5 v_~size~0_207) (<= 0 .cse5)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_191 (* .cse6 4))) v_~x2~0_310) (not (= (ite (and (<= 0 v_~x2~0_312) (< v_~x2~0_312 v_~size~0_207)) 1 0) 0)) (< (mod (+ 4294967291 |v_thread2Thread1of1ForFork1_~i~1#1_284|) 4294967296) .cse4) (= |v_thread1Thread1of1ForFork0_~i~0#1_181| (+ |v_thread1Thread1of1ForFork0_~i~0#1_182| 2)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_207)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_207) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_207)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_207)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_182| 4294967296) .cse4) (not (= (ite (and (< v_~x1~0_241 v_~size~0_207) (<= 0 v_~x1~0_241)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_207) (<= 0 .cse11)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_137| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_239| 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_207)) 1 0) 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_207)) 1 0) 0)) (not (= (ite (and (< .cse14 v_~size~0_207) (<= 0 .cse14)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_284| 4294967286) 4294967296) .cse4) (not (= (ite (and (< .cse15 v_~size~0_207) (<= 0 .cse15)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_182| 1) 4294967296) .cse4) (not (= (ite (and (<= 0 .cse16) (< .cse16 v_~size~0_207)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_284| (+ |v_thread2Thread1of1ForFork1_~i~1#1_286| 15)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_123| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_137|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_201| (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_207)) 1 0)))))))))))))))))) InVars {~x2~0=v_~x2~0_312, ~size~0=v_~size~0_207, ~f~0.base=v_~f~0.base_191, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_182|, #memory_int=|v_#memory_int_263|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_286|, ~n~0=v_~n~0_174, ~x1~0=v_~x1~0_241, ~f~0.offset=v_~f~0.offset_191} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_131|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_93|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_97|, ~f~0.base=v_~f~0.base_191, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_95|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_201|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_284|, ~x1~0=v_~x1~0_240, ~f~0.offset=v_~f~0.offset_191, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_93|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_137|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_105|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_99|, ~x2~0=v_~x2~0_310, ~size~0=v_~size~0_207, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_91|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_107|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_239|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_123|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_113|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_181|, #memory_int=|v_#memory_int_263|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_95|, ~n~0=v_~n~0_174, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_143|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:48:58,287 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:48:58,288 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12495 [2022-12-06 05:48:58,288 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 527 transitions, 9896 flow [2022-12-06 05:48:58,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:58,288 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:58,288 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:58,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 05:48:58,288 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:48:58,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:58,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1329592888, now seen corresponding path program 1 times [2022-12-06 05:48:58,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:58,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195580695] [2022-12-06 05:48:58,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:58,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:58,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:58,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195580695] [2022-12-06 05:48:58,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195580695] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:48:58,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137573217] [2022-12-06 05:48:58,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:58,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:48:58,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:48:58,613 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-06 05:48:58,615 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-06 05:48:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:59,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:48:59,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:48:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:59,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:48:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:48:59,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137573217] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:48:59,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:48:59,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 05:48:59,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933156421] [2022-12-06 05:48:59,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:48:59,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:48:59,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:59,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:48:59,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:48:59,161 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 115 [2022-12-06 05:48:59,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 527 transitions, 9896 flow. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:48:59,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:59,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 115 [2022-12-06 05:48:59,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:04,222 INFO L130 PetriNetUnfolder]: 1217/2241 cut-off events. [2022-12-06 05:49:04,222 INFO L131 PetriNetUnfolder]: For 35513/35513 co-relation queries the response was YES. [2022-12-06 05:49:04,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19796 conditions, 2241 events. 1217/2241 cut-off events. For 35513/35513 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 14227 event pairs, 132 based on Foata normal form. 15/2253 useless extension candidates. Maximal degree in co-relation 19651. Up to 1098 conditions per place. [2022-12-06 05:49:04,241 INFO L137 encePairwiseOnDemand]: 21/115 looper letters, 315 selfloop transitions, 275 changer transitions 1/591 dead transitions. [2022-12-06 05:49:04,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 591 transitions, 12063 flow [2022-12-06 05:49:04,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:49:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:49:04,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2022-12-06 05:49:04,242 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13526570048309178 [2022-12-06 05:49:04,242 INFO L175 Difference]: Start difference. First operand has 172 places, 527 transitions, 9896 flow. Second operand 9 states and 140 transitions. [2022-12-06 05:49:04,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 591 transitions, 12063 flow [2022-12-06 05:49:04,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 591 transitions, 11983 flow, removed 40 selfloop flow, removed 4 redundant places. [2022-12-06 05:49:04,396 INFO L231 Difference]: Finished difference. Result has 177 places, 541 transitions, 10724 flow [2022-12-06 05:49:04,396 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=9826, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=265, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10724, PETRI_PLACES=177, PETRI_TRANSITIONS=541} [2022-12-06 05:49:04,396 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 156 predicate places. [2022-12-06 05:49:04,396 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:04,396 INFO L89 Accepts]: Start accepts. Operand has 177 places, 541 transitions, 10724 flow [2022-12-06 05:49:04,398 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:04,398 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:04,398 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 541 transitions, 10724 flow [2022-12-06 05:49:04,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 541 transitions, 10724 flow [2022-12-06 05:49:04,620 INFO L130 PetriNetUnfolder]: 724/1556 cut-off events. [2022-12-06 05:49:04,621 INFO L131 PetriNetUnfolder]: For 23964/24058 co-relation queries the response was YES. [2022-12-06 05:49:04,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13465 conditions, 1556 events. 724/1556 cut-off events. For 23964/24058 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 10964 event pairs, 61 based on Foata normal form. 3/1526 useless extension candidates. Maximal degree in co-relation 13146. Up to 727 conditions per place. [2022-12-06 05:49:04,636 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 541 transitions, 10724 flow [2022-12-06 05:49:04,636 INFO L188 LiptonReduction]: Number of co-enabled transitions 562 [2022-12-06 05:49:04,637 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:49:04,638 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 242 [2022-12-06 05:49:04,638 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 541 transitions, 10724 flow [2022-12-06 05:49:04,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:49:04,638 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:04,638 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:04,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 05:49:04,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:04,840 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:49:04,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:04,841 INFO L85 PathProgramCache]: Analyzing trace with hash -719858067, now seen corresponding path program 1 times [2022-12-06 05:49:04,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:04,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039658984] [2022-12-06 05:49:04,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:04,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:05,777 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-06 05:49:05,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:05,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039658984] [2022-12-06 05:49:05,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039658984] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:49:05,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018308323] [2022-12-06 05:49:05,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:05,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:05,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:49:05,780 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-06 05:49:05,781 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-06 05:49:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:05,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 05:49:05,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:49:06,136 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-06 05:49:06,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:49:10,809 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-06 05:49:10,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018308323] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:49:10,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:49:10,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 05:49:10,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640877537] [2022-12-06 05:49:10,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:49:10,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:49:10,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:10,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:49:10,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=90, Unknown=2, NotChecked=0, Total=132 [2022-12-06 05:49:10,811 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 115 [2022-12-06 05:49:10,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 541 transitions, 10724 flow. Second operand has 12 states, 12 states have (on average 1.9166666666666667) 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-06 05:49:10,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:10,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 115 [2022-12-06 05:49:10,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:18,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:49:20,739 INFO L130 PetriNetUnfolder]: 1275/2353 cut-off events. [2022-12-06 05:49:20,739 INFO L131 PetriNetUnfolder]: For 39390/39390 co-relation queries the response was YES. [2022-12-06 05:49:20,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21320 conditions, 2353 events. 1275/2353 cut-off events. For 39390/39390 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 15155 event pairs, 108 based on Foata normal form. 6/2356 useless extension candidates. Maximal degree in co-relation 20959. Up to 929 conditions per place. [2022-12-06 05:49:20,758 INFO L137 encePairwiseOnDemand]: 18/115 looper letters, 280 selfloop transitions, 351 changer transitions 1/632 dead transitions. [2022-12-06 05:49:20,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 632 transitions, 13369 flow [2022-12-06 05:49:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:49:20,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:49:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 153 transitions. [2022-12-06 05:49:20,760 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09503105590062112 [2022-12-06 05:49:20,760 INFO L175 Difference]: Start difference. First operand has 177 places, 541 transitions, 10724 flow. Second operand 14 states and 153 transitions. [2022-12-06 05:49:20,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 632 transitions, 13369 flow [2022-12-06 05:49:20,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 632 transitions, 13202 flow, removed 75 selfloop flow, removed 2 redundant places. [2022-12-06 05:49:20,963 INFO L231 Difference]: Finished difference. Result has 189 places, 567 transitions, 12038 flow [2022-12-06 05:49:20,964 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=10594, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=326, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=12038, PETRI_PLACES=189, PETRI_TRANSITIONS=567} [2022-12-06 05:49:20,964 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 168 predicate places. [2022-12-06 05:49:20,964 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:20,964 INFO L89 Accepts]: Start accepts. Operand has 189 places, 567 transitions, 12038 flow [2022-12-06 05:49:20,966 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:20,966 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:20,967 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 567 transitions, 12038 flow [2022-12-06 05:49:20,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 567 transitions, 12038 flow [2022-12-06 05:49:21,211 INFO L130 PetriNetUnfolder]: 750/1618 cut-off events. [2022-12-06 05:49:21,212 INFO L131 PetriNetUnfolder]: For 28393/28508 co-relation queries the response was YES. [2022-12-06 05:49:21,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14728 conditions, 1618 events. 750/1618 cut-off events. For 28393/28508 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 11514 event pairs, 62 based on Foata normal form. 3/1587 useless extension candidates. Maximal degree in co-relation 14405. Up to 774 conditions per place. [2022-12-06 05:49:21,228 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 567 transitions, 12038 flow [2022-12-06 05:49:21,228 INFO L188 LiptonReduction]: Number of co-enabled transitions 594 [2022-12-06 05:49:22,384 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:49:22,385 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1421 [2022-12-06 05:49:22,385 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 566 transitions, 12020 flow [2022-12-06 05:49:22,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) 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-06 05:49:22,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:22,385 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:22,390 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-06 05:49:22,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:22,587 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:49:22,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:22,588 INFO L85 PathProgramCache]: Analyzing trace with hash 976196335, now seen corresponding path program 1 times [2022-12-06 05:49:22,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:22,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993022737] [2022-12-06 05:49:22,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:22,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:22,713 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-06 05:49:22,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:22,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993022737] [2022-12-06 05:49:22,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993022737] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:49:22,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381706938] [2022-12-06 05:49:22,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:22,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:22,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:49:22,716 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-06 05:49:22,723 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-06 05:49:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:22,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 05:49:22,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:49:22,942 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-06 05:49:22,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:49:22,984 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-06 05:49:22,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381706938] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:49:22,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:49:22,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 05:49:22,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269507282] [2022-12-06 05:49:22,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:49:22,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:49:22,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:22,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:49:22,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:49:22,985 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 115 [2022-12-06 05:49:22,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 566 transitions, 12020 flow. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 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-06 05:49:22,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:22,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 115 [2022-12-06 05:49:22,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:24,419 INFO L130 PetriNetUnfolder]: 1301/2408 cut-off events. [2022-12-06 05:49:24,420 INFO L131 PetriNetUnfolder]: For 46151/46151 co-relation queries the response was YES. [2022-12-06 05:49:24,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22839 conditions, 2408 events. 1301/2408 cut-off events. For 46151/46151 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 15665 event pairs, 319 based on Foata normal form. 12/2417 useless extension candidates. Maximal degree in co-relation 22474. Up to 2208 conditions per place. [2022-12-06 05:49:24,438 INFO L137 encePairwiseOnDemand]: 98/115 looper letters, 536 selfloop transitions, 74 changer transitions 0/610 dead transitions. [2022-12-06 05:49:24,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 610 transitions, 14033 flow [2022-12-06 05:49:24,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:49:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:49:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 146 transitions. [2022-12-06 05:49:24,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12695652173913044 [2022-12-06 05:49:24,439 INFO L175 Difference]: Start difference. First operand has 188 places, 566 transitions, 12020 flow. Second operand 10 states and 146 transitions. [2022-12-06 05:49:24,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 610 transitions, 14033 flow [2022-12-06 05:49:24,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 610 transitions, 13735 flow, removed 72 selfloop flow, removed 3 redundant places. [2022-12-06 05:49:24,633 INFO L231 Difference]: Finished difference. Result has 199 places, 582 transitions, 12395 flow [2022-12-06 05:49:24,633 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=11735, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12395, PETRI_PLACES=199, PETRI_TRANSITIONS=582} [2022-12-06 05:49:24,634 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 178 predicate places. [2022-12-06 05:49:24,634 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:24,634 INFO L89 Accepts]: Start accepts. Operand has 199 places, 582 transitions, 12395 flow [2022-12-06 05:49:24,636 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:24,636 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:24,637 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 582 transitions, 12395 flow [2022-12-06 05:49:24,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 582 transitions, 12395 flow [2022-12-06 05:49:24,899 INFO L130 PetriNetUnfolder]: 774/1671 cut-off events. [2022-12-06 05:49:24,900 INFO L131 PetriNetUnfolder]: For 31091/31203 co-relation queries the response was YES. [2022-12-06 05:49:24,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15444 conditions, 1671 events. 774/1671 cut-off events. For 31091/31203 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 12027 event pairs, 64 based on Foata normal form. 4/1637 useless extension candidates. Maximal degree in co-relation 15117. Up to 805 conditions per place. [2022-12-06 05:49:24,917 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 582 transitions, 12395 flow [2022-12-06 05:49:24,917 INFO L188 LiptonReduction]: Number of co-enabled transitions 602 [2022-12-06 05:49:24,919 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:49:24,919 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 285 [2022-12-06 05:49:24,919 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 582 transitions, 12395 flow [2022-12-06 05:49:24,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 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-06 05:49:24,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:24,920 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:24,925 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-06 05:49:25,120 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,SelfDestructingSolverStorable24 [2022-12-06 05:49:25,120 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:49:25,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:25,121 INFO L85 PathProgramCache]: Analyzing trace with hash -223779831, now seen corresponding path program 1 times [2022-12-06 05:49:25,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:25,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000276931] [2022-12-06 05:49:25,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:25,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:25,225 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-06 05:49:25,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:25,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000276931] [2022-12-06 05:49:25,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000276931] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:49:25,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190918590] [2022-12-06 05:49:25,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:25,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:25,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:49:25,228 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-06 05:49:25,254 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-06 05:49:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:25,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 05:49:25,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:49:25,390 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-06 05:49:25,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:49:25,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-06 05:49:25,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190918590] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:49:25,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:49:25,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-06 05:49:25,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395704473] [2022-12-06 05:49:25,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:49:25,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:49:25,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:25,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:49:25,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:49:25,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 115 [2022-12-06 05:49:25,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 582 transitions, 12395 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-06 05:49:25,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:25,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 115 [2022-12-06 05:49:25,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:27,844 INFO L130 PetriNetUnfolder]: 1409/2610 cut-off events. [2022-12-06 05:49:27,844 INFO L131 PetriNetUnfolder]: For 54236/54236 co-relation queries the response was YES. [2022-12-06 05:49:27,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25200 conditions, 2610 events. 1409/2610 cut-off events. For 54236/54236 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 17255 event pairs, 271 based on Foata normal form. 18/2624 useless extension candidates. Maximal degree in co-relation 24831. Up to 1759 conditions per place. [2022-12-06 05:49:27,868 INFO L137 encePairwiseOnDemand]: 29/115 looper letters, 365 selfloop transitions, 328 changer transitions 1/694 dead transitions. [2022-12-06 05:49:27,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 694 transitions, 15594 flow [2022-12-06 05:49:27,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-06 05:49:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-06 05:49:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 181 transitions. [2022-12-06 05:49:27,870 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.08743961352657005 [2022-12-06 05:49:27,870 INFO L175 Difference]: Start difference. First operand has 199 places, 582 transitions, 12395 flow. Second operand 18 states and 181 transitions. [2022-12-06 05:49:27,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 694 transitions, 15594 flow [2022-12-06 05:49:28,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 694 transitions, 15309 flow, removed 73 selfloop flow, removed 2 redundant places. [2022-12-06 05:49:28,099 INFO L231 Difference]: Finished difference. Result has 223 places, 631 transitions, 14231 flow [2022-12-06 05:49:28,099 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=12112, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=287, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=14231, PETRI_PLACES=223, PETRI_TRANSITIONS=631} [2022-12-06 05:49:28,100 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 202 predicate places. [2022-12-06 05:49:28,100 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:28,100 INFO L89 Accepts]: Start accepts. Operand has 223 places, 631 transitions, 14231 flow [2022-12-06 05:49:28,102 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:28,102 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:28,102 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 631 transitions, 14231 flow [2022-12-06 05:49:28,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 631 transitions, 14231 flow [2022-12-06 05:49:28,392 INFO L130 PetriNetUnfolder]: 822/1783 cut-off events. [2022-12-06 05:49:28,392 INFO L131 PetriNetUnfolder]: For 39650/39764 co-relation queries the response was YES. [2022-12-06 05:49:28,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18099 conditions, 1783 events. 822/1783 cut-off events. For 39650/39764 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 13104 event pairs, 64 based on Foata normal form. 1/1743 useless extension candidates. Maximal degree in co-relation 17762. Up to 893 conditions per place. [2022-12-06 05:49:28,414 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 631 transitions, 14231 flow [2022-12-06 05:49:28,414 INFO L188 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-06 05:49:28,416 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [940] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_431| v_~f~0.base_351))) (let ((.cse12 (select .cse2 (+ v_~f~0.offset_351 (* v_~x2~0_421 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_351 (* 4 .cse12))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_351 (* .cse0 4))))) (let ((.cse9 (select .cse2 (+ v_~f~0.offset_351 (* .cse1 4))))) (let ((.cse11 (select .cse2 (+ v_~f~0.offset_351 (* .cse9 4))))) (let ((.cse10 (select .cse2 (+ v_~f~0.offset_351 (* .cse11 4)))) (.cse6 (select .cse2 (+ v_~f~0.offset_351 (* v_~x1~0_605 4))))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_351 (* .cse6 4)))) (.cse8 (select .cse2 (+ v_~f~0.offset_351 (* .cse10 4))))) (let ((.cse5 (select .cse2 (+ v_~f~0.offset_351 (* .cse8 4)))) (.cse13 (select .cse2 (+ v_~f~0.offset_351 (* .cse4 4))))) (let ((.cse7 (select .cse2 (+ v_~f~0.offset_351 (* 4 .cse13)))) (.cse3 (select .cse2 (+ v_~f~0.offset_351 (* 4 .cse5))))) (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_314| 0)) (not (= (ite (and (< .cse0 v_~size~0_367) (<= 0 .cse0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_534| 5) (not (= (ite (and (< .cse1 v_~size~0_367) (<= 0 .cse1)) 1 0) 0)) (= (select .cse2 (+ v_~f~0.offset_351 (* .cse3 4))) v_~x2~0_419) (< (mod (+ 4294967291 |v_thread2Thread1of1ForFork1_~i~1#1_485|) 4294967296) (mod (* 5 v_~n~0_334) 4294967296)) (not (= (ite (and (< .cse4 v_~size~0_367) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_367)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_367) (<= 0 .cse6)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_276| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_314|) (= v_~x1~0_604 (select .cse2 (+ v_~f~0.offset_351 (* .cse7 4)))) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_367)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_367) (<= 0 .cse9)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_485| 10) (= |v_ULTIMATE.start_main_#t~mem20#1_96| (select (select |v_#memory_int_431| |v_ULTIMATE.start_main_~#t1~0#1.base_95|) |v_ULTIMATE.start_main_~#t1~0#1.offset_95|)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_332| (ite (and (< .cse7 v_~size~0_367) (<= 0 .cse7)) 1 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_367)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_346| 0)) (not (= (ite (and (< .cse11 v_~size~0_367) (<= 0 .cse11)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_276| (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_367)) 1 0)) (not (= (ite (and (<= 0 v_~x1~0_605) (< v_~x1~0_605 v_~size~0_367)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_367)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_367) (<= 0 .cse13)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_332| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_346|) (not (= (ite (and (< v_~x2~0_421 v_~size~0_367) (<= 0 v_~x2~0_421)) 1 0) 0))))))))))))) InVars {~x2~0=v_~x2~0_421, ~size~0=v_~size~0_367, ~f~0.base=v_~f~0.base_351, #memory_int=|v_#memory_int_431|, ~n~0=v_~n~0_334, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_95|, ~x1~0=v_~x1~0_605, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_95|, ~f~0.offset=v_~f~0.offset_351} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_99|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_340|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_168|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_172|, ~f~0.base=v_~f~0.base_351, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_170|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_276|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_485|, ~x1~0=v_~x1~0_604, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_95|, ~f~0.offset=v_~f~0.offset_351, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_168|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_346|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_180|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_174|, ~x2~0=v_~x2~0_419, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_166|, ~size~0=v_~size~0_367, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_182|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_95|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_314|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_96|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_332|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_188|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_534|, #memory_int=|v_#memory_int_431|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_170|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_78|, ~n~0=v_~n~0_334, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_352|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem20#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, ULTIMATE.start_main_#t~nondet19#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:49:31,704 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:49:31,705 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3605 [2022-12-06 05:49:31,705 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 631 transitions, 14273 flow [2022-12-06 05:49:31,705 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-06 05:49:31,705 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:31,705 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:31,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 05:49:31,907 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,SelfDestructingSolverStorable25 [2022-12-06 05:49:31,907 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:49:31,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:31,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1952390589, now seen corresponding path program 1 times [2022-12-06 05:49:31,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:31,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915706573] [2022-12-06 05:49:31,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:31,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:32,008 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-06 05:49:32,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:32,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915706573] [2022-12-06 05:49:32,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915706573] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:49:32,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815801708] [2022-12-06 05:49:32,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:32,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:32,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:49:32,012 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-06 05:49:32,038 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-06 05:49:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:32,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:49:32,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:49:32,160 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-06 05:49:32,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:49:32,216 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-06 05:49:32,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815801708] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:49:32,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:49:32,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 05:49:32,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686451360] [2022-12-06 05:49:32,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:49:32,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:49:32,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:32,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:49:32,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:49:32,217 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 117 [2022-12-06 05:49:32,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 631 transitions, 14273 flow. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:49:32,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:32,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 117 [2022-12-06 05:49:32,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:34,863 INFO L130 PetriNetUnfolder]: 1439/2671 cut-off events. [2022-12-06 05:49:34,864 INFO L131 PetriNetUnfolder]: For 64920/64920 co-relation queries the response was YES. [2022-12-06 05:49:34,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27966 conditions, 2671 events. 1439/2671 cut-off events. For 64920/64920 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 17696 event pairs, 327 based on Foata normal form. 12/2679 useless extension candidates. Maximal degree in co-relation 27577. Up to 2298 conditions per place. [2022-12-06 05:49:34,887 INFO L137 encePairwiseOnDemand]: 35/117 looper letters, 419 selfloop transitions, 272 changer transitions 0/691 dead transitions. [2022-12-06 05:49:34,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 691 transitions, 16553 flow [2022-12-06 05:49:34,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:49:34,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:49:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2022-12-06 05:49:34,889 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1168091168091168 [2022-12-06 05:49:34,889 INFO L175 Difference]: Start difference. First operand has 223 places, 631 transitions, 14273 flow. Second operand 12 states and 164 transitions. [2022-12-06 05:49:34,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 691 transitions, 16553 flow [2022-12-06 05:49:35,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 691 transitions, 16127 flow, removed 194 selfloop flow, removed 1 redundant places. [2022-12-06 05:49:35,189 INFO L231 Difference]: Finished difference. Result has 239 places, 653 transitions, 15103 flow [2022-12-06 05:49:35,189 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=13863, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=251, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=15103, PETRI_PLACES=239, PETRI_TRANSITIONS=653} [2022-12-06 05:49:35,189 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 218 predicate places. [2022-12-06 05:49:35,190 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:35,190 INFO L89 Accepts]: Start accepts. Operand has 239 places, 653 transitions, 15103 flow [2022-12-06 05:49:35,193 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:35,193 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:35,193 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 239 places, 653 transitions, 15103 flow [2022-12-06 05:49:35,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 653 transitions, 15103 flow [2022-12-06 05:49:35,569 INFO L130 PetriNetUnfolder]: 978/2118 cut-off events. [2022-12-06 05:49:35,569 INFO L131 PetriNetUnfolder]: For 53008/53079 co-relation queries the response was YES. [2022-12-06 05:49:35,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22253 conditions, 2118 events. 978/2118 cut-off events. For 53008/53079 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 15928 event pairs, 77 based on Foata normal form. 0/2106 useless extension candidates. Maximal degree in co-relation 21896. Up to 1040 conditions per place. [2022-12-06 05:49:35,597 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 239 places, 653 transitions, 15103 flow [2022-12-06 05:49:35,597 INFO L188 LiptonReduction]: Number of co-enabled transitions 692 [2022-12-06 05:49:35,598 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:49:35,599 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 409 [2022-12-06 05:49:35,599 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 653 transitions, 15103 flow [2022-12-06 05:49:35,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:49:35,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:35,599 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:35,604 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-06 05:49:35,800 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,SelfDestructingSolverStorable26 [2022-12-06 05:49:35,800 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:49:35,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:35,800 INFO L85 PathProgramCache]: Analyzing trace with hash 24262587, now seen corresponding path program 1 times [2022-12-06 05:49:35,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:35,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193945474] [2022-12-06 05:49:35,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:35,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:36,178 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-06 05:49:36,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:36,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193945474] [2022-12-06 05:49:36,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193945474] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:49:36,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482829510] [2022-12-06 05:49:36,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:36,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:49:36,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:49:36,184 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-06 05:49:36,187 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-06 05:49:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:36,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-06 05:49:36,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:49:36,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:49:36,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 05:49:36,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:49:36,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:49:36,922 INFO L321 Elim1Store]: treesize reduction 315, result has 12.7 percent of original size [2022-12-06 05:49:36,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 19 new quantified variables, introduced 45 case distinctions, treesize of input 237 treesize of output 115 [2022-12-06 05:49:36,975 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-06 05:49:36,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:49:37,952 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-06 05:49:37,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482829510] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:49:37,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:49:37,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-12-06 05:49:37,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034207642] [2022-12-06 05:49:37,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:49:37,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:49:37,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:37,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:49:37,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=221, Unknown=4, NotChecked=0, Total=272 [2022-12-06 05:49:37,954 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 117 [2022-12-06 05:49:37,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 653 transitions, 15103 flow. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 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-06 05:49:37,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:37,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 117 [2022-12-06 05:49:37,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:56,802 WARN L233 SmtUtils]: Spent 16.59s on a formula simplification that was a NOOP. DAG size: 216 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:50:08,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:50:11,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:50:14,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:50:21,271 INFO L130 PetriNetUnfolder]: 1679/3168 cut-off events. [2022-12-06 05:50:21,272 INFO L131 PetriNetUnfolder]: For 90389/90389 co-relation queries the response was YES. [2022-12-06 05:50:21,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35348 conditions, 3168 events. 1679/3168 cut-off events. For 90389/90389 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 22231 event pairs, 149 based on Foata normal form. 13/3177 useless extension candidates. Maximal degree in co-relation 34908. Up to 2447 conditions per place. [2022-12-06 05:50:21,319 INFO L137 encePairwiseOnDemand]: 40/117 looper letters, 502 selfloop transitions, 361 changer transitions 7/870 dead transitions. [2022-12-06 05:50:21,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 870 transitions, 21260 flow [2022-12-06 05:50:21,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 05:50:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 05:50:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 231 transitions. [2022-12-06 05:50:21,343 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.07593688362919132 [2022-12-06 05:50:21,344 INFO L175 Difference]: Start difference. First operand has 239 places, 653 transitions, 15103 flow. Second operand 26 states and 231 transitions. [2022-12-06 05:50:21,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 870 transitions, 21260 flow [2022-12-06 05:50:21,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 870 transitions, 21094 flow, removed 64 selfloop flow, removed 1 redundant places. [2022-12-06 05:50:22,004 INFO L231 Difference]: Finished difference. Result has 273 places, 791 transitions, 19586 flow [2022-12-06 05:50:22,004 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=14941, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=19586, PETRI_PLACES=273, PETRI_TRANSITIONS=791} [2022-12-06 05:50:22,010 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 252 predicate places. [2022-12-06 05:50:22,010 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:50:22,010 INFO L89 Accepts]: Start accepts. Operand has 273 places, 791 transitions, 19586 flow [2022-12-06 05:50:22,016 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:50:22,016 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:50:22,016 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 273 places, 791 transitions, 19586 flow [2022-12-06 05:50:22,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 273 places, 791 transitions, 19586 flow [2022-12-06 05:50:22,714 INFO L130 PetriNetUnfolder]: 1138/2494 cut-off events. [2022-12-06 05:50:22,715 INFO L131 PetriNetUnfolder]: For 75643/75740 co-relation queries the response was YES. [2022-12-06 05:50:22,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28211 conditions, 2494 events. 1138/2494 cut-off events. For 75643/75740 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 19684 event pairs, 84 based on Foata normal form. 0/2473 useless extension candidates. Maximal degree in co-relation 27726. Up to 1266 conditions per place. [2022-12-06 05:50:22,749 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 273 places, 791 transitions, 19586 flow [2022-12-06 05:50:22,750 INFO L188 LiptonReduction]: Number of co-enabled transitions 782 [2022-12-06 05:50:24,404 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [942] $Ultimate##0-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_433| v_~f~0.base_353))) (let ((.cse6 (select .cse0 (+ v_~f~0.offset_353 (* v_~x1~0_610 4))))) (let ((.cse7 (select .cse0 (+ v_~f~0.offset_353 (* .cse6 4)))) (.cse5 (select .cse0 (+ v_~f~0.offset_353 (* v_~x2~0_426 4))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_353 (* .cse5 4)))) (.cse9 (select .cse0 (+ v_~f~0.offset_353 (* .cse7 4))))) (let ((.cse8 (select .cse0 (+ v_~f~0.offset_353 (* .cse9 4)))) (.cse3 (select .cse0 (+ (* .cse4 4) v_~f~0.offset_353)))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_353 (* 4 .cse3)))) (.cse1 (select .cse0 (+ v_~f~0.offset_353 (* .cse8 4))))) (and (= (select .cse0 (+ v_~f~0.offset_353 (* .cse1 4))) v_~x1~0_608) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_489|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_280| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_318|) (= v_~x2~0_425 (select .cse0 (+ v_~f~0.offset_353 (* .cse2 4)))) (not (= (ite (and (< .cse3 v_~size~0_369) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_369)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_610 v_~size~0_369) (<= 0 v_~x1~0_610)) 1 0) 0)) (not (= (ite (and (< .cse5 v_~size~0_369) (<= 0 .cse5)) 1 0) 0)) (= (ite (and (< .cse2 v_~size~0_369) (<= 0 .cse2)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_280|) (= (ite (and (< .cse1 v_~size~0_369) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_334|) (not (= (ite (and (< .cse6 v_~size~0_369) (<= 0 .cse6)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_318| 0)) (not (= (ite (and (< .cse7 v_~size~0_369) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_369)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_536| 6) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_348| 0)) (= |v_ULTIMATE.start_main_#t~mem20#1_98| (select (select |v_#memory_int_433| |v_ULTIMATE.start_main_~#t1~0#1.base_97|) |v_ULTIMATE.start_main_~#t1~0#1.offset_97|)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_369)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_426 v_~size~0_369) (<= 0 v_~x2~0_426)) 1 0) 0)) (< 5 (mod (* 5 v_~n~0_336) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_334| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_348|)))))))) InVars {~x2~0=v_~x2~0_426, ~size~0=v_~size~0_369, ~f~0.base=v_~f~0.base_353, #memory_int=|v_#memory_int_433|, ~n~0=v_~n~0_336, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_97|, ~x1~0=v_~x1~0_610, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_97|, ~f~0.offset=v_~f~0.offset_353} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_101|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_342|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_172|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_176|, ~f~0.base=v_~f~0.base_353, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_174|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_280|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_489|, ~x1~0=v_~x1~0_608, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_97|, ~f~0.offset=v_~f~0.offset_353, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_172|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_348|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_184|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_178|, ~x2~0=v_~x2~0_425, ~size~0=v_~size~0_369, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_170|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_186|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_97|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_318|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_98|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_334|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_192|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_536|, #memory_int=|v_#memory_int_433|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_174|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_80|, ~n~0=v_~n~0_336, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_354|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem20#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, ULTIMATE.start_main_#t~nondet19#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:50:25,755 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [807] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_221| v_~f~0.base_149))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_149 (* v_~x1~0_150 4))))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_121| 2) (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_165)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|) (< 1 (mod (* 5 v_~n~0_132) 4294967296)) (= (select .cse1 (+ v_~f~0.offset_149 (* .cse0 4))) v_~x1~0_148) (= |v_thread2Thread1of1ForFork1_~i~1#1_222| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_81| 0)) (not (= (ite (and (<= 0 v_~x1~0_150) (< v_~x1~0_150 v_~size~0_165)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_81| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|)))) InVars {~size~0=v_~size~0_165, ~f~0.base=v_~f~0.base_149, #memory_int=|v_#memory_int_221|, ~n~0=v_~n~0_132, ~x1~0=v_~x1~0_150, ~f~0.offset=v_~f~0.offset_149} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_75|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_67|, ~size~0=v_~size~0_165, ~f~0.base=v_~f~0.base_149, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_121|, #memory_int=|v_#memory_int_221|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_81|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_222|, ~n~0=v_~n~0_132, ~x1~0=v_~x1~0_148, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_87|, ~f~0.offset=v_~f~0.offset_149} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:50:26,296 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:50:26,558 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:50:26,845 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:50:27,145 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:50:27,440 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:50:27,441 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5431 [2022-12-06 05:50:27,441 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 791 transitions, 19762 flow [2022-12-06 05:50:27,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 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-06 05:50:27,441 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:50:27,442 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:50:27,452 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-06 05:50:27,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:50:27,649 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:50:27,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:50:27,650 INFO L85 PathProgramCache]: Analyzing trace with hash 265971924, now seen corresponding path program 1 times [2022-12-06 05:50:27,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:50:27,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221492260] [2022-12-06 05:50:27,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:27,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:50:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:27,777 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-06 05:50:27,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:50:27,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221492260] [2022-12-06 05:50:27,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221492260] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:50:27,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010817823] [2022-12-06 05:50:27,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:27,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:50:27,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:50:27,779 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-06 05:50:27,809 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-06 05:50:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:27,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:50:27,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:50:28,039 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-06 05:50:28,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:50:28,115 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-06 05:50:28,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010817823] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:50:28,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:50:28,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 05:50:28,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093141409] [2022-12-06 05:50:28,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:50:28,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:50:28,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:50:28,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:50:28,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:50:28,117 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 125 [2022-12-06 05:50:28,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 791 transitions, 19762 flow. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:50:28,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:50:28,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 125 [2022-12-06 05:50:28,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:50:31,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:50:34,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:50:36,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:50:38,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:50:40,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:50:43,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:50:47,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:50:48,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:50:50,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:50:52,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:50:54,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:50:56,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:50:57,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:51:00,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:51:01,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:51:07,750 INFO L130 PetriNetUnfolder]: 1853/3556 cut-off events. [2022-12-06 05:51:07,751 INFO L131 PetriNetUnfolder]: For 125317/125317 co-relation queries the response was YES. [2022-12-06 05:51:07,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42018 conditions, 3556 events. 1853/3556 cut-off events. For 125317/125317 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 26151 event pairs, 369 based on Foata normal form. 35/3587 useless extension candidates. Maximal degree in co-relation 41408. Up to 2362 conditions per place. [2022-12-06 05:51:07,787 INFO L137 encePairwiseOnDemand]: 24/125 looper letters, 458 selfloop transitions, 618 changer transitions 1/1077 dead transitions. [2022-12-06 05:51:07,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 1077 transitions, 28622 flow [2022-12-06 05:51:07,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-06 05:51:07,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-12-06 05:51:07,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 242 transitions. [2022-12-06 05:51:07,789 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.0624516129032258 [2022-12-06 05:51:07,789 INFO L175 Difference]: Start difference. First operand has 273 places, 791 transitions, 19762 flow. Second operand 31 states and 242 transitions. [2022-12-06 05:51:07,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 1077 transitions, 28622 flow [2022-12-06 05:51:08,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 1077 transitions, 26863 flow, removed 769 selfloop flow, removed 9 redundant places. [2022-12-06 05:51:08,468 INFO L231 Difference]: Finished difference. Result has 320 places, 999 transitions, 26119 flow [2022-12-06 05:51:08,469 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=18615, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=791, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=436, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=26119, PETRI_PLACES=320, PETRI_TRANSITIONS=999} [2022-12-06 05:51:08,470 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 299 predicate places. [2022-12-06 05:51:08,470 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:51:08,470 INFO L89 Accepts]: Start accepts. Operand has 320 places, 999 transitions, 26119 flow [2022-12-06 05:51:08,477 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:51:08,478 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:51:08,478 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 320 places, 999 transitions, 26119 flow [2022-12-06 05:51:08,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 320 places, 999 transitions, 26119 flow [2022-12-06 05:51:09,294 INFO L130 PetriNetUnfolder]: 1199/2685 cut-off events. [2022-12-06 05:51:09,294 INFO L131 PetriNetUnfolder]: For 156059/156261 co-relation queries the response was YES. [2022-12-06 05:51:09,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35889 conditions, 2685 events. 1199/2685 cut-off events. For 156059/156261 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 21776 event pairs, 119 based on Foata normal form. 2/2615 useless extension candidates. Maximal degree in co-relation 35555. Up to 1268 conditions per place. [2022-12-06 05:51:09,341 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 320 places, 999 transitions, 26119 flow [2022-12-06 05:51:09,341 INFO L188 LiptonReduction]: Number of co-enabled transitions 864 [2022-12-06 05:51:09,346 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:09,442 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:09,534 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:09,628 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:09,721 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:09,828 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:09,922 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:10,031 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:10,133 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:10,227 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:10,322 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:10,416 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:10,509 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:11,158 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [793] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_193| v_~f~0.base_127))) (let ((.cse0 (mod (* 5 v_~n~0_112) 4294967296)) (.cse1 (select .cse2 (+ v_~f~0.offset_127 (* v_~x1~0_116 4))))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_97| 1) 4294967296) .cse0) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_97| 4294967296) .cse0) (= (ite (and (< .cse1 v_~size~0_145) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (not (= (ite (and (< v_~x1~0_116 v_~size~0_145) (<= 0 v_~x1~0_116)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_63| 0)) (= v_~x1~0_114 (select .cse2 (+ v_~f~0.offset_127 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_95| (+ |v_thread1Thread1of1ForFork0_~i~0#1_97| 2)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_63| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)))) InVars {~size~0=v_~size~0_145, ~f~0.base=v_~f~0.base_127, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_97|, #memory_int=|v_#memory_int_193|, ~n~0=v_~n~0_112, ~x1~0=v_~x1~0_116, ~f~0.offset=v_~f~0.offset_127} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, ~size~0=v_~size~0_145, ~f~0.base=v_~f~0.base_127, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_95|, #memory_int=|v_#memory_int_193|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_63|, ~n~0=v_~n~0_112, ~x1~0=v_~x1~0_114, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_69|, ~f~0.offset=v_~f~0.offset_127} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [817] L59-2-->L59-2: Formula: (let ((.cse6 (select |v_#memory_int_233| v_~f~0.base_161))) (let ((.cse5 (select .cse6 (+ v_~f~0.offset_161 (* v_~x2~0_262 4))))) (let ((.cse4 (select .cse6 (+ v_~f~0.offset_161 (* .cse5 4))))) (let ((.cse3 (select .cse6 (+ (* .cse4 4) v_~f~0.offset_161)))) (let ((.cse10 (select .cse6 (+ v_~f~0.offset_161 (* .cse3 4))))) (let ((.cse1 (select .cse6 (+ v_~f~0.offset_161 (* .cse10 4))))) (let ((.cse9 (select .cse6 (+ v_~f~0.offset_161 (* .cse1 4))))) (let ((.cse8 (select .cse6 (+ v_~f~0.offset_161 (* .cse9 4))))) (let ((.cse0 (select .cse6 (+ v_~f~0.offset_161 (* .cse8 4))))) (let ((.cse2 (mod (* 5 v_~n~0_144) 4294967296)) (.cse7 (select .cse6 (+ v_~f~0.offset_161 (* .cse0 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_177)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_177) (<= 0 .cse1)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_238| 4294967296) .cse2) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_238| 10) |v_thread2Thread1of1ForFork1_~i~1#1_236|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_211| 0)) (not (= (ite (and (< .cse3 v_~size~0_177) (<= 0 .cse3)) 1 0) 0)) (not (= 0 (ite (and (< .cse4 v_~size~0_177) (<= 0 .cse4)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_173| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_211|) (not (= 0 (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_177)) 1 0))) (= (select .cse6 (+ v_~f~0.offset_161 (* .cse7 4))) v_~x2~0_260) (< (mod (+ 4294967291 |v_thread2Thread1of1ForFork1_~i~1#1_236|) 4294967296) .cse2) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_177)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_177)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_177) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_262) (< v_~x2~0_262 v_~size~0_177)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_173| (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_177)) 1 0))))))))))))) InVars {~x2~0=v_~x2~0_262, ~size~0=v_~size~0_177, ~f~0.base=v_~f~0.base_161, #memory_int=|v_#memory_int_233|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_238|, ~n~0=v_~n~0_144, ~f~0.offset=v_~f~0.offset_161} OutVars{~x2~0=v_~x2~0_260, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_65|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_69|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_63|, ~size~0=v_~size~0_177, ~f~0.base=v_~f~0.base_161, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_79|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_67|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_173|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_236|, ~f~0.offset=v_~f~0.offset_161, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_211|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_65|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_85|, #memory_int=|v_#memory_int_233|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_67|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_77|, ~n~0=v_~n~0_144, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_71|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:51:15,131 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [793] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_193| v_~f~0.base_127))) (let ((.cse0 (mod (* 5 v_~n~0_112) 4294967296)) (.cse1 (select .cse2 (+ v_~f~0.offset_127 (* v_~x1~0_116 4))))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_97| 1) 4294967296) .cse0) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_97| 4294967296) .cse0) (= (ite (and (< .cse1 v_~size~0_145) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (not (= (ite (and (< v_~x1~0_116 v_~size~0_145) (<= 0 v_~x1~0_116)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_63| 0)) (= v_~x1~0_114 (select .cse2 (+ v_~f~0.offset_127 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_95| (+ |v_thread1Thread1of1ForFork0_~i~0#1_97| 2)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_63| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|)))) InVars {~size~0=v_~size~0_145, ~f~0.base=v_~f~0.base_127, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_97|, #memory_int=|v_#memory_int_193|, ~n~0=v_~n~0_112, ~x1~0=v_~x1~0_116, ~f~0.offset=v_~f~0.offset_127} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, ~size~0=v_~size~0_145, ~f~0.base=v_~f~0.base_127, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_95|, #memory_int=|v_#memory_int_193|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_63|, ~n~0=v_~n~0_112, ~x1~0=v_~x1~0_114, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_69|, ~f~0.offset=v_~f~0.offset_127} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:51:15,490 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [764] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 5 v_~n~0_In_9) 4294967296))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:51:15,723 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [764] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 5 v_~n~0_In_9) 4294967296))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:51:15,961 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [764] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 5 v_~n~0_In_9) 4294967296))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] [2022-12-06 05:51:16,025 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [764] L49-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_4| 4294967296) (mod (* 5 v_~n~0_In_9) 4294967296))) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_4|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:51:16,235 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 05:51:16,236 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7766 [2022-12-06 05:51:16,236 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 995 transitions, 26549 flow [2022-12-06 05:51:16,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:51:16,237 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:51:16,237 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:51:16,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-06 05:51:16,443 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,SelfDestructingSolverStorable28 [2022-12-06 05:51:16,443 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:51:16,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:51:16,444 INFO L85 PathProgramCache]: Analyzing trace with hash 506257611, now seen corresponding path program 1 times [2022-12-06 05:51:16,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:51:16,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620400419] [2022-12-06 05:51:16,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:51:16,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:51:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:51:16,983 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-06 05:51:16,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:51:16,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620400419] [2022-12-06 05:51:16,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620400419] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:51:16,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546614596] [2022-12-06 05:51:16,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:51:16,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:51:16,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:51:16,988 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-06 05:51:17,015 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-06 05:51:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:51:17,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 05:51:17,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:51:17,694 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-06 05:51:17,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:51:18,076 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-06 05:51:18,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546614596] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:51:18,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:51:18,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-12-06 05:51:18,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256888708] [2022-12-06 05:51:18,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:51:18,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 05:51:18,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:51:18,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 05:51:18,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2022-12-06 05:51:18,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 145 [2022-12-06 05:51:18,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 995 transitions, 26549 flow. Second operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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-06 05:51:18,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:51:18,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 145 [2022-12-06 05:51:18,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:51:34,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:51:45,874 INFO L130 PetriNetUnfolder]: 1934/3767 cut-off events. [2022-12-06 05:51:45,874 INFO L131 PetriNetUnfolder]: For 222003/222003 co-relation queries the response was YES. [2022-12-06 05:51:45,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49982 conditions, 3767 events. 1934/3767 cut-off events. For 222003/222003 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 28430 event pairs, 161 based on Foata normal form. 36/3799 useless extension candidates. Maximal degree in co-relation 49624. Up to 1633 conditions per place. [2022-12-06 05:51:45,914 INFO L137 encePairwiseOnDemand]: 12/145 looper letters, 404 selfloop transitions, 798 changer transitions 1/1203 dead transitions. [2022-12-06 05:51:45,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 1203 transitions, 33392 flow [2022-12-06 05:51:45,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 05:51:45,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 05:51:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 238 transitions. [2022-12-06 05:51:45,917 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.05862068965517241 [2022-12-06 05:51:45,917 INFO L175 Difference]: Start difference. First operand has 316 places, 995 transitions, 26549 flow. Second operand 28 states and 238 transitions. [2022-12-06 05:51:45,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 1203 transitions, 33392 flow [2022-12-06 05:51:47,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 1203 transitions, 31054 flow, removed 1169 selfloop flow, removed 4 redundant places. [2022-12-06 05:51:47,044 INFO L231 Difference]: Finished difference. Result has 345 places, 1098 transitions, 29233 flow [2022-12-06 05:51:47,046 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=24288, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=990, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=702, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=29233, PETRI_PLACES=345, PETRI_TRANSITIONS=1098} [2022-12-06 05:51:47,047 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 324 predicate places. [2022-12-06 05:51:47,047 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:51:47,047 INFO L89 Accepts]: Start accepts. Operand has 345 places, 1098 transitions, 29233 flow [2022-12-06 05:51:47,051 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:51:47,051 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:51:47,051 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 345 places, 1098 transitions, 29233 flow [2022-12-06 05:51:47,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 345 places, 1098 transitions, 29233 flow [2022-12-06 05:51:48,111 INFO L130 PetriNetUnfolder]: 1399/3117 cut-off events. [2022-12-06 05:51:48,111 INFO L131 PetriNetUnfolder]: For 182008/182054 co-relation queries the response was YES. [2022-12-06 05:51:48,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41391 conditions, 3117 events. 1399/3117 cut-off events. For 182008/182054 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 26210 event pairs, 131 based on Foata normal form. 2/3100 useless extension candidates. Maximal degree in co-relation 40785. Up to 1437 conditions per place. [2022-12-06 05:51:48,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 345 places, 1098 transitions, 29233 flow [2022-12-06 05:51:48,160 INFO L188 LiptonReduction]: Number of co-enabled transitions 904 [2022-12-06 05:51:48,432 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:48,526 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:48,619 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:48,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:48,811 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:48,905 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:48,998 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:49,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:49,189 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:49,284 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:49,374 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:49,468 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:49,559 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:49,647 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:49,742 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:49,829 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:49,920 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:50,011 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:50,110 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:50,629 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:51:50,917 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [856] $Ultimate##0-->L59-2: Formula: (let ((.cse8 (select |v_#memory_int_283| v_~f~0.base_209))) (let ((.cse4 (select .cse8 (+ v_~f~0.offset_209 (* v_~x2~0_357 4))))) (let ((.cse11 (select .cse8 (+ v_~f~0.offset_209 (* .cse4 4))))) (let ((.cse2 (select .cse8 (+ v_~f~0.offset_209 (* .cse11 4))))) (let ((.cse3 (select .cse8 (+ v_~f~0.offset_209 (* .cse2 4))))) (let ((.cse5 (select .cse8 (+ v_~f~0.offset_209 (* .cse3 4))))) (let ((.cse7 (select .cse8 (+ v_~f~0.offset_209 (* .cse5 4))))) (let ((.cse10 (select .cse8 (+ v_~f~0.offset_209 (* .cse7 4))))) (let ((.cse1 (select .cse8 (+ v_~f~0.offset_209 (* v_~x1~0_281 4)))) (.cse9 (select .cse8 (+ v_~f~0.offset_209 (* 4 .cse10))))) (let ((.cse0 (select .cse8 (+ v_~f~0.offset_209 (* .cse9 4)))) (.cse6 (select .cse8 (+ v_~f~0.offset_209 (* .cse1 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_225)) 1 0)) (not (= (ite (and (< .cse1 v_~size~0_225) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_225) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_225) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_225)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_225)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_149| (ite (and (< .cse6 v_~size~0_225) (<= 0 .cse6)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_149| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_163|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_163| 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_225)) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~mem20#1_70| (select (select |v_#memory_int_283| |v_ULTIMATE.start_main_~#t1~0#1.base_83|) |v_ULTIMATE.start_main_~#t1~0#1.offset_83|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_269|) (= (select .cse8 (+ v_~f~0.offset_209 (* .cse0 4))) v_~x2~0_355) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_225)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_225)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_281 v_~size~0_225) (<= 0 v_~x1~0_281)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_225)) 1 0) 0)) (= (select .cse8 (+ (* .cse6 4) v_~f~0.offset_209)) v_~x1~0_280) (< (mod (+ 4294967291 |v_thread2Thread1of1ForFork1_~i~1#1_328|) 4294967296) (mod (* 5 v_~n~0_192) 4294967296)) (= |v_thread1Thread1of1ForFork0_~i~0#1_219| 3) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_269| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_328| 10) (not (= (ite (and (<= 0 v_~x2~0_357) (< v_~x2~0_357 v_~size~0_225)) 1 0) 0))))))))))))) InVars {~x2~0=v_~x2~0_357, ~size~0=v_~size~0_225, ~f~0.base=v_~f~0.base_209, #memory_int=|v_#memory_int_283|, ~n~0=v_~n~0_192, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_83|, ~x1~0=v_~x1~0_281, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_83|, ~f~0.offset=v_~f~0.offset_209} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_76|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_157|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_123|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_127|, ~f~0.base=v_~f~0.base_209, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_125|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_328|, ~x1~0=v_~x1~0_280, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_83|, ~f~0.offset=v_~f~0.offset_209, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_123|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_163|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_135|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_129|, ~x2~0=v_~x2~0_355, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_121|, ~size~0=v_~size~0_225, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_137|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_83|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_269|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_70|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_149|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_143|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_219|, #memory_int=|v_#memory_int_283|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_125|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_59|, ~n~0=v_~n~0_192, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_169|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem20#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, ULTIMATE.start_main_#t~nondet19#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:51:53,427 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:51:53,428 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6381 [2022-12-06 05:51:53,428 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 1095 transitions, 29479 flow [2022-12-06 05:51:53,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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-06 05:51:53,428 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:51:53,429 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:51:53,434 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-06 05:51:53,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:51:53,631 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:51:53,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:51:53,632 INFO L85 PathProgramCache]: Analyzing trace with hash 788944212, now seen corresponding path program 1 times [2022-12-06 05:51:53,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:51:53,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436168044] [2022-12-06 05:51:53,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:51:53,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:51:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:51:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:51:53,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:51:53,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436168044] [2022-12-06 05:51:53,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436168044] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:51:53,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467434865] [2022-12-06 05:51:53,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:51:53,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:51:53,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:51:53,987 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-06 05:51:53,988 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-06 05:51:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:51:54,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 05:51:54,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:51:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:51:54,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:51:54,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:51:54,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467434865] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:51:54,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:51:54,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2022-12-06 05:51:54,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100430352] [2022-12-06 05:51:54,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:51:54,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:51:54,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:51:54,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:51:54,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:51:54,624 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 165 [2022-12-06 05:51:54,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 1095 transitions, 29479 flow. Second operand has 11 states, 11 states have (on average 2.3636363636363638) 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-06 05:51:54,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:51:54,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 165 [2022-12-06 05:51:54,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:52:09,057 INFO L130 PetriNetUnfolder]: 2090/4038 cut-off events. [2022-12-06 05:52:09,058 INFO L131 PetriNetUnfolder]: For 259813/259813 co-relation queries the response was YES. [2022-12-06 05:52:09,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53923 conditions, 4038 events. 2090/4038 cut-off events. For 259813/259813 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 30735 event pairs, 135 based on Foata normal form. 108/4142 useless extension candidates. Maximal degree in co-relation 53391. Up to 1979 conditions per place. [2022-12-06 05:52:09,106 INFO L137 encePairwiseOnDemand]: 13/165 looper letters, 424 selfloop transitions, 872 changer transitions 2/1298 dead transitions. [2022-12-06 05:52:09,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 1298 transitions, 36723 flow [2022-12-06 05:52:09,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:52:09,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:52:09,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 244 transitions. [2022-12-06 05:52:09,108 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09242424242424242 [2022-12-06 05:52:09,108 INFO L175 Difference]: Start difference. First operand has 342 places, 1095 transitions, 29479 flow. Second operand 16 states and 244 transitions. [2022-12-06 05:52:09,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 1298 transitions, 36723 flow [2022-12-06 05:52:10,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 1298 transitions, 35657 flow, removed 398 selfloop flow, removed 12 redundant places. [2022-12-06 05:52:10,206 INFO L231 Difference]: Finished difference. Result has 357 places, 1219 transitions, 35050 flow [2022-12-06 05:52:10,207 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=165, PETRI_DIFFERENCE_MINUEND_FLOW=28437, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1093, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=754, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=35050, PETRI_PLACES=357, PETRI_TRANSITIONS=1219} [2022-12-06 05:52:10,207 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 336 predicate places. [2022-12-06 05:52:10,207 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:52:10,208 INFO L89 Accepts]: Start accepts. Operand has 357 places, 1219 transitions, 35050 flow [2022-12-06 05:52:10,212 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:52:10,212 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:52:10,213 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 357 places, 1219 transitions, 35050 flow [2022-12-06 05:52:10,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 356 places, 1219 transitions, 35050 flow [2022-12-06 05:52:11,277 INFO L130 PetriNetUnfolder]: 1527/3367 cut-off events. [2022-12-06 05:52:11,278 INFO L131 PetriNetUnfolder]: For 198147/198195 co-relation queries the response was YES. [2022-12-06 05:52:11,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47123 conditions, 3367 events. 1527/3367 cut-off events. For 198147/198195 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 28232 event pairs, 124 based on Foata normal form. 3/3351 useless extension candidates. Maximal degree in co-relation 46648. Up to 1589 conditions per place. [2022-12-06 05:52:11,353 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 356 places, 1219 transitions, 35050 flow [2022-12-06 05:52:11,353 INFO L188 LiptonReduction]: Number of co-enabled transitions 1004 [2022-12-06 05:52:11,365 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:52:11,947 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [975] $Ultimate##0-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_474| v_~f~0.base_389))) (let ((.cse9 (select .cse2 (+ v_~f~0.offset_389 (* v_~x1~0_728 4))))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_389 (* .cse9 4))))) (let ((.cse10 (select .cse2 (+ v_~f~0.offset_389 (* .cse4 4)))) (.cse1 (select .cse2 (+ v_~f~0.offset_389 (* v_~x2~0_501 4))))) (let ((.cse8 (select .cse2 (+ v_~f~0.offset_389 (* .cse1 4)))) (.cse0 (select .cse2 (+ v_~f~0.offset_389 (* 4 .cse10))))) (let ((.cse7 (select .cse2 (+ v_~f~0.offset_389 (* .cse0 4)))) (.cse6 (select .cse2 (+ v_~f~0.offset_389 (* 4 .cse8))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_389 (* .cse6 4)))) (.cse5 (select .cse2 (+ v_~f~0.offset_389 (* .cse7 4))))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_645| 4294967295) 4294967296) (mod (* 5 v_~n~0_372) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_405)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_405) (<= 0 .cse1)) 1 0) 0)) (= v_~x2~0_500 (select .cse2 (+ v_~f~0.offset_389 (* 4 .cse3)))) (not (= (ite (and (< .cse4 v_~size~0_405) (<= 0 .cse4)) 1 0) 0)) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_645|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_430| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_416| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_430|) (= v_~x1~0_726 (select .cse2 (+ v_~f~0.offset_389 (* .cse5 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_365| 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_405)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_501) (< v_~x2~0_501 v_~size~0_405)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_728 v_~size~0_405) (<= 0 v_~x1~0_728)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_327| (ite (and (< .cse3 v_~size~0_405) (<= 0 .cse3)) 1 0)) (not (= (ite (and (< .cse7 v_~size~0_405) (<= 0 .cse7)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_327| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_365|) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_405)) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~mem20#1_130| (select (select |v_#memory_int_474| |v_ULTIMATE.start_main_~#t1~0#1.base_117|) |v_ULTIMATE.start_main_~#t1~0#1.offset_117|)) (= (ite (and (< .cse5 v_~size~0_405) (<= 0 .cse5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_416|) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_546|) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_405)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_405) (<= 0 .cse10)) 1 0) 0)))))))))) InVars {~x2~0=v_~x2~0_501, ~size~0=v_~size~0_405, ~f~0.base=v_~f~0.base_389, #memory_int=|v_#memory_int_474|, ~n~0=v_~n~0_372, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_117|, ~x1~0=v_~x1~0_728, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_117|, ~f~0.offset=v_~f~0.offset_389} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_130|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_424|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_219|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_223|, ~f~0.base=v_~f~0.base_389, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_221|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_327|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_546|, ~x1~0=v_~x1~0_726, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_117|, ~f~0.offset=v_~f~0.offset_389, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_219|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_430|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_231|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_225|, ~x2~0=v_~x2~0_500, ~size~0=v_~size~0_405, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_217|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_233|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_117|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_365|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_130|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_416|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_239|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_645|, #memory_int=|v_#memory_int_474|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_221|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_106|, ~n~0=v_~n~0_372, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_436|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem20#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, ULTIMATE.start_main_#t~nondet19#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] [2022-12-06 05:52:12,853 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [975] $Ultimate##0-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_474| v_~f~0.base_389))) (let ((.cse9 (select .cse2 (+ v_~f~0.offset_389 (* v_~x1~0_728 4))))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_389 (* .cse9 4))))) (let ((.cse10 (select .cse2 (+ v_~f~0.offset_389 (* .cse4 4)))) (.cse1 (select .cse2 (+ v_~f~0.offset_389 (* v_~x2~0_501 4))))) (let ((.cse8 (select .cse2 (+ v_~f~0.offset_389 (* .cse1 4)))) (.cse0 (select .cse2 (+ v_~f~0.offset_389 (* 4 .cse10))))) (let ((.cse7 (select .cse2 (+ v_~f~0.offset_389 (* .cse0 4)))) (.cse6 (select .cse2 (+ v_~f~0.offset_389 (* 4 .cse8))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_389 (* .cse6 4)))) (.cse5 (select .cse2 (+ v_~f~0.offset_389 (* .cse7 4))))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_645| 4294967295) 4294967296) (mod (* 5 v_~n~0_372) 4294967296)) (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_405)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_405) (<= 0 .cse1)) 1 0) 0)) (= v_~x2~0_500 (select .cse2 (+ v_~f~0.offset_389 (* 4 .cse3)))) (not (= (ite (and (< .cse4 v_~size~0_405) (<= 0 .cse4)) 1 0) 0)) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_645|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_430| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_416| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_430|) (= v_~x1~0_726 (select .cse2 (+ v_~f~0.offset_389 (* .cse5 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_365| 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_405)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_501) (< v_~x2~0_501 v_~size~0_405)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_728 v_~size~0_405) (<= 0 v_~x1~0_728)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_327| (ite (and (< .cse3 v_~size~0_405) (<= 0 .cse3)) 1 0)) (not (= (ite (and (< .cse7 v_~size~0_405) (<= 0 .cse7)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_327| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_365|) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_405)) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~mem20#1_130| (select (select |v_#memory_int_474| |v_ULTIMATE.start_main_~#t1~0#1.base_117|) |v_ULTIMATE.start_main_~#t1~0#1.offset_117|)) (= (ite (and (< .cse5 v_~size~0_405) (<= 0 .cse5)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_416|) (= 5 |v_thread2Thread1of1ForFork1_~i~1#1_546|) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_405)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_405) (<= 0 .cse10)) 1 0) 0)))))))))) InVars {~x2~0=v_~x2~0_501, ~size~0=v_~size~0_405, ~f~0.base=v_~f~0.base_389, #memory_int=|v_#memory_int_474|, ~n~0=v_~n~0_372, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_117|, ~x1~0=v_~x1~0_728, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_117|, ~f~0.offset=v_~f~0.offset_389} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_130|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_424|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_219|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_223|, ~f~0.base=v_~f~0.base_389, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_221|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_327|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_546|, ~x1~0=v_~x1~0_726, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_117|, ~f~0.offset=v_~f~0.offset_389, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_219|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_430|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_231|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_225|, ~x2~0=v_~x2~0_500, ~size~0=v_~size~0_405, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_217|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_233|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_117|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_365|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_130|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_416|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_239|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_645|, #memory_int=|v_#memory_int_474|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_221|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_106|, ~n~0=v_~n~0_372, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_436|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem20#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, ULTIMATE.start_main_#t~nondet19#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:52:14,066 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:52:14,067 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3860 [2022-12-06 05:52:14,067 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 1219 transitions, 35142 flow [2022-12-06 05:52:14,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) 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-06 05:52:14,067 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:52:14,067 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:52:14,073 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-06 05:52:14,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:52:14,271 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:52:14,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:52:14,272 INFO L85 PathProgramCache]: Analyzing trace with hash 710133, now seen corresponding path program 1 times [2022-12-06 05:52:14,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:52:14,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094319852] [2022-12-06 05:52:14,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:52:14,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:52:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:52:14,392 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-06 05:52:14,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:52:14,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094319852] [2022-12-06 05:52:14,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094319852] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:52:14,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304825994] [2022-12-06 05:52:14,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:52:14,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:52:14,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:52:14,394 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-06 05:52:14,425 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-06 05:52:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:52:14,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:52:14,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:52:14,547 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-06 05:52:14,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:52:14,589 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-06 05:52:14,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304825994] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:52:14,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:52:14,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 05:52:14,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364493916] [2022-12-06 05:52:14,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:52:14,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:52:14,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:52:14,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:52:14,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:52:14,591 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 170 [2022-12-06 05:52:14,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 1219 transitions, 35142 flow. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:52:14,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:52:14,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 170 [2022-12-06 05:52:14,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:52:16,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:52:19,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:52:22,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:52:25,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:52:27,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:52:30,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:52:33,924 INFO L130 PetriNetUnfolder]: 2151/4146 cut-off events. [2022-12-06 05:52:33,924 INFO L131 PetriNetUnfolder]: For 232643/232643 co-relation queries the response was YES. [2022-12-06 05:52:33,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57974 conditions, 4146 events. 2151/4146 cut-off events. For 232643/232643 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 31742 event pairs, 465 based on Foata normal form. 11/4153 useless extension candidates. Maximal degree in co-relation 57431. Up to 3494 conditions per place. [2022-12-06 05:52:33,976 INFO L137 encePairwiseOnDemand]: 31/170 looper letters, 832 selfloop transitions, 481 changer transitions 3/1316 dead transitions. [2022-12-06 05:52:33,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 1316 transitions, 39705 flow [2022-12-06 05:52:33,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:52:33,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:52:33,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 239 transitions. [2022-12-06 05:52:33,978 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1004201680672269 [2022-12-06 05:52:33,978 INFO L175 Difference]: Start difference. First operand has 356 places, 1219 transitions, 35142 flow. Second operand 14 states and 239 transitions. [2022-12-06 05:52:33,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 1316 transitions, 39705 flow [2022-12-06 05:52:35,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 1316 transitions, 38772 flow, removed 453 selfloop flow, removed 3 redundant places. [2022-12-06 05:52:35,364 INFO L231 Difference]: Finished difference. Result has 374 places, 1253 transitions, 36693 flow [2022-12-06 05:52:35,365 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=34297, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=444, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=750, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=36693, PETRI_PLACES=374, PETRI_TRANSITIONS=1253} [2022-12-06 05:52:35,365 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 353 predicate places. [2022-12-06 05:52:35,365 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:52:35,365 INFO L89 Accepts]: Start accepts. Operand has 374 places, 1253 transitions, 36693 flow [2022-12-06 05:52:35,369 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:52:35,369 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:52:35,369 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 374 places, 1253 transitions, 36693 flow [2022-12-06 05:52:35,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 372 places, 1253 transitions, 36693 flow [2022-12-06 05:52:36,482 INFO L130 PetriNetUnfolder]: 1380/3084 cut-off events. [2022-12-06 05:52:36,482 INFO L131 PetriNetUnfolder]: For 167146/167257 co-relation queries the response was YES. [2022-12-06 05:52:36,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43244 conditions, 3084 events. 1380/3084 cut-off events. For 167146/167257 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 25976 event pairs, 123 based on Foata normal form. 3/3035 useless extension candidates. Maximal degree in co-relation 42881. Up to 1465 conditions per place. [2022-12-06 05:52:36,536 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 372 places, 1253 transitions, 36693 flow [2022-12-06 05:52:36,536 INFO L188 LiptonReduction]: Number of co-enabled transitions 1054 [2022-12-06 05:52:36,670 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1044] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_594| v_~f~0.base_507))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_507 (* v_~x2~0_595 4))))) (let ((.cse10 (select .cse2 (+ v_~f~0.offset_507 (* .cse4 4))))) (let ((.cse7 (select .cse2 (+ (* .cse10 4) v_~f~0.offset_507)))) (let ((.cse9 (select .cse2 (+ v_~f~0.offset_507 (* 4 .cse7)))) (.cse0 (select .cse2 (+ v_~f~0.offset_507 (* v_~x1~0_977 4))))) (let ((.cse6 (select .cse2 (+ v_~f~0.offset_507 (* 4 .cse0)))) (.cse12 (select .cse2 (+ v_~f~0.offset_507 (* .cse9 4))))) (let ((.cse11 (select .cse2 (+ v_~f~0.offset_507 (* .cse12 4)))) (.cse13 (select .cse2 (+ v_~f~0.offset_507 (* .cse6 4))))) (let ((.cse14 (select .cse2 (+ v_~f~0.offset_507 (* .cse13 4)))) (.cse1 (select .cse2 (+ v_~f~0.offset_507 (* .cse11 4))))) (let ((.cse5 (select .cse2 (+ v_~f~0.offset_507 (* .cse1 4)))) (.cse15 (select .cse2 (+ v_~f~0.offset_507 (* 4 .cse14))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_507 (* .cse15 4)))) (.cse8 (select .cse2 (+ v_~f~0.offset_507 (* .cse5 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_523)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_523) (<= 0 .cse1)) 1 0) 0)) (= v_~x1~0_976 (select .cse2 (+ v_~f~0.offset_507 (* .cse3 4)))) (= (select (select |v_#memory_int_594| |v_ULTIMATE.start_main_~#t1~0#1.base_129|) |v_ULTIMATE.start_main_~#t1~0#1.offset_129|) |v_ULTIMATE.start_main_#t~mem20#1_148|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_523)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_523)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_595 v_~size~0_523) (<= 0 v_~x2~0_595)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_523)) 1 0) 0)) (not (= (ite (and (< .cse7 v_~size~0_523) (<= 0 .cse7)) 1 0) 0)) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_523)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_558|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_380| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_418|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_572| 0)) (= v_~x2~0_593 (select .cse2 (+ v_~f~0.offset_507 (* .cse8 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_896| 4294967295) 4294967296) (mod (* 5 v_~n~0_492) 4294967296)) (= |v_thread2Thread1of1ForFork1_~i~1#1_699| 10) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_380| (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_523)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_418| 0)) (not (= (ite (and (< .cse9 v_~size~0_523) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_523) (<= 0 .cse10)) 1 0) 0)) (= 7 |v_thread1Thread1of1ForFork0_~i~0#1_896|) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_523)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_523) (<= 0 .cse12)) 1 0) 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_523)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_523)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_558| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_572|) (not (= (ite (and (< v_~x1~0_977 v_~size~0_523) (<= 0 v_~x1~0_977)) 1 0) 0)) (not (= (ite (and (< .cse15 v_~size~0_523) (<= 0 .cse15)) 1 0) 0))))))))))))) InVars {~x2~0=v_~x2~0_595, ~size~0=v_~size~0_523, ~f~0.base=v_~f~0.base_507, #memory_int=|v_#memory_int_594|, ~n~0=v_~n~0_492, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_129|, ~x1~0=v_~x1~0_977, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_129|, ~f~0.offset=v_~f~0.offset_507} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_147|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_566|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_272|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_276|, ~f~0.base=v_~f~0.base_507, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_274|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_380|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_699|, ~x1~0=v_~x1~0_976, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_129|, ~f~0.offset=v_~f~0.offset_507, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_272|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_572|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_284|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_278|, ~x2~0=v_~x2~0_593, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_270|, ~size~0=v_~size~0_523, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_286|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_129|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_418|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_148|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_558|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_292|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_896|, #memory_int=|v_#memory_int_594|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_274|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_121|, ~n~0=v_~n~0_492, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_578|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem20#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, ULTIMATE.start_main_#t~nondet19#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:52:38,240 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1035] L49-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_579| v_~f~0.base_493))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_493 (* v_~x2~0_562 4))))) (let ((.cse5 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_493)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_493 (* 4 .cse5))))) (let ((.cse4 (mod (* 5 v_~n~0_478) 4294967296)) (.cse0 (select .cse3 (+ v_~f~0.offset_493 (* .cse2 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_539| (ite (and (< v_~x1~0_947 v_~size~0_509) (<= 0 v_~x1~0_947)) 1 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_539| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_553|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_361| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_509)) 1 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_873| 1) |v_thread1Thread1of1ForFork0_~i~0#1_872|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_553| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_399| 0)) (not (= (ite (and (< .cse1 v_~size~0_509) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_562) (< v_~x2~0_562 v_~size~0_509)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_509) (<= 0 .cse2)) 1 0) 0)) (= v_~x1~0_946 (select .cse3 (+ v_~f~0.offset_493 (* v_~x1~0_947 4)))) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_675| 4294967296) .cse4) (= |v_thread2Thread1of1ForFork1_~i~1#1_674| (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_675|)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_509)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_361| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_399|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_873| 4294967296) .cse4) (= v_~x2~0_561 (select .cse3 (+ v_~f~0.offset_493 (* .cse0 4)))))))))) InVars {~x2~0=v_~x2~0_562, ~size~0=v_~size~0_509, ~f~0.base=v_~f~0.base_493, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_873|, #memory_int=|v_#memory_int_579|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_675|, ~n~0=v_~n~0_478, ~x1~0=v_~x1~0_947, ~f~0.offset=v_~f~0.offset_493} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_547|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_253|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_257|, ~f~0.base=v_~f~0.base_493, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_255|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_361|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_674|, ~x1~0=v_~x1~0_946, ~f~0.offset=v_~f~0.offset_493, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_253|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_553|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_265|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_259|, ~x2~0=v_~x2~0_561, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_251|, ~size~0=v_~size~0_509, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_267|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_399|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_539|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_273|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_872|, #memory_int=|v_#memory_int_579|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_255|, ~n~0=v_~n~0_478, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_559|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:52:39,264 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1003] L49-2-->L59-2: Formula: (let ((.cse4 (select |v_#memory_int_522| v_~f~0.base_437))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_437 (* v_~x1~0_835 4)))) (.cse1 (select .cse4 (+ v_~f~0.offset_437 (* v_~x2~0_541 4))))) (let ((.cse7 (select .cse4 (+ v_~f~0.offset_437 (* 4 .cse1)))) (.cse6 (select .cse4 (+ v_~f~0.offset_437 (* .cse3 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_437 (* .cse6 4)))) (.cse8 (select .cse4 (+ v_~f~0.offset_437 (* 4 .cse7))))) (let ((.cse9 (select .cse4 (+ v_~f~0.offset_437 (* .cse8 4)))) (.cse2 (mod (* 5 v_~n~0_420) 4294967296)) (.cse5 (select .cse4 (+ v_~f~0.offset_437 (* 4 .cse0))))) (and (not (= (ite (and (< .cse0 v_~size~0_453) (<= 0 .cse0)) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_748| 5) |v_thread1Thread1of1ForFork0_~i~0#1_746|) (not (= (ite (and (< .cse1 v_~size~0_453) (<= 0 .cse1)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_748| 1) 4294967296) .cse2) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_453)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_349| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_387|) (not (= (ite (and (<= 0 v_~x2~0_541) (< v_~x2~0_541 v_~size~0_453)) 1 0) 0)) (= v_~x1~0_833 (select .cse4 (+ v_~f~0.offset_437 (* .cse5 4)))) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_746| 4294967295) 4294967296) .cse2) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_453)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_475| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_489|) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_453)) 1 0) 0)) (not (= 0 (ite (and (<= 0 v_~x1~0_835) (< v_~x1~0_835 v_~size~0_453)) 1 0))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_387| 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_453)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_349| (ite (and (< .cse9 v_~size~0_453) (<= 0 .cse9)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_489| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_746| 4294967294) 4294967296) .cse2) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_746| 4294967293) 4294967296) .cse2) (= v_~x2~0_540 (select .cse4 (+ v_~f~0.offset_437 (* 4 .cse9)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_748| 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_~i~1#1_610| (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_611|)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_611| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_475| (ite (and (< .cse5 v_~size~0_453) (<= 0 .cse5)) 1 0)))))))) InVars {~x2~0=v_~x2~0_541, ~size~0=v_~size~0_453, ~f~0.base=v_~f~0.base_437, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_748|, #memory_int=|v_#memory_int_522|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_611|, ~n~0=v_~n~0_420, ~x1~0=v_~x1~0_835, ~f~0.offset=v_~f~0.offset_437} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_483|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_241|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_245|, ~f~0.base=v_~f~0.base_437, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_243|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_349|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_610|, ~x1~0=v_~x1~0_833, ~f~0.offset=v_~f~0.offset_437, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_241|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_489|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_253|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_247|, ~x2~0=v_~x2~0_540, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_239|, ~size~0=v_~size~0_453, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_255|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_387|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_475|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_261|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_746|, #memory_int=|v_#memory_int_522|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_243|, ~n~0=v_~n~0_420, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_495|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:52:50,560 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:52:50,561 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15196 [2022-12-06 05:52:50,561 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 1252 transitions, 36809 flow [2022-12-06 05:52:50,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:52:50,562 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:52:50,562 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:52:50,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-06 05:52:50,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:52:50,767 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:52:50,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:52:50,767 INFO L85 PathProgramCache]: Analyzing trace with hash 619167771, now seen corresponding path program 2 times [2022-12-06 05:52:50,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:52:50,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644163875] [2022-12-06 05:52:50,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:52:50,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:52:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:52:50,864 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-06 05:52:50,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:52:50,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644163875] [2022-12-06 05:52:50,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644163875] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:52:50,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158050965] [2022-12-06 05:52:50,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:52:50,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:52:50,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:52:50,868 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-06 05:52:50,899 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-06 05:52:51,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:52:51,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:52:51,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:52:51,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:52:51,046 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-06 05:52:51,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:52:51,123 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-06 05:52:51,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158050965] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:52:51,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:52:51,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 05:52:51,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260911585] [2022-12-06 05:52:51,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:52:51,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:52:51,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:52:51,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:52:51,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:52:51,125 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 174 [2022-12-06 05:52:51,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 1252 transitions, 36809 flow. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:52:51,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:52:51,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 174 [2022-12-06 05:52:51,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:52:54,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:52:56,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:52:58,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:01,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:03,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:05,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:08,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:10,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:12,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:14,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:16,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:18,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:20,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:21,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:24,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:26,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:27,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:29,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:31,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:33,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:35,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:38,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:40,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:42,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:44,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:46,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:49,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:51,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:53:53,539 INFO L130 PetriNetUnfolder]: 2143/4168 cut-off events. [2022-12-06 05:53:53,540 INFO L131 PetriNetUnfolder]: For 216031/216031 co-relation queries the response was YES. [2022-12-06 05:53:53,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57510 conditions, 4168 events. 2143/4168 cut-off events. For 216031/216031 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 32243 event pairs, 158 based on Foata normal form. 6/4170 useless extension candidates. Maximal degree in co-relation 57069. Up to 1783 conditions per place. [2022-12-06 05:53:53,589 INFO L137 encePairwiseOnDemand]: 26/174 looper letters, 875 selfloop transitions, 602 changer transitions 12/1489 dead transitions. [2022-12-06 05:53:53,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 1489 transitions, 45116 flow [2022-12-06 05:53:53,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:53:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:53:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 237 transitions. [2022-12-06 05:53:53,591 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09729064039408868 [2022-12-06 05:53:53,591 INFO L175 Difference]: Start difference. First operand has 371 places, 1252 transitions, 36809 flow. Second operand 14 states and 237 transitions. [2022-12-06 05:53:53,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 1489 transitions, 45116 flow [2022-12-06 05:53:54,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 1489 transitions, 44636 flow, removed 194 selfloop flow, removed 6 redundant places. [2022-12-06 05:53:54,968 INFO L231 Difference]: Finished difference. Result has 380 places, 1272 transitions, 38425 flow [2022-12-06 05:53:54,969 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=36312, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=582, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=38425, PETRI_PLACES=380, PETRI_TRANSITIONS=1272} [2022-12-06 05:53:54,969 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 359 predicate places. [2022-12-06 05:53:54,970 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:53:54,970 INFO L89 Accepts]: Start accepts. Operand has 380 places, 1272 transitions, 38425 flow [2022-12-06 05:53:54,975 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:53:54,975 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:53:54,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 380 places, 1272 transitions, 38425 flow [2022-12-06 05:53:54,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 377 places, 1272 transitions, 38425 flow [2022-12-06 05:53:55,885 INFO L130 PetriNetUnfolder]: 1379/3110 cut-off events. [2022-12-06 05:53:55,886 INFO L131 PetriNetUnfolder]: For 177161/177275 co-relation queries the response was YES. [2022-12-06 05:53:55,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44956 conditions, 3110 events. 1379/3110 cut-off events. For 177161/177275 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 26393 event pairs, 124 based on Foata normal form. 3/3059 useless extension candidates. Maximal degree in co-relation 44682. Up to 1462 conditions per place. [2022-12-06 05:53:55,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 377 places, 1272 transitions, 38425 flow [2022-12-06 05:53:55,943 INFO L188 LiptonReduction]: Number of co-enabled transitions 1040 [2022-12-06 05:53:57,200 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:53:57,200 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2230 [2022-12-06 05:53:57,200 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 1272 transitions, 38452 flow [2022-12-06 05:53:57,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:53:57,201 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:53:57,201 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:53:57,206 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-06 05:53:57,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:53:57,406 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:53:57,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:53:57,407 INFO L85 PathProgramCache]: Analyzing trace with hash -38794199, now seen corresponding path program 1 times [2022-12-06 05:53:57,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:53:57,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332586043] [2022-12-06 05:53:57,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:53:57,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:53:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:53:57,514 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-06 05:53:57,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:53:57,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332586043] [2022-12-06 05:53:57,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332586043] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:53:57,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298099479] [2022-12-06 05:53:57,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:53:57,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:53:57,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:53:57,520 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-06 05:53:57,523 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-06 05:53:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:53:57,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:53:57,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:53:57,671 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-06 05:53:57,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:53:57,719 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-06 05:53:57,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298099479] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:53:57,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:53:57,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-06 05:53:57,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272258612] [2022-12-06 05:53:57,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:53:57,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:53:57,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:53:57,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:53:57,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:53:57,721 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 174 [2022-12-06 05:53:57,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 1272 transitions, 38452 flow. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:53:57,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:53:57,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 174 [2022-12-06 05:53:57,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:54:00,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:03,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:05,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:07,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:09,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:11,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:13,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:16,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:18,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:20,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:22,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:25,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:27,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:29,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:31,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:34,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:37,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:38,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:40,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:42,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:54:46,769 INFO L130 PetriNetUnfolder]: 2131/4152 cut-off events. [2022-12-06 05:54:46,769 INFO L131 PetriNetUnfolder]: For 228149/228149 co-relation queries the response was YES. [2022-12-06 05:54:46,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58676 conditions, 4152 events. 2131/4152 cut-off events. For 228149/228149 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 32225 event pairs, 149 based on Foata normal form. 4/4152 useless extension candidates. Maximal degree in co-relation 58456. Up to 2168 conditions per place. [2022-12-06 05:54:46,819 INFO L137 encePairwiseOnDemand]: 28/174 looper letters, 1138 selfloop transitions, 303 changer transitions 11/1452 dead transitions. [2022-12-06 05:54:46,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 1452 transitions, 45333 flow [2022-12-06 05:54:46,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:54:46,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:54:46,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 213 transitions. [2022-12-06 05:54:46,820 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11128526645768025 [2022-12-06 05:54:46,820 INFO L175 Difference]: Start difference. First operand has 377 places, 1272 transitions, 38452 flow. Second operand 11 states and 213 transitions. [2022-12-06 05:54:46,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 1452 transitions, 45333 flow [2022-12-06 05:54:48,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 1452 transitions, 44958 flow, removed 184 selfloop flow, removed 3 redundant places. [2022-12-06 05:54:48,435 INFO L231 Difference]: Finished difference. Result has 386 places, 1271 transitions, 38655 flow [2022-12-06 05:54:48,436 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=38079, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=303, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=969, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=38655, PETRI_PLACES=386, PETRI_TRANSITIONS=1271} [2022-12-06 05:54:48,436 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 365 predicate places. [2022-12-06 05:54:48,436 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:54:48,436 INFO L89 Accepts]: Start accepts. Operand has 386 places, 1271 transitions, 38655 flow [2022-12-06 05:54:48,442 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:54:48,442 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:54:48,442 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 386 places, 1271 transitions, 38655 flow [2022-12-06 05:54:48,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 384 places, 1271 transitions, 38655 flow [2022-12-06 05:54:49,376 INFO L130 PetriNetUnfolder]: 1380/3115 cut-off events. [2022-12-06 05:54:49,376 INFO L131 PetriNetUnfolder]: For 183605/183709 co-relation queries the response was YES. [2022-12-06 05:54:49,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45367 conditions, 3115 events. 1380/3115 cut-off events. For 183605/183709 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 26466 event pairs, 119 based on Foata normal form. 3/3067 useless extension candidates. Maximal degree in co-relation 45211. Up to 1461 conditions per place. [2022-12-06 05:54:49,426 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 384 places, 1271 transitions, 38655 flow [2022-12-06 05:54:49,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 1040 [2022-12-06 05:54:49,429 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:54:49,430 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 994 [2022-12-06 05:54:49,430 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 1271 transitions, 38655 flow [2022-12-06 05:54:49,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:54:49,430 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:54:49,430 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:54:49,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-06 05:54:49,636 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,SelfDestructingSolverStorable33 [2022-12-06 05:54:49,636 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:54:49,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:54:49,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1299434837, now seen corresponding path program 1 times [2022-12-06 05:54:49,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:54:49,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570967399] [2022-12-06 05:54:49,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:54:49,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:54:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:54:54,626 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-06 05:54:54,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:54:54,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570967399] [2022-12-06 05:54:54,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570967399] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:54:54,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520396724] [2022-12-06 05:54:54,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:54:54,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:54:54,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:54:54,628 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-06 05:54:54,630 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-06 05:54:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:54:54,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-06 05:54:54,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:54:54,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:54:54,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 05:54:54,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:54:54,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:54:55,447 INFO L321 Elim1Store]: treesize reduction 328, result has 9.1 percent of original size [2022-12-06 05:54:55,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 19 new quantified variables, introduced 45 case distinctions, treesize of input 237 treesize of output 102 [2022-12-06 05:54:55,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:54:55,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:54:57,183 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-06 05:54:57,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520396724] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:54:57,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:54:57,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 16 [2022-12-06 05:54:57,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382228289] [2022-12-06 05:54:57,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:54:57,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 05:54:57,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:54:57,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 05:54:57,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=233, Unknown=2, NotChecked=0, Total=306 [2022-12-06 05:54:57,184 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 173 [2022-12-06 05:54:57,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 1271 transitions, 38655 flow. Second operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:54:57,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:54:57,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 173 [2022-12-06 05:54:57,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:55:24,557 WARN L233 SmtUtils]: Spent 27.11s on a formula simplification that was a NOOP. DAG size: 239 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:55:40,373 INFO L130 PetriNetUnfolder]: 3220/6373 cut-off events. [2022-12-06 05:55:40,373 INFO L131 PetriNetUnfolder]: For 365641/365641 co-relation queries the response was YES. [2022-12-06 05:55:40,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92805 conditions, 6373 events. 3220/6373 cut-off events. For 365641/365641 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 53631 event pairs, 209 based on Foata normal form. 17/6386 useless extension candidates. Maximal degree in co-relation 92624. Up to 3047 conditions per place. [2022-12-06 05:55:40,455 INFO L137 encePairwiseOnDemand]: 35/173 looper letters, 707 selfloop transitions, 1354 changer transitions 5/2066 dead transitions. [2022-12-06 05:55:40,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 2066 transitions, 65678 flow [2022-12-06 05:55:40,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 05:55:40,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 05:55:40,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 322 transitions. [2022-12-06 05:55:40,457 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12408477842003854 [2022-12-06 05:55:40,457 INFO L175 Difference]: Start difference. First operand has 384 places, 1271 transitions, 38655 flow. Second operand 15 states and 322 transitions. [2022-12-06 05:55:40,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 2066 transitions, 65678 flow [2022-12-06 05:55:42,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 2066 transitions, 65167 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-06 05:55:42,907 INFO L231 Difference]: Finished difference. Result has 399 places, 1933 transitions, 63273 flow [2022-12-06 05:55:42,907 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=38258, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=830, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=63273, PETRI_PLACES=399, PETRI_TRANSITIONS=1933} [2022-12-06 05:55:42,908 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 378 predicate places. [2022-12-06 05:55:42,908 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:55:42,908 INFO L89 Accepts]: Start accepts. Operand has 399 places, 1933 transitions, 63273 flow [2022-12-06 05:55:42,915 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:55:42,915 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:55:42,915 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 399 places, 1933 transitions, 63273 flow [2022-12-06 05:55:42,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 399 places, 1933 transitions, 63273 flow [2022-12-06 05:55:44,745 INFO L130 PetriNetUnfolder]: 2054/4755 cut-off events. [2022-12-06 05:55:44,746 INFO L131 PetriNetUnfolder]: For 295466/295612 co-relation queries the response was YES. [2022-12-06 05:55:44,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74584 conditions, 4755 events. 2054/4755 cut-off events. For 295466/295612 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 44322 event pairs, 164 based on Foata normal form. 3/4686 useless extension candidates. Maximal degree in co-relation 73739. Up to 2505 conditions per place. [2022-12-06 05:55:44,834 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 399 places, 1933 transitions, 63273 flow [2022-12-06 05:55:44,834 INFO L188 LiptonReduction]: Number of co-enabled transitions 1554 [2022-12-06 05:55:44,838 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:55:44,838 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1930 [2022-12-06 05:55:44,838 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 1933 transitions, 63273 flow [2022-12-06 05:55:44,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:55:44,839 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:55:44,839 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:55:44,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-06 05:55:45,040 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,SelfDestructingSolverStorable34 [2022-12-06 05:55:45,040 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-06 05:55:45,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:55:45,040 INFO L85 PathProgramCache]: Analyzing trace with hash -462621548, now seen corresponding path program 1 times [2022-12-06 05:55:45,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:55:45,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769932426] [2022-12-06 05:55:45,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:55:45,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:55:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:55:45,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:55:45,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:55:45,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769932426] [2022-12-06 05:55:45,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769932426] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:55:45,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823340876] [2022-12-06 05:55:45,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:55:45,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:55:45,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:55:45,222 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-06 05:55:45,224 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-06 05:55:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:55:45,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:55:45,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:55:45,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:55:45,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:55:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:55:45,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823340876] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:55:45,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:55:45,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 05:55:45,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004951853] [2022-12-06 05:55:45,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:55:45,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:55:45,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:55:45,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:55:45,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:55:45,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 173 [2022-12-06 05:55:45,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 1933 transitions, 63273 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-06 05:55:45,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:55:45,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 173 [2022-12-06 05:55:45,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:55:50,612 INFO L130 PetriNetUnfolder]: 3230/6383 cut-off events. [2022-12-06 05:55:50,612 INFO L131 PetriNetUnfolder]: For 377976/377976 co-relation queries the response was YES. [2022-12-06 05:55:50,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98333 conditions, 6383 events. 3230/6383 cut-off events. For 377976/377976 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 53439 event pairs, 745 based on Foata normal form. 19/6398 useless extension candidates. Maximal degree in co-relation 97394. Up to 6308 conditions per place. [2022-12-06 05:55:50,766 INFO L137 encePairwiseOnDemand]: 160/173 looper letters, 1917 selfloop transitions, 33 changer transitions 1/1951 dead transitions. [2022-12-06 05:55:50,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 1951 transitions, 67676 flow [2022-12-06 05:55:50,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:55:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:55:50,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions. [2022-12-06 05:55:50,767 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18304431599229287 [2022-12-06 05:55:50,767 INFO L175 Difference]: Start difference. First operand has 399 places, 1933 transitions, 63273 flow. Second operand 6 states and 190 transitions. [2022-12-06 05:55:50,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 1951 transitions, 67676 flow [2022-12-06 05:55:53,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 1951 transitions, 65554 flow, removed 917 selfloop flow, removed 11 redundant places. [2022-12-06 05:55:53,698 INFO L231 Difference]: Finished difference. Result has 393 places, 1932 transitions, 61256 flow [2022-12-06 05:55:53,699 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=61021, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1926, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1894, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=61256, PETRI_PLACES=393, PETRI_TRANSITIONS=1932} [2022-12-06 05:55:53,700 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 372 predicate places. [2022-12-06 05:55:53,700 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:55:53,700 INFO L89 Accepts]: Start accepts. Operand has 393 places, 1932 transitions, 61256 flow [2022-12-06 05:55:53,713 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:55:53,713 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:55:53,713 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 393 places, 1932 transitions, 61256 flow [2022-12-06 05:55:53,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 392 places, 1932 transitions, 61256 flow [2022-12-06 05:55:55,820 INFO L130 PetriNetUnfolder]: 2360/5378 cut-off events. [2022-12-06 05:55:55,820 INFO L131 PetriNetUnfolder]: For 330207/330249 co-relation queries the response was YES. [2022-12-06 05:55:55,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81020 conditions, 5378 events. 2360/5378 cut-off events. For 330207/330249 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 50335 event pairs, 182 based on Foata normal form. 0/5351 useless extension candidates. Maximal degree in co-relation 80195. Up to 2873 conditions per place. [2022-12-06 05:55:55,920 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 392 places, 1932 transitions, 61256 flow [2022-12-06 05:55:55,920 INFO L188 LiptonReduction]: Number of co-enabled transitions 1568 [2022-12-06 05:55:56,285 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1033] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_575| v_~f~0.base_489))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_489 (* v_~x1~0_938 4)))) (.cse0 (mod (* 5 v_~n~0_474) 4294967296))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_864| 1) 4294967296) .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_533| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_547|) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_505)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_533|) (= (select .cse2 (+ v_~f~0.offset_489 (* .cse1 4))) v_~x1~0_936) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_864| 4294967296) .cse0) (not (= (ite (and (<= 0 v_~x1~0_938) (< v_~x1~0_938 v_~size~0_505)) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_864| 2) |v_thread1Thread1of1ForFork0_~i~0#1_862|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_547| 0))))) InVars {~size~0=v_~size~0_505, ~f~0.base=v_~f~0.base_489, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_864|, #memory_int=|v_#memory_int_575|, ~n~0=v_~n~0_474, ~x1~0=v_~x1~0_938, ~f~0.offset=v_~f~0.offset_489} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_541|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_533|, ~size~0=v_~size~0_505, ~f~0.base=v_~f~0.base_489, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_862|, #memory_int=|v_#memory_int_575|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_547|, ~n~0=v_~n~0_474, ~x1~0=v_~x1~0_936, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_553|, ~f~0.offset=v_~f~0.offset_489} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:55:56,606 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:55:56,607 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2907 [2022-12-06 05:55:56,607 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 1932 transitions, 61304 flow [2022-12-06 05:55:56,607 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-06 05:55:56,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:55:56,607 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:55:56,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-06 05:55:56,813 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,SelfDestructingSolverStorable35 [2022-12-06 05:55:56,813 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-06 05:55:56,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:55:56,813 INFO L85 PathProgramCache]: Analyzing trace with hash 298347565, now seen corresponding path program 1 times [2022-12-06 05:55:56,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:55:56,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513013109] [2022-12-06 05:55:56,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:55:56,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:55:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:55:57,037 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-06 05:55:57,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:55:57,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513013109] [2022-12-06 05:55:57,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513013109] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:55:57,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417447452] [2022-12-06 05:55:57,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:55:57,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:55:57,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:55:57,039 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-06 05:55:57,041 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-06 05:55:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:55:57,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:55:57,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:55:57,201 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-06 05:55:57,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:55:57,339 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-06 05:55:57,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417447452] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:55:57,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:55:57,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-12-06 05:55:57,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541861438] [2022-12-06 05:55:57,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:55:57,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:55:57,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:55:57,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:55:57,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-12-06 05:55:57,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 173 [2022-12-06 05:55:57,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 1932 transitions, 61304 flow. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 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-06 05:55:57,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:55:57,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 173 [2022-12-06 05:55:57,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:55:59,534 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* 5 c_~n~0))) (let ((.cse7 (* (div .cse1 4294967296) 4294967296)) (.cse6 (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296))) (let ((.cse2 (* .cse6 4294967296)) (.cse3 (mod |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296)) (.cse5 (div |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296)) (.cse0 (+ .cse7 |c_thread1Thread1of1ForFork0_~i~0#1| 1))) (and (<= .cse0 (+ .cse1 .cse2)) (forall ((~n~0 Int)) (let ((.cse4 (* 5 ~n~0))) (or (not (< .cse3 (mod .cse4 4294967296))) (<= (+ (* (div .cse4 4294967296) 4294967296) 3 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ (* (div (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296) .cse4))))) (or (<= .cse5 .cse6) (<= (+ |c_thread2Thread1of1ForFork1_~i~1#1| 3 .cse7) (+ .cse1 |c_thread1Thread1of1ForFork0_~i~0#1|))) (forall ((~n~0 Int)) (let ((.cse8 (* 5 ~n~0))) (or (not (< .cse3 (mod .cse8 4294967296))) (<= (+ (* (div .cse8 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ .cse2 .cse8))))) (forall ((~n~0 Int)) (let ((.cse9 (* 5 ~n~0))) (or (<= (+ (* (div .cse9 4294967296) 4294967296) 2 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ (* (div (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 4294967296) .cse9)) (not (< .cse3 (mod .cse9 4294967296)))))) (not (<= (+ .cse5 1) 0)) (or (< .cse6 .cse5) (<= .cse0 .cse1)))))) is different from false [2022-12-06 05:56:04,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:06,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:08,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:11,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:13,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:16,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:18,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:21,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:24,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:26,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:28,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:31,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:34,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:36,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:38,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:39,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:42,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:44,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:46,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:49,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:52,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:54,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:56,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:56:58,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:02,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:05,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:08,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:57:15,901 INFO L130 PetriNetUnfolder]: 3418/6832 cut-off events. [2022-12-06 05:57:15,901 INFO L131 PetriNetUnfolder]: For 407276/407276 co-relation queries the response was YES. [2022-12-06 05:57:15,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102948 conditions, 6832 events. 3418/6832 cut-off events. For 407276/407276 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 58873 event pairs, 691 based on Foata normal form. 12/6836 useless extension candidates. Maximal degree in co-relation 102029. Up to 5541 conditions per place. [2022-12-06 05:57:15,988 INFO L137 encePairwiseOnDemand]: 28/173 looper letters, 1345 selfloop transitions, 860 changer transitions 2/2207 dead transitions. [2022-12-06 05:57:15,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 2207 transitions, 74031 flow [2022-12-06 05:57:15,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 05:57:15,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 05:57:15,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 267 transitions. [2022-12-06 05:57:15,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.09645953757225434 [2022-12-06 05:57:15,989 INFO L175 Difference]: Start difference. First operand has 392 places, 1932 transitions, 61304 flow. Second operand 16 states and 267 transitions. [2022-12-06 05:57:15,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 2207 transitions, 74031 flow [2022-12-06 05:57:18,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 2207 transitions, 73653 flow, removed 159 selfloop flow, removed 3 redundant places. [2022-12-06 05:57:18,993 INFO L231 Difference]: Finished difference. Result has 416 places, 2124 transitions, 70907 flow [2022-12-06 05:57:18,994 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=60966, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1932, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=682, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=70907, PETRI_PLACES=416, PETRI_TRANSITIONS=2124} [2022-12-06 05:57:18,994 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 395 predicate places. [2022-12-06 05:57:18,994 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:57:18,994 INFO L89 Accepts]: Start accepts. Operand has 416 places, 2124 transitions, 70907 flow [2022-12-06 05:57:19,004 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:57:19,004 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:57:19,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 416 places, 2124 transitions, 70907 flow [2022-12-06 05:57:19,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 415 places, 2124 transitions, 70907 flow [2022-12-06 05:57:21,368 INFO L130 PetriNetUnfolder]: 2376/5425 cut-off events. [2022-12-06 05:57:21,368 INFO L131 PetriNetUnfolder]: For 418606/418693 co-relation queries the response was YES. [2022-12-06 05:57:21,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87946 conditions, 5425 events. 2376/5425 cut-off events. For 418606/418693 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 51151 event pairs, 259 based on Foata normal form. 0/5295 useless extension candidates. Maximal degree in co-relation 87049. Up to 2773 conditions per place. [2022-12-06 05:57:21,512 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 415 places, 2124 transitions, 70907 flow [2022-12-06 05:57:21,512 INFO L188 LiptonReduction]: Number of co-enabled transitions 1664 [2022-12-06 05:57:21,525 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:57:21,636 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:57:21,742 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:57:22,202 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:57:23,484 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1001] L49-2-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_520| v_~f~0.base_435))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_435 (* v_~x1~0_829 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_435 (* .cse1 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_435 (* .cse3 4)))) (.cse2 (mod (* 5 v_~n~0_418) 4294967296))) (and (not (= (ite (and (< v_~x1~0_829 v_~size~0_451) (<= 0 v_~x1~0_829)) 1 0) 0)) (= (ite (and (< .cse0 v_~size~0_451) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_471|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_471| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485|) (not (= (ite (and (< .cse1 v_~size~0_451) (<= 0 .cse1)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_740| 4294967295) 4294967296) .cse2) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_742| 1) 4294967296) .cse2) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_742| 2) 4294967296) .cse2) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_451)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485| 0)) (= v_~x1~0_827 (select .cse4 (+ v_~f~0.offset_435 (* .cse0 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_742| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_~i~0#1_740| (+ |v_thread1Thread1of1ForFork0_~i~0#1_742| 4))))))) InVars {~size~0=v_~size~0_451, ~f~0.base=v_~f~0.base_435, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_742|, #memory_int=|v_#memory_int_520|, ~n~0=v_~n~0_418, ~x1~0=v_~x1~0_829, ~f~0.offset=v_~f~0.offset_435} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_479|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_471|, ~size~0=v_~size~0_451, ~f~0.base=v_~f~0.base_435, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_740|, #memory_int=|v_#memory_int_520|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485|, ~n~0=v_~n~0_418, ~x1~0=v_~x1~0_827, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_491|, ~f~0.offset=v_~f~0.offset_435} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [763] L59-2-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_In_16| 4294967296) (mod (* 5 v_~n~0_In_7) 4294967296))) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0)) InVars {~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_16|, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] [2022-12-06 05:57:26,375 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1001] L49-2-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_520| v_~f~0.base_435))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_435 (* v_~x1~0_829 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_435 (* .cse1 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_435 (* .cse3 4)))) (.cse2 (mod (* 5 v_~n~0_418) 4294967296))) (and (not (= (ite (and (< v_~x1~0_829 v_~size~0_451) (<= 0 v_~x1~0_829)) 1 0) 0)) (= (ite (and (< .cse0 v_~size~0_451) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_471|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_471| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485|) (not (= (ite (and (< .cse1 v_~size~0_451) (<= 0 .cse1)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_740| 4294967295) 4294967296) .cse2) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_742| 1) 4294967296) .cse2) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_742| 2) 4294967296) .cse2) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_451)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485| 0)) (= v_~x1~0_827 (select .cse4 (+ v_~f~0.offset_435 (* .cse0 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_742| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_~i~0#1_740| (+ |v_thread1Thread1of1ForFork0_~i~0#1_742| 4))))))) InVars {~size~0=v_~size~0_451, ~f~0.base=v_~f~0.base_435, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_742|, #memory_int=|v_#memory_int_520|, ~n~0=v_~n~0_418, ~x1~0=v_~x1~0_829, ~f~0.offset=v_~f~0.offset_435} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_479|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_471|, ~size~0=v_~size~0_451, ~f~0.base=v_~f~0.base_435, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_740|, #memory_int=|v_#memory_int_520|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485|, ~n~0=v_~n~0_418, ~x1~0=v_~x1~0_827, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_491|, ~f~0.offset=v_~f~0.offset_435} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [817] L59-2-->L59-2: Formula: (let ((.cse6 (select |v_#memory_int_233| v_~f~0.base_161))) (let ((.cse5 (select .cse6 (+ v_~f~0.offset_161 (* v_~x2~0_262 4))))) (let ((.cse4 (select .cse6 (+ v_~f~0.offset_161 (* .cse5 4))))) (let ((.cse3 (select .cse6 (+ (* .cse4 4) v_~f~0.offset_161)))) (let ((.cse10 (select .cse6 (+ v_~f~0.offset_161 (* .cse3 4))))) (let ((.cse1 (select .cse6 (+ v_~f~0.offset_161 (* .cse10 4))))) (let ((.cse9 (select .cse6 (+ v_~f~0.offset_161 (* .cse1 4))))) (let ((.cse8 (select .cse6 (+ v_~f~0.offset_161 (* .cse9 4))))) (let ((.cse0 (select .cse6 (+ v_~f~0.offset_161 (* .cse8 4))))) (let ((.cse2 (mod (* 5 v_~n~0_144) 4294967296)) (.cse7 (select .cse6 (+ v_~f~0.offset_161 (* .cse0 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_177)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_177) (<= 0 .cse1)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_238| 4294967296) .cse2) (= (+ |v_thread2Thread1of1ForFork1_~i~1#1_238| 10) |v_thread2Thread1of1ForFork1_~i~1#1_236|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_211| 0)) (not (= (ite (and (< .cse3 v_~size~0_177) (<= 0 .cse3)) 1 0) 0)) (not (= 0 (ite (and (< .cse4 v_~size~0_177) (<= 0 .cse4)) 1 0))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_173| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_211|) (not (= 0 (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_177)) 1 0))) (= (select .cse6 (+ v_~f~0.offset_161 (* .cse7 4))) v_~x2~0_260) (< (mod (+ 4294967291 |v_thread2Thread1of1ForFork1_~i~1#1_236|) 4294967296) .cse2) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_177)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_177)) 1 0) 0)) (not (= (ite (and (< .cse10 v_~size~0_177) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_262) (< v_~x2~0_262 v_~size~0_177)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_173| (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_177)) 1 0))))))))))))) InVars {~x2~0=v_~x2~0_262, ~size~0=v_~size~0_177, ~f~0.base=v_~f~0.base_161, #memory_int=|v_#memory_int_233|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_238|, ~n~0=v_~n~0_144, ~f~0.offset=v_~f~0.offset_161} OutVars{~x2~0=v_~x2~0_260, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_65|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_69|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_63|, ~size~0=v_~size~0_177, ~f~0.base=v_~f~0.base_161, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_79|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_67|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_173|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_236|, ~f~0.offset=v_~f~0.offset_161, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_211|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_65|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_85|, #memory_int=|v_#memory_int_233|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_67|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_77|, ~n~0=v_~n~0_144, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_71|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:57:28,426 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1001] L49-2-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_520| v_~f~0.base_435))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_435 (* v_~x1~0_829 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_435 (* .cse1 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_435 (* .cse3 4)))) (.cse2 (mod (* 5 v_~n~0_418) 4294967296))) (and (not (= (ite (and (< v_~x1~0_829 v_~size~0_451) (<= 0 v_~x1~0_829)) 1 0) 0)) (= (ite (and (< .cse0 v_~size~0_451) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_471|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_471| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485|) (not (= (ite (and (< .cse1 v_~size~0_451) (<= 0 .cse1)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_740| 4294967295) 4294967296) .cse2) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_742| 1) 4294967296) .cse2) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_742| 2) 4294967296) .cse2) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_451)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485| 0)) (= v_~x1~0_827 (select .cse4 (+ v_~f~0.offset_435 (* .cse0 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_742| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_~i~0#1_740| (+ |v_thread1Thread1of1ForFork0_~i~0#1_742| 4))))))) InVars {~size~0=v_~size~0_451, ~f~0.base=v_~f~0.base_435, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_742|, #memory_int=|v_#memory_int_520|, ~n~0=v_~n~0_418, ~x1~0=v_~x1~0_829, ~f~0.offset=v_~f~0.offset_435} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_479|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_471|, ~size~0=v_~size~0_451, ~f~0.base=v_~f~0.base_435, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_740|, #memory_int=|v_#memory_int_520|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485|, ~n~0=v_~n~0_418, ~x1~0=v_~x1~0_827, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_491|, ~f~0.offset=v_~f~0.offset_435} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [1040] L59-2-->thread2EXIT: Formula: (let ((.cse5 (select |v_#memory_int_588| v_~f~0.base_501))) (let ((.cse4 (select .cse5 (+ v_~f~0.offset_501 (* v_~x2~0_582 4))))) (let ((.cse1 (select .cse5 (+ v_~f~0.offset_501 (* .cse4 4))))) (let ((.cse3 (select .cse5 (+ v_~f~0.offset_501 (* 4 .cse1))))) (let ((.cse0 (mod (* 5 v_~n~0_486) 4294967296)) (.cse2 (select .cse5 (+ v_~f~0.offset_501 (* .cse3 4))))) (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_241| 0) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_691| 4294967296) .cse0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_517)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_582 v_~size~0_517) (<= 0 v_~x2~0_582)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_#res#1.base_241| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_412| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_374| (ite (and (< .cse2 v_~size~0_517) (<= 0 .cse2)) 1 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_517)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_691| (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_692|)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_692| 4294967296) .cse0) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_517)) 1 0) 0)) (= (select .cse5 (+ v_~f~0.offset_501 (* .cse2 4))) v_~x2~0_581) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_374| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_412|))))))) InVars {~x2~0=v_~x2~0_582, ~size~0=v_~size~0_517, ~f~0.base=v_~f~0.base_501, #memory_int=|v_#memory_int_588|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_692|, ~n~0=v_~n~0_486, ~f~0.offset=v_~f~0.offset_501} OutVars{~x2~0=v_~x2~0_581, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_266|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_270|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_264|, ~size~0=v_~size~0_517, ~f~0.base=v_~f~0.base_501, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_241|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_280|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_268|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_374|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_691|, ~f~0.offset=v_~f~0.offset_501, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_412|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_241|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_266|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_286|, #memory_int=|v_#memory_int_588|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_268|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_278|, ~n~0=v_~n~0_486, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_272|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:57:30,927 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1001] L49-2-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_520| v_~f~0.base_435))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_435 (* v_~x1~0_829 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_435 (* .cse1 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_435 (* .cse3 4)))) (.cse2 (mod (* 5 v_~n~0_418) 4294967296))) (and (not (= (ite (and (< v_~x1~0_829 v_~size~0_451) (<= 0 v_~x1~0_829)) 1 0) 0)) (= (ite (and (< .cse0 v_~size~0_451) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_471|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_471| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485|) (not (= (ite (and (< .cse1 v_~size~0_451) (<= 0 .cse1)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_740| 4294967295) 4294967296) .cse2) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_742| 1) 4294967296) .cse2) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_742| 2) 4294967296) .cse2) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_451)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485| 0)) (= v_~x1~0_827 (select .cse4 (+ v_~f~0.offset_435 (* .cse0 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_742| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_~i~0#1_740| (+ |v_thread1Thread1of1ForFork0_~i~0#1_742| 4))))))) InVars {~size~0=v_~size~0_451, ~f~0.base=v_~f~0.base_435, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_742|, #memory_int=|v_#memory_int_520|, ~n~0=v_~n~0_418, ~x1~0=v_~x1~0_829, ~f~0.offset=v_~f~0.offset_435} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_479|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_471|, ~size~0=v_~size~0_451, ~f~0.base=v_~f~0.base_435, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_740|, #memory_int=|v_#memory_int_520|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_485|, ~n~0=v_~n~0_418, ~x1~0=v_~x1~0_827, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_491|, ~f~0.offset=v_~f~0.offset_435} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [1039] L59-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_586| v_~f~0.base_499))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_499 (* v_~x2~0_578 4))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_499 (* .cse2 4))))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_499 (* .cse5 4))))) (let ((.cse3 (mod (* 5 v_~n~0_484) 4294967296)) (.cse1 (select .cse0 (+ v_~f~0.offset_499 (* .cse4 4))))) (and (not (= (ite (and (<= 0 v_~x2~0_578) (< v_~x2~0_578 v_~size~0_515)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_499 (* .cse1 4))) v_~x2~0_577) (not (= (ite (and (< .cse2 v_~size~0_515) (<= 0 .cse2)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_887| 4294967296) .cse3) (= (ite (and (< v_~x1~0_963 v_~size~0_515) (<= 0 v_~x1~0_963)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_550|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_550| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_564|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_410| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_886| (+ |v_thread1Thread1of1ForFork0_~i~0#1_887| 1)) (not (= (ite (and (< .cse4 v_~size~0_515) (<= 0 .cse4)) 1 0) 0)) (= (select .cse0 (+ v_~f~0.offset_499 (* v_~x1~0_963 4))) v_~x1~0_962) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_688| 4294967296) .cse3) (= |v_thread2Thread1of1ForFork1_~i~1#1_687| (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_688|)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_372| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_410|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_372| (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_515)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_564| 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_515)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_578, ~size~0=v_~size~0_515, ~f~0.base=v_~f~0.base_499, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_887|, #memory_int=|v_#memory_int_586|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_688|, ~n~0=v_~n~0_484, ~x1~0=v_~x1~0_963, ~f~0.offset=v_~f~0.offset_499} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_558|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_264|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_268|, ~f~0.base=v_~f~0.base_499, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_266|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_372|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_687|, ~x1~0=v_~x1~0_962, ~f~0.offset=v_~f~0.offset_499, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_264|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_564|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_276|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_270|, ~x2~0=v_~x2~0_577, ~size~0=v_~size~0_515, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_262|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_278|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_410|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_550|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_284|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_886|, #memory_int=|v_#memory_int_586|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_266|, ~n~0=v_~n~0_484, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_570|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:57:32,932 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1048] $Ultimate##0-->L49-2: Formula: (let ((.cse12 (select |v_#memory_int_598| v_~f~0.base_511))) (let ((.cse7 (select .cse12 (+ v_~f~0.offset_511 (* v_~x2~0_602 4))))) (let ((.cse0 (select .cse12 (+ v_~f~0.offset_511 (* .cse7 4))))) (let ((.cse16 (select .cse12 (+ v_~f~0.offset_511 (* .cse0 4)))) (.cse10 (select .cse12 (+ v_~f~0.offset_511 (* v_~x1~0_990 4))))) (let ((.cse11 (select .cse12 (+ v_~f~0.offset_511 (* .cse10 4)))) (.cse6 (select .cse12 (+ v_~f~0.offset_511 (* .cse16 4))))) (let ((.cse15 (select .cse12 (+ v_~f~0.offset_511 (* .cse6 4)))) (.cse14 (select .cse12 (+ v_~f~0.offset_511 (* .cse11 4))))) (let ((.cse3 (select .cse12 (+ v_~f~0.offset_511 (* .cse14 4)))) (.cse5 (select .cse12 (+ v_~f~0.offset_511 (* .cse15 4))))) (let ((.cse1 (select .cse12 (+ v_~f~0.offset_511 (* .cse5 4)))) (.cse8 (select .cse12 (+ v_~f~0.offset_511 (* .cse3 4))))) (let ((.cse9 (select .cse12 (+ v_~f~0.offset_511 (* .cse8 4)))) (.cse13 (select .cse12 (+ v_~f~0.offset_511 (* .cse1 4))))) (let ((.cse2 (select .cse12 (+ v_~f~0.offset_511 (* 4 .cse13)))) (.cse4 (select .cse12 (+ v_~f~0.offset_511 (* .cse9 4))))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_566| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_580|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_424| 0)) (not (= (ite (and (< .cse0 v_~size~0_527) (<= 0 .cse0)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_907| 4294967295) 4294967296) (mod (* 5 v_~n~0_496) 4294967296)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_527)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| (ite (and (< .cse2 v_~size~0_527) (<= 0 .cse2)) 1 0)) (not (= (ite (and (< .cse3 v_~size~0_527) (<= 0 .cse3)) 1 0) 0)) (= (select (select |v_#memory_int_598| |v_ULTIMATE.start_main_~#t1~0#1.base_131|) |v_ULTIMATE.start_main_~#t1~0#1.offset_131|) |v_ULTIMATE.start_main_#t~mem20#1_152|) (not (= (ite (and (< v_~x2~0_602 v_~size~0_527) (<= 0 v_~x2~0_602)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_707| 10) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_566| (ite (and (< .cse4 v_~size~0_527) (<= 0 .cse4)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_907| 8) (not (= (ite (and (< .cse5 v_~size~0_527) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_527)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_580| 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_527)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_527) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x1~0_990) (< v_~x1~0_990 v_~size~0_527)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_527) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_527)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_527)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_386| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_424|) (= v_~x2~0_601 (select .cse12 (+ v_~f~0.offset_511 (* .cse2 4)))) (not (= (ite (and (< .cse13 v_~size~0_527) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_527)) 1 0) 0)) (= v_~x1~0_988 (select .cse12 (+ v_~f~0.offset_511 (* .cse4 4)))) (not (= (ite (and (< .cse15 v_~size~0_527) (<= 0 .cse15)) 1 0) 0)) (not (= 0 (ite (and (< .cse16 v_~size~0_527) (<= 0 .cse16)) 1 0)))))))))))))) InVars {~x2~0=v_~x2~0_602, ~size~0=v_~size~0_527, ~f~0.base=v_~f~0.base_511, #memory_int=|v_#memory_int_598|, ~n~0=v_~n~0_496, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_131|, ~x1~0=v_~x1~0_990, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_131|, ~f~0.offset=v_~f~0.offset_511} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_150|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_574|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_278|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_282|, ~f~0.base=v_~f~0.base_511, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_280|, 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_707|, ~x1~0=v_~x1~0_988, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_131|, ~f~0.offset=v_~f~0.offset_511, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_278|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_580|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_290|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_284|, ~x2~0=v_~x2~0_601, ~size~0=v_~size~0_527, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_276|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_292|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_131|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_424|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_152|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_566|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_298|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_907|, #memory_int=|v_#memory_int_598|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_280|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_124|, ~n~0=v_~n~0_496, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_586|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem20#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, ULTIMATE.start_main_#t~nondet19#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:57:36,896 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 05:57:36,896 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17902 [2022-12-06 05:57:36,896 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 2124 transitions, 71266 flow [2022-12-06 05:57:36,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 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-06 05:57:36,897 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:57:36,897 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:57:36,902 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-06 05:57:37,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:57:37,102 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-06 05:57:37,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:57:37,103 INFO L85 PathProgramCache]: Analyzing trace with hash -214387382, now seen corresponding path program 1 times [2022-12-06 05:57:37,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:57:37,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397313915] [2022-12-06 05:57:37,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:57:37,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:57:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:57:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:57:37,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:57:37,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397313915] [2022-12-06 05:57:37,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397313915] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:57:37,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222569688] [2022-12-06 05:57:37,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:57:37,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:57:37,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:57:37,175 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-06 05:57:37,176 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-06 05:57:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:57:37,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:57:37,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:57:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:57:37,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:57:37,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:57:37,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222569688] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:57:37,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:57:37,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 05:57:37,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331554941] [2022-12-06 05:57:37,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:57:37,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:57:37,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:57:37,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:57:37,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:57:37,322 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 184 [2022-12-06 05:57:37,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 2124 transitions, 71266 flow. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-06 05:57:37,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:57:37,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 184 [2022-12-06 05:57:37,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:57:44,125 INFO L130 PetriNetUnfolder]: 3434/6856 cut-off events. [2022-12-06 05:57:44,125 INFO L131 PetriNetUnfolder]: For 511467/511467 co-relation queries the response was YES. [2022-12-06 05:57:44,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110973 conditions, 6856 events. 3434/6856 cut-off events. For 511467/511467 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 59484 event pairs, 820 based on Foata normal form. 8/6852 useless extension candidates. Maximal degree in co-relation 109976. Up to 6762 conditions per place. [2022-12-06 05:57:44,220 INFO L137 encePairwiseOnDemand]: 169/184 looper letters, 2110 selfloop transitions, 40 changer transitions 2/2152 dead transitions. [2022-12-06 05:57:44,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 2152 transitions, 76295 flow [2022-12-06 05:57:44,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:57:44,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:57:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2022-12-06 05:57:44,222 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1875 [2022-12-06 05:57:44,222 INFO L175 Difference]: Start difference. First operand has 415 places, 2124 transitions, 71266 flow. Second operand 6 states and 207 transitions. [2022-12-06 05:57:44,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 2152 transitions, 76295 flow [2022-12-06 05:57:48,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 2152 transitions, 75647 flow, removed 324 selfloop flow, removed 0 redundant places. [2022-12-06 05:57:48,133 INFO L231 Difference]: Finished difference. Result has 422 places, 2129 transitions, 70809 flow [2022-12-06 05:57:48,134 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=70584, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2086, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=70809, PETRI_PLACES=422, PETRI_TRANSITIONS=2129} [2022-12-06 05:57:48,134 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 401 predicate places. [2022-12-06 05:57:48,134 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:57:48,134 INFO L89 Accepts]: Start accepts. Operand has 422 places, 2129 transitions, 70809 flow [2022-12-06 05:57:48,145 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:57:48,145 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:57:48,145 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 422 places, 2129 transitions, 70809 flow [2022-12-06 05:57:48,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 420 places, 2129 transitions, 70809 flow [2022-12-06 05:57:50,428 INFO L130 PetriNetUnfolder]: 2360/5412 cut-off events. [2022-12-06 05:57:50,428 INFO L131 PetriNetUnfolder]: For 425017/425103 co-relation queries the response was YES. [2022-12-06 05:57:50,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87883 conditions, 5412 events. 2360/5412 cut-off events. For 425017/425103 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 51688 event pairs, 286 based on Foata normal form. 0/5275 useless extension candidates. Maximal degree in co-relation 86988. Up to 2737 conditions per place. [2022-12-06 05:57:50,536 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 420 places, 2129 transitions, 70809 flow [2022-12-06 05:57:50,536 INFO L188 LiptonReduction]: Number of co-enabled transitions 1672 [2022-12-06 05:57:53,931 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1059] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_613| v_~f~0.base_523))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_523 (* v_~x1~0_1035 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_523 (* .cse0 4)))) (.cse1 (mod (* 5 v_~n~0_508) 4294967296))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_539)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_949| 1) 4294967296) .cse1) (not (= (ite (and (< v_~x1~0_1035 v_~size~0_539) (<= 0 v_~x1~0_1035)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_947| (+ |v_thread1Thread1of1ForFork0_~i~0#1_949| 3)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_610| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_596| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_610|) (= v_~x1~0_1033 (select .cse2 (+ v_~f~0.offset_523 (* .cse3 4)))) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_539)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_596|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_949| 2) 4294967296) .cse1) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_949| 4294967296) .cse1))))) InVars {~size~0=v_~size~0_539, ~f~0.base=v_~f~0.base_523, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_949|, #memory_int=|v_#memory_int_613|, ~n~0=v_~n~0_508, ~x1~0=v_~x1~0_1035, ~f~0.offset=v_~f~0.offset_523} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_604|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_596|, ~size~0=v_~size~0_539, ~f~0.base=v_~f~0.base_523, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_947|, #memory_int=|v_#memory_int_613|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_610|, ~n~0=v_~n~0_508, ~x1~0=v_~x1~0_1033, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_616|, ~f~0.offset=v_~f~0.offset_523} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:57:54,426 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:57:54,733 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:57:54,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6600 [2022-12-06 05:57:54,734 INFO L495 AbstractCegarLoop]: Abstraction has has 420 places, 2129 transitions, 70901 flow [2022-12-06 05:57:54,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-06 05:57:54,734 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:57:54,735 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:57:54,741 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-06 05:57:54,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-06 05:57:54,936 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-06 05:57:54,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:57:54,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1674570450, now seen corresponding path program 1 times [2022-12-06 05:57:54,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:57:54,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817614024] [2022-12-06 05:57:54,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:57:54,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:57:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:57:55,033 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-06 05:57:55,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:57:55,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817614024] [2022-12-06 05:57:55,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817614024] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:57:55,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582783875] [2022-12-06 05:57:55,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:57:55,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:57:55,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:57:55,035 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-06 05:57:55,036 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-06 05:57:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:57:55,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:57:55,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:57:55,179 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-06 05:57:55,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:57:55,223 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-06 05:57:55,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582783875] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:57:55,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:57:55,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 05:57:55,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840001555] [2022-12-06 05:57:55,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:57:55,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:57:55,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:57:55,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:57:55,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-06 05:57:55,225 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 188 [2022-12-06 05:57:55,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 2129 transitions, 70901 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-06 05:57:55,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:57:55,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 188 [2022-12-06 05:57:55,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:58:03,253 INFO L130 PetriNetUnfolder]: 3495/6996 cut-off events. [2022-12-06 05:58:03,253 INFO L131 PetriNetUnfolder]: For 540552/540552 co-relation queries the response was YES. [2022-12-06 05:58:03,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113502 conditions, 6996 events. 3495/6996 cut-off events. For 540552/540552 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 60972 event pairs, 805 based on Foata normal form. 18/7004 useless extension candidates. Maximal degree in co-relation 112507. Up to 6793 conditions per place. [2022-12-06 05:58:03,350 INFO L137 encePairwiseOnDemand]: 168/188 looper letters, 2135 selfloop transitions, 71 changer transitions 1/2207 dead transitions. [2022-12-06 05:58:03,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 2207 transitions, 77477 flow [2022-12-06 05:58:03,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:58:03,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:58:03,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 257 transitions. [2022-12-06 05:58:03,352 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11391843971631206 [2022-12-06 05:58:03,352 INFO L175 Difference]: Start difference. First operand has 420 places, 2129 transitions, 70901 flow. Second operand 12 states and 257 transitions. [2022-12-06 05:58:03,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 2207 transitions, 77477 flow [2022-12-06 05:58:07,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 2207 transitions, 77318 flow, removed 43 selfloop flow, removed 3 redundant places. [2022-12-06 05:58:07,259 INFO L231 Difference]: Finished difference. Result has 436 places, 2153 transitions, 71669 flow [2022-12-06 05:58:07,260 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=70721, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2065, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=71669, PETRI_PLACES=436, PETRI_TRANSITIONS=2153} [2022-12-06 05:58:07,261 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 415 predicate places. [2022-12-06 05:58:07,261 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:58:07,261 INFO L89 Accepts]: Start accepts. Operand has 436 places, 2153 transitions, 71669 flow [2022-12-06 05:58:07,267 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:58:07,267 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:58:07,267 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 436 places, 2153 transitions, 71669 flow [2022-12-06 05:58:07,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 436 places, 2153 transitions, 71669 flow [2022-12-06 05:58:09,699 INFO L130 PetriNetUnfolder]: 2399/5536 cut-off events. [2022-12-06 05:58:09,699 INFO L131 PetriNetUnfolder]: For 461746/461832 co-relation queries the response was YES. [2022-12-06 05:58:09,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91461 conditions, 5536 events. 2399/5536 cut-off events. For 461746/461832 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 53274 event pairs, 289 based on Foata normal form. 0/5401 useless extension candidates. Maximal degree in co-relation 91312. Up to 2771 conditions per place. [2022-12-06 05:58:09,821 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 436 places, 2153 transitions, 71669 flow [2022-12-06 05:58:09,821 INFO L188 LiptonReduction]: Number of co-enabled transitions 1726 [2022-12-06 05:58:09,823 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1086] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_651| v_~f~0.base_561))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_561 (* v_~x2~0_688 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_561 (* 4 .cse5)))) (.cse7 (select .cse1 (+ v_~f~0.offset_561 (* v_~x1~0_1123 4))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_561 (* .cse7 4)))) (.cse8 (select .cse1 (+ v_~f~0.offset_561 (* .cse0 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_561 (* .cse8 4)))) (.cse2 (select .cse1 (+ v_~f~0.offset_561 (* 4 .cse6)))) (.cse3 (mod (* 5 v_~n~0_546) 4294967296))) (and (not (= (ite (and (< .cse0 v_~size~0_577) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_561 (* .cse2 4))) v_~x1~0_1121) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_1035| 2) 4294967296) .cse3) (= v_~x2~0_687 (select .cse1 (+ v_~f~0.offset_561 (* .cse4 4)))) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_577)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_476| 0)) (not (= (ite (and (< v_~x2~0_688 v_~size~0_577) (<= 0 v_~x2~0_688)) 1 0) 0)) (not (= (ite (and (< v_~x1~0_1123 v_~size~0_577) (<= 0 v_~x1~0_1123)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_799| (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_800|)) (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_577)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_438|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_1035| 1) 4294967296) .cse3) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_577)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_650| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_664|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_664| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_1035| 4294967296) .cse3) (not (= (ite (and (< .cse7 v_~size~0_577) (<= 0 .cse7)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_800| 4294967296) .cse3) (not (= (ite (and (< .cse8 v_~size~0_577) (<= 0 .cse8)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_438| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_476|) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_577)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_650|) (= |v_thread1Thread1of1ForFork0_~i~0#1_1033| (+ |v_thread1Thread1of1ForFork0_~i~0#1_1035| 4)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_1033| 4294967295) 4294967296) .cse3))))))) InVars {~x2~0=v_~x2~0_688, ~size~0=v_~size~0_577, ~f~0.base=v_~f~0.base_561, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1035|, #memory_int=|v_#memory_int_651|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_800|, ~n~0=v_~n~0_546, ~x1~0=v_~x1~0_1123, ~f~0.offset=v_~f~0.offset_561} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_658|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_330|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_334|, ~f~0.base=v_~f~0.base_561, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_332|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_438|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_799|, ~x1~0=v_~x1~0_1121, ~f~0.offset=v_~f~0.offset_561, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_330|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_664|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_342|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_336|, ~x2~0=v_~x2~0_687, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_328|, ~size~0=v_~size~0_577, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_344|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_476|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_650|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_350|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1033|, #memory_int=|v_#memory_int_651|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_332|, ~n~0=v_~n~0_546, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_670|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [765] L49-2-->L49-2: Formula: (and (= (select (select |v_#memory_int_In_36| v_~f~0.base_In_20) (+ v_~f~0.offset_In_20 (* v_~x1~0_In_7 4))) v_~x1~0_Out_12) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_10|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_6| 4294967296) (mod (* 5 v_~n~0_In_11) 4294967296)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6| 0)) (= (ite (and (< v_~x1~0_In_7 v_~size~0_In_22) (<= 0 v_~x1~0_In_7)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|)) InVars {~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_6|, #memory_int=|v_#memory_int_In_36|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_In_7, ~f~0.offset=v_~f~0.offset_In_20} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_10|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_22, ~f~0.base=v_~f~0.base_In_20, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_10|, #memory_int=|v_#memory_int_In_36|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_6|, ~n~0=v_~n~0_In_11, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:58:16,899 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1080] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_645| v_~f~0.base_555))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_555 (* v_~x2~0_683 4))))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_555 (* v_~x1~0_1102 4)))) (.cse4 (select .cse1 (+ v_~f~0.offset_555 (* .cse6 4))))) (let ((.cse14 (select .cse1 (+ v_~f~0.offset_555 (* .cse4 4)))) (.cse11 (select .cse1 (+ v_~f~0.offset_555 (* .cse7 4))))) (let ((.cse13 (select .cse1 (+ v_~f~0.offset_555 (* .cse11 4)))) (.cse3 (select .cse1 (+ v_~f~0.offset_555 (* .cse14 4))))) (let ((.cse9 (select .cse1 (+ v_~f~0.offset_555 (* 4 .cse3)))) (.cse8 (select .cse1 (+ v_~f~0.offset_555 (* .cse13 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_555 (* .cse8 4)))) (.cse12 (select .cse1 (+ v_~f~0.offset_555 (* .cse9 4))))) (let ((.cse15 (select .cse1 (+ v_~f~0.offset_555 (* .cse12 4)))) (.cse16 (select .cse1 (+ v_~f~0.offset_555 (* .cse0 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_555 (* .cse16 4)))) (.cse17 (select .cse1 (+ v_~f~0.offset_555 (* .cse15 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_555 (* .cse17 4)))) (.cse10 (select .cse1 (+ v_~f~0.offset_555 (* .cse5 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_571) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_555 (* .cse2 4))) v_~x2~0_682) (not (= (ite (and (< .cse3 v_~size~0_571) (<= 0 .cse3)) 1 0) 0)) (not (= (ite (and (< .cse4 v_~size~0_571) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_571)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_435| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_473|) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_571)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_1014| 4294967295) 4294967296) (mod (* 5 v_~n~0_540) 4294967296)) (not (= (ite (and (< v_~x1~0_1102 v_~size~0_571) (<= 0 v_~x1~0_1102)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_683) (< v_~x2~0_683 v_~size~0_571)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_649| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_635| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_649|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_435| (ite (and (< .cse2 v_~size~0_571) (<= 0 .cse2)) 1 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_571)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_571) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_571) (<= 0 .cse9)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_794| 10) (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_571)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_635|) (= |v_thread1Thread1of1ForFork0_~i~0#1_1014| 9) (not (= (ite (and (< .cse11 v_~size~0_571) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_571) (<= 0 .cse12)) 1 0) 0)) (not (= (ite (and (<= 0 .cse13) (< .cse13 v_~size~0_571)) 1 0) 0)) (not (= (ite (and (< .cse14 v_~size~0_571) (<= 0 .cse14)) 1 0) 0)) (not (= (ite (and (<= 0 .cse15) (< .cse15 v_~size~0_571)) 1 0) 0)) (not (= (ite (and (<= 0 .cse16) (< .cse16 v_~size~0_571)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_473| 0)) (= v_~x1~0_1100 (select .cse1 (+ v_~f~0.offset_555 (* .cse10 4)))) (not (= (ite (and (<= 0 .cse17) (< .cse17 v_~size~0_571)) 1 0) 0)) (= (select (select |v_#memory_int_645| |v_ULTIMATE.start_main_~#t1~0#1.base_137|) |v_ULTIMATE.start_main_~#t1~0#1.offset_137|) |v_ULTIMATE.start_main_#t~mem20#1_168|)))))))))))) InVars {~x2~0=v_~x2~0_683, ~size~0=v_~size~0_571, ~f~0.base=v_~f~0.base_555, #memory_int=|v_#memory_int_645|, ~n~0=v_~n~0_540, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_137|, ~x1~0=v_~x1~0_1102, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_137|, ~f~0.offset=v_~f~0.offset_555} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_162|, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_643|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_327|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_331|, ~f~0.base=v_~f~0.base_555, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_329|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_435|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_794|, ~x1~0=v_~x1~0_1100, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_137|, ~f~0.offset=v_~f~0.offset_555, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_327|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_649|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_339|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_333|, ~x2~0=v_~x2~0_682, ~size~0=v_~size~0_571, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_325|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_341|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_137|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_473|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_168|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_635|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_347|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1014|, #memory_int=|v_#memory_int_645|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_329|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_135|, ~n~0=v_~n~0_540, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_655|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem20#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, ULTIMATE.start_main_#t~nondet19#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:58:19,937 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:58:19,938 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12677 [2022-12-06 05:58:19,938 INFO L495 AbstractCegarLoop]: Abstraction has has 436 places, 2153 transitions, 71759 flow [2022-12-06 05:58:19,938 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-06 05:58:19,938 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:58:19,938 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:58:19,943 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-06 05:58:20,139 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,SelfDestructingSolverStorable38 [2022-12-06 05:58:20,140 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-06 05:58:20,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:58:20,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2111703713, now seen corresponding path program 1 times [2022-12-06 05:58:20,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:58:20,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131000626] [2022-12-06 05:58:20,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:58:20,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:58:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:58:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:58:20,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:58:20,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131000626] [2022-12-06 05:58:20,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131000626] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:58:20,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026558059] [2022-12-06 05:58:20,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:58:20,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:58:20,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:58:20,240 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-06 05:58:20,244 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-06 05:58:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:58:20,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:58:20,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:58:20,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:58:20,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:58:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:58:20,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026558059] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:58:20,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:58:20,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-12-06 05:58:20,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107892319] [2022-12-06 05:58:20,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:58:20,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:58:20,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:58:20,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:58:20,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:58:20,395 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 191 [2022-12-06 05:58:20,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 2153 transitions, 71759 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-06 05:58:20,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:58:20,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 191 [2022-12-06 05:58:20,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:58:28,402 INFO L130 PetriNetUnfolder]: 3511/7008 cut-off events. [2022-12-06 05:58:28,402 INFO L131 PetriNetUnfolder]: For 577402/577402 co-relation queries the response was YES. [2022-12-06 05:58:28,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115369 conditions, 7008 events. 3511/7008 cut-off events. For 577402/577402 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 61062 event pairs, 817 based on Foata normal form. 30/7028 useless extension candidates. Maximal degree in co-relation 115212. Up to 6844 conditions per place. [2022-12-06 05:58:28,502 INFO L137 encePairwiseOnDemand]: 170/191 looper letters, 2135 selfloop transitions, 67 changer transitions 0/2202 dead transitions. [2022-12-06 05:58:28,502 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 2202 transitions, 77498 flow [2022-12-06 05:58:28,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:58:28,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:58:28,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 242 transitions. [2022-12-06 05:58:28,503 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11518324607329843 [2022-12-06 05:58:28,503 INFO L175 Difference]: Start difference. First operand has 436 places, 2153 transitions, 71759 flow. Second operand 11 states and 242 transitions. [2022-12-06 05:58:28,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 2202 transitions, 77498 flow [2022-12-06 05:58:32,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 2202 transitions, 77106 flow, removed 196 selfloop flow, removed 1 redundant places. [2022-12-06 05:58:32,801 INFO L231 Difference]: Finished difference. Result has 448 places, 2162 transitions, 71761 flow [2022-12-06 05:58:32,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=71320, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2088, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=71761, PETRI_PLACES=448, PETRI_TRANSITIONS=2162} [2022-12-06 05:58:32,802 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 427 predicate places. [2022-12-06 05:58:32,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:58:32,802 INFO L89 Accepts]: Start accepts. Operand has 448 places, 2162 transitions, 71761 flow [2022-12-06 05:58:32,809 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:58:32,809 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:58:32,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 448 places, 2162 transitions, 71761 flow [2022-12-06 05:58:32,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 448 places, 2162 transitions, 71761 flow [2022-12-06 05:58:35,202 INFO L130 PetriNetUnfolder]: 2407/5458 cut-off events. [2022-12-06 05:58:35,202 INFO L131 PetriNetUnfolder]: For 487522/487608 co-relation queries the response was YES. [2022-12-06 05:58:35,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92652 conditions, 5458 events. 2407/5458 cut-off events. For 487522/487608 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 52022 event pairs, 285 based on Foata normal form. 0/5320 useless extension candidates. Maximal degree in co-relation 92160. Up to 2764 conditions per place. [2022-12-06 05:58:35,309 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 448 places, 2162 transitions, 71761 flow [2022-12-06 05:58:35,310 INFO L188 LiptonReduction]: Number of co-enabled transitions 1760 [2022-12-06 05:58:35,311 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1090] L49-2-->L49-2: Formula: (let ((.cse3 (select |v_#memory_int_657| v_~f~0.base_567))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_567 (* v_~x1~0_1140 4)))) (.cse0 (select .cse3 (+ v_~f~0.offset_567 (* v_~x2~0_701 4))))) (let ((.cse8 (select .cse3 (+ v_~f~0.offset_567 (* .cse0 4)))) (.cse2 (select .cse3 (+ v_~f~0.offset_567 (* .cse1 4))))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_567 (* 4 .cse2)))) (.cse9 (select .cse3 (+ v_~f~0.offset_567 (* .cse8 4))))) (let ((.cse6 (mod (* 5 v_~n~0_552) 4294967296)) (.cse4 (select .cse3 (+ v_~f~0.offset_567 (* 4 .cse9)))) (.cse5 (select .cse3 (+ v_~f~0.offset_567 (* .cse7 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_583) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_583)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_661| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_675|) (= |v_thread1Thread1of1ForFork0_~i~0#1_1051| (+ |v_thread1Thread1of1ForFork0_~i~0#1_1053| 5)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_675| 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_583)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_701) (< v_~x2~0_701 v_~size~0_583)) 1 0) 0)) (= v_~x2~0_700 (select .cse3 (+ v_~f~0.offset_567 (* .cse4 4)))) (= v_~x1~0_1138 (select .cse3 (+ v_~f~0.offset_567 (* .cse5 4)))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_813|) |v_thread2Thread1of1ForFork1_~i~1#1_812|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_1053| 1) 4294967296) .cse6) (not (= 0 (ite (and (< .cse7 v_~size~0_583) (<= 0 .cse7)) 1 0))) (not (= (ite (and (<= 0 v_~x1~0_1140) (< v_~x1~0_1140 v_~size~0_583)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_483| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_445| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_483|) (not (= (ite (and (< .cse8 v_~size~0_583) (<= 0 .cse8)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_1053| 3) 4294967296) .cse6) (not (= (ite (and (< .cse9 v_~size~0_583) (<= 0 .cse9)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_813| 4294967296) .cse6) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_1053| 4294967296) .cse6) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_1053| 4) 4294967296) .cse6) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_1053| 2) 4294967296) .cse6) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_445| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_583)) 1 0)) (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_583)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_661|))))))) InVars {~x2~0=v_~x2~0_701, ~size~0=v_~size~0_583, ~f~0.base=v_~f~0.base_567, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1053|, #memory_int=|v_#memory_int_657|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_813|, ~n~0=v_~n~0_552, ~x1~0=v_~x1~0_1140, ~f~0.offset=v_~f~0.offset_567} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_669|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_337|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_341|, ~f~0.base=v_~f~0.base_567, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_339|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_445|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_812|, ~x1~0=v_~x1~0_1138, ~f~0.offset=v_~f~0.offset_567, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_337|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_675|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_349|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_343|, ~x2~0=v_~x2~0_700, ~size~0=v_~size~0_583, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_335|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_351|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_483|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_661|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_357|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1051|, #memory_int=|v_#memory_int_657|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_339|, ~n~0=v_~n~0_552, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_681|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:58:46,556 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1098] L49-2-->L49-2: Formula: (let ((.cse3 (select |v_#memory_int_667| v_~f~0.base_577))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_577 (* v_~x1~0_1166 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_577 (* v_~x2~0_728 4)))) (.cse0 (select .cse3 (+ v_~f~0.offset_577 (* .cse6 4))))) (let ((.cse9 (select .cse3 (+ v_~f~0.offset_577 (* .cse0 4)))) (.cse10 (select .cse3 (+ v_~f~0.offset_577 (* .cse2 4))))) (let ((.cse8 (select .cse3 (+ v_~f~0.offset_577 (* .cse10 4)))) (.cse5 (select .cse3 (+ v_~f~0.offset_577 (* .cse9 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_577 (* .cse5 4)))) (.cse7 (select .cse3 (+ v_~f~0.offset_577 (* .cse8 4)))) (.cse1 (mod (* 5 v_~n~0_562) 4294967296))) (and (not (= (ite (and (< .cse0 v_~size~0_593) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_838| 4294967296) .cse1) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_593)) 1 0) 0)) (= v_~x1~0_1164 (select .cse3 (+ v_~f~0.offset_577 (* 4 .cse4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_691| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_677| (ite (and (< .cse4 v_~size~0_593) (<= 0 .cse4)) 1 0)) (not (= (ite (and (< .cse5 v_~size~0_593) (<= 0 .cse5)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_1075| 1) 4294967296) .cse1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_500| 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_593)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_462| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_500|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_1075| 4) 4294967296) .cse1) (not (= (ite (and (<= 0 v_~x2~0_728) (< v_~x2~0_728 v_~size~0_593)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_462| (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_593)) 1 0)) (not (= (ite (and (<= 0 v_~x1~0_1166) (< v_~x1~0_1166 v_~size~0_593)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_593) (<= 0 .cse8)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_1075| 2) 4294967296) .cse1) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_1075| 3) 4294967296) .cse1) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_1075| 4294967296) .cse1) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_593)) 1 0) 0)) (= v_~x2~0_727 (select .cse3 (+ v_~f~0.offset_577 (* .cse7 4)))) (= |v_thread1Thread1of1ForFork0_~i~0#1_1073| (+ |v_thread1Thread1of1ForFork0_~i~0#1_1075| 6)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_593)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_677| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_691|) (= |v_thread2Thread1of1ForFork1_~i~1#1_837| (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_838|)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_1073| 4294967295) 4294967296) .cse1)))))))) InVars {~x2~0=v_~x2~0_728, ~size~0=v_~size~0_593, ~f~0.base=v_~f~0.base_577, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1075|, #memory_int=|v_#memory_int_667|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_838|, ~n~0=v_~n~0_562, ~x1~0=v_~x1~0_1166, ~f~0.offset=v_~f~0.offset_577} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_685|, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_354|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_358|, ~f~0.base=v_~f~0.base_577, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_356|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_462|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_837|, ~x1~0=v_~x1~0_1164, ~f~0.offset=v_~f~0.offset_577, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_354|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_691|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_366|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_360|, ~x2~0=v_~x2~0_727, ~size~0=v_~size~0_593, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_352|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_368|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_500|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_677|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_374|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1073|, #memory_int=|v_#memory_int_667|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_356|, ~n~0=v_~n~0_562, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_697|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, ~x1~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1] and [771] L59-2-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_141| v_~f~0.base_91))) (let ((.cse0 (select .cse3 (+ (* v_~x2~0_182 4) v_~f~0.offset_91)))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_91 (* .cse0 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_91 (* .cse2 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_91 (* .cse4 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_159| 4294967296) (mod (* v_~n~0_78 5) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169| 0)) (= (ite (and (< .cse1 v_~size~0_115) (<= 0 .cse1)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|) (not (= (ite (and (< .cse2 v_~size~0_115) (<= 0 .cse2)) 1 0) 0)) (= v_~x2~0_180 (select .cse3 (+ (* .cse1 4) v_~f~0.offset_91))) (= (+ 5 |v_thread2Thread1of1ForFork1_~i~1#1_159|) |v_thread2Thread1of1ForFork1_~i~1#1_157|) (not (= (ite (and (< .cse4 v_~size~0_115) (<= 0 .cse4)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_182) (< v_~x2~0_182 v_~size~0_115)) 1 0) 0)))))))) InVars {~x2~0=v_~x2~0_182, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_159|, ~n~0=v_~n~0_78, ~f~0.offset=v_~f~0.offset_91} OutVars{~x2~0=v_~x2~0_180, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_25|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_23|, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_91, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_39|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_27|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_131|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_157|, ~f~0.offset=v_~f~0.offset_91, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_169|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_25|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_43|, #memory_int=|v_#memory_int_141|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_27|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_37|, ~n~0=v_~n~0_78, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_31|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:58:56,471 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:58:56,471 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23669 [2022-12-06 05:58:56,471 INFO L495 AbstractCegarLoop]: Abstraction has has 448 places, 2162 transitions, 71850 flow [2022-12-06 05:58:56,471 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-06 05:58:56,472 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:58:56,472 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:58:56,477 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-06 05:58:56,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-06 05:58:56,675 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-06 05:58:56,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:58:56,676 INFO L85 PathProgramCache]: Analyzing trace with hash 268660703, now seen corresponding path program 1 times [2022-12-06 05:58:56,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:58:56,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547564865] [2022-12-06 05:58:56,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:58:56,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:58:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:58:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:58:56,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:58:56,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547564865] [2022-12-06 05:58:56,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547564865] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:58:56,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:58:56,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:58:56,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328334650] [2022-12-06 05:58:56,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:58:56,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:58:56,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:58:56,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:58:56,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:58:56,758 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 194 [2022-12-06 05:58:56,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 2162 transitions, 71850 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:58:56,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:58:56,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 194 [2022-12-06 05:58:56,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 05:59:02,067 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:59:02,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:59:02,137 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 05:59:02,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-06 05:59:02,137 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (4states, 0/194 universal loopers) in iteration 41,while PetriNetUnfolder was constructing finite prefix that currently has 104591 conditions, 6080 events (3186/6079 cut-off events. For 564106/564106 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 53132 event pairs, 717 based on Foata normal form. 3/6361 useless extension candidates. Maximal degree in co-relation 104102. Up to 5727 conditions per place.). [2022-12-06 05:59:02,138 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 05:59:02,138 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 05:59:02,138 INFO L458 BasicCegarLoop]: Path program histogram: [3, 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] [2022-12-06 05:59:02,140 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:59:02,140 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:59:02,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:59:02 BasicIcfg [2022-12-06 05:59:02,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:59:02,143 INFO L158 Benchmark]: Toolchain (without parser) took 812864.58ms. Allocated memory was 208.7MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 168.4MB in the beginning and 387.2MB in the end (delta: -218.8MB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2022-12-06 05:59:02,143 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 208.7MB. Free memory is still 185.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:59:02,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.08ms. Allocated memory is still 208.7MB. Free memory was 167.8MB in the beginning and 156.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:59:02,143 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.60ms. Allocated memory is still 208.7MB. Free memory was 156.2MB in the beginning and 154.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:59:02,143 INFO L158 Benchmark]: Boogie Preprocessor took 26.93ms. Allocated memory is still 208.7MB. Free memory was 154.1MB in the beginning and 152.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:59:02,144 INFO L158 Benchmark]: RCFGBuilder took 578.64ms. Allocated memory is still 208.7MB. Free memory was 152.6MB in the beginning and 134.7MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-06 05:59:02,144 INFO L158 Benchmark]: TraceAbstraction took 811904.74ms. Allocated memory was 208.7MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 134.2MB in the beginning and 387.2MB in the end (delta: -253.0MB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2022-12-06 05:59:02,145 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 208.7MB. Free memory is still 185.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 293.08ms. Allocated memory is still 208.7MB. Free memory was 167.8MB in the beginning and 156.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.60ms. Allocated memory is still 208.7MB. Free memory was 156.2MB in the beginning and 154.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.93ms. Allocated memory is still 208.7MB. Free memory was 154.1MB in the beginning and 152.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 578.64ms. Allocated memory is still 208.7MB. Free memory was 152.6MB in the beginning and 134.7MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 811904.74ms. Allocated memory was 208.7MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 134.2MB in the beginning and 387.2MB in the end (delta: -253.0MB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 173 PlacesBefore, 21 PlacesAfterwards, 183 TransitionsBefore, 17 TransitionsAfterwards, 3892 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 69 TrivialYvCompositions, 83 ConcurrentYvCompositions, 14 ChoiceCompositions, 166 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2527, independent: 2526, independent conditional: 2526, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2527, independent: 2526, independent conditional: 0, independent unconditional: 2526, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2527, independent: 2526, independent conditional: 0, independent unconditional: 2526, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2527, independent: 2526, independent conditional: 0, independent unconditional: 2526, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2286, independent: 2285, independent conditional: 0, independent unconditional: 2285, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2286, independent: 2285, independent conditional: 0, independent unconditional: 2285, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2527, independent: 241, independent conditional: 0, independent unconditional: 241, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2286, unknown conditional: 0, unknown unconditional: 2286] , Statistics on independence cache: Total cache size (in pairs): 4489, Positive cache size: 4488, Positive conditional cache size: 0, Positive unconditional cache size: 4488, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 20 PlacesBefore, 19 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 20 PlacesBefore, 20 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 72 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 24 PlacesBefore, 23 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 3, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 15, independent conditional: 3, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 21 TransitionsBefore, 19 TransitionsAfterwards, 64 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 4, 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: 10, independent: 10, independent conditional: 4, 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: 5, independent: 5, independent conditional: 2, 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: 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: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 2, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 26 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 54 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): 11, Positive cache size: 11, Positive conditional cache size: 2, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 26 PlacesBefore, 25 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 34 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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): 12, Positive cache size: 12, Positive conditional cache size: 2, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 24 PlacesBefore, 25 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 4, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 44 PlacesBefore, 41 PlacesAfterwards, 25 TransitionsBefore, 22 TransitionsAfterwards, 52 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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): 16, Positive cache size: 16, Positive conditional cache size: 6, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 23 TransitionsBefore, 23 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): 16, Positive cache size: 16, Positive conditional cache size: 6, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 38 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): 16, Positive cache size: 16, Positive conditional cache size: 6, Positive unconditional cache size: 10, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.1s, 82 PlacesBefore, 76 PlacesAfterwards, 101 TransitionsBefore, 95 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 10 ConcurrentYvCompositions, 0 ChoiceCompositions, 20 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 34, independent: 34, independent conditional: 34, 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: 27, independent: 27, independent conditional: 27, 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: 27, independent: 27, independent conditional: 0, independent unconditional: 27, 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: 34, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 100, Positive conditional cache size: 80, Positive unconditional cache size: 20, 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, 86 PlacesBefore, 85 PlacesAfterwards, 167 TransitionsBefore, 166 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 100, Positive conditional cache size: 80, Positive unconditional cache size: 20, 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, 94 PlacesBefore, 94 PlacesAfterwards, 205 TransitionsBefore, 205 TransitionsAfterwards, 380 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): 100, Positive cache size: 100, Positive conditional cache size: 80, Positive unconditional cache size: 20, 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.3s, 106 PlacesBefore, 106 PlacesAfterwards, 225 TransitionsBefore, 225 TransitionsAfterwards, 428 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): 101, Positive cache size: 101, Positive conditional cache size: 81, Positive unconditional cache size: 20, 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, 110 PlacesBefore, 110 PlacesAfterwards, 228 TransitionsBefore, 228 TransitionsAfterwards, 426 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): 101, Positive cache size: 101, Positive conditional cache size: 81, Positive unconditional cache size: 20, 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, 117 PlacesBefore, 117 PlacesAfterwards, 242 TransitionsBefore, 242 TransitionsAfterwards, 458 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): 101, Positive cache size: 101, Positive conditional cache size: 81, Positive unconditional cache size: 20, 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, 127 PlacesBefore, 127 PlacesAfterwards, 266 TransitionsBefore, 266 TransitionsAfterwards, 534 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): 101, Positive cache size: 101, Positive conditional cache size: 81, Positive unconditional cache size: 20, 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.6s, 144 PlacesBefore, 143 PlacesAfterwards, 307 TransitionsBefore, 306 TransitionsAfterwards, 622 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 10, independent: 6, independent conditional: 6, 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): 248, Positive cache size: 248, Positive conditional cache size: 228, Positive unconditional cache size: 20, 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: 4.8s, 152 PlacesBefore, 147 PlacesAfterwards, 376 TransitionsBefore, 371 TransitionsAfterwards, 522 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, independent: 95, independent conditional: 95, 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: 95, independent: 95, independent conditional: 95, 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: 95, independent: 95, independent conditional: 95, 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: 95, independent: 95, independent conditional: 95, 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: 95, independent: 92, independent conditional: 92, 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): 251, Positive cache size: 251, Positive conditional cache size: 231, Positive unconditional cache size: 20, 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, 161 PlacesBefore, 161 PlacesAfterwards, 412 TransitionsBefore, 412 TransitionsAfterwards, 614 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 288, Positive cache size: 288, Positive conditional cache size: 268, Positive unconditional cache size: 20, 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: 14.6s, 178 PlacesBefore, 177 PlacesAfterwards, 526 TransitionsBefore, 526 TransitionsAfterwards, 580 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 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: 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: 15, independent: 11, independent conditional: 11, 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): 303, Positive cache size: 303, Positive conditional cache size: 281, Positive unconditional cache size: 22, 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: 12.2s, 172 PlacesBefore, 172 PlacesAfterwards, 527 TransitionsBefore, 527 TransitionsAfterwards, 566 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 304, Positive conditional cache size: 282, Positive unconditional cache size: 22, 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, 177 PlacesBefore, 177 PlacesAfterwards, 541 TransitionsBefore, 541 TransitionsAfterwards, 562 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 304, Positive conditional cache size: 282, Positive unconditional cache size: 22, 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, 189 PlacesBefore, 188 PlacesAfterwards, 567 TransitionsBefore, 566 TransitionsAfterwards, 594 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 304, Positive conditional cache size: 282, Positive unconditional cache size: 22, 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, 199 PlacesBefore, 199 PlacesAfterwards, 582 TransitionsBefore, 582 TransitionsAfterwards, 602 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 304, Positive conditional cache size: 282, Positive unconditional cache size: 22, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 223 PlacesBefore, 223 PlacesAfterwards, 631 TransitionsBefore, 631 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 304, Positive conditional cache size: 282, Positive unconditional cache size: 22, 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, 239 PlacesBefore, 239 PlacesAfterwards, 653 TransitionsBefore, 653 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 304, Positive conditional cache size: 282, Positive unconditional cache size: 22, 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.7s, 273 PlacesBefore, 273 PlacesAfterwards, 791 TransitionsBefore, 791 TransitionsAfterwards, 782 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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: 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: 15, independent: 11, independent conditional: 11, 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): 374, Positive cache size: 374, Positive conditional cache size: 352, Positive unconditional cache size: 22, 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: 6.9s, 320 PlacesBefore, 316 PlacesAfterwards, 999 TransitionsBefore, 995 TransitionsAfterwards, 864 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 395, Positive cache size: 395, Positive conditional cache size: 373, Positive unconditional cache size: 22, 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: 5.3s, 345 PlacesBefore, 342 PlacesAfterwards, 1098 TransitionsBefore, 1095 TransitionsAfterwards, 904 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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: 42, 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: 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] , 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: 42, independent: 39, independent conditional: 39, 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): 442, Positive cache size: 442, Positive conditional cache size: 420, Positive unconditional cache size: 22, 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.7s, 356 PlacesBefore, 356 PlacesAfterwards, 1219 TransitionsBefore, 1219 TransitionsAfterwards, 1004 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 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: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 447, Positive cache size: 447, Positive conditional cache size: 424, Positive unconditional cache size: 23, 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: 14.0s, 372 PlacesBefore, 371 PlacesAfterwards, 1253 TransitionsBefore, 1252 TransitionsAfterwards, 1054 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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: 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: 4, independent: 1, independent conditional: 1, 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): 479, Positive cache size: 479, Positive conditional cache size: 456, Positive unconditional cache size: 23, 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, 377 PlacesBefore, 377 PlacesAfterwards, 1272 TransitionsBefore, 1272 TransitionsAfterwards, 1040 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 479, Positive cache size: 479, Positive conditional cache size: 456, Positive unconditional cache size: 23, 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, 384 PlacesBefore, 384 PlacesAfterwards, 1271 TransitionsBefore, 1271 TransitionsAfterwards, 1040 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): 479, Positive cache size: 479, Positive conditional cache size: 456, Positive unconditional cache size: 23, 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, 399 PlacesBefore, 399 PlacesAfterwards, 1933 TransitionsBefore, 1933 TransitionsAfterwards, 1554 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): 479, Positive cache size: 479, Positive conditional cache size: 456, Positive unconditional cache size: 23, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 392 PlacesBefore, 392 PlacesAfterwards, 1932 TransitionsBefore, 1932 TransitionsAfterwards, 1568 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 504, Positive cache size: 504, Positive conditional cache size: 481, Positive unconditional cache size: 23, 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: 15.4s, 415 PlacesBefore, 415 PlacesAfterwards, 2124 TransitionsBefore, 2124 TransitionsAfterwards, 1664 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, 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: 19, independent: 19, independent conditional: 19, 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: 19, independent: 19, independent conditional: 19, 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: 19, independent: 19, independent conditional: 19, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 19, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 582, Positive cache size: 582, Positive conditional cache size: 557, Positive unconditional cache size: 25, 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: 4.2s, 420 PlacesBefore, 420 PlacesAfterwards, 2129 TransitionsBefore, 2129 TransitionsAfterwards, 1672 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 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: 7, independent: 4, independent conditional: 4, 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): 640, Positive cache size: 640, Positive conditional cache size: 615, Positive unconditional cache size: 25, 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: 10.1s, 436 PlacesBefore, 436 PlacesAfterwards, 2153 TransitionsBefore, 2153 TransitionsAfterwards, 1726 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 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: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 648, Positive cache size: 648, Positive conditional cache size: 623, Positive unconditional cache size: 25, 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: 21.2s, 448 PlacesBefore, 448 PlacesAfterwards, 2162 TransitionsBefore, 2162 TransitionsAfterwards, 1760 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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): 658, Positive cache size: 658, Positive conditional cache size: 633, Positive unconditional cache size: 25, 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 - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (4states, 0/194 universal loopers) in iteration 41,while PetriNetUnfolder was constructing finite prefix that currently has 104591 conditions, 6080 events (3186/6079 cut-off events. For 564106/564106 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 53132 event pairs, 717 based on Foata normal form. 3/6361 useless extension candidates. Maximal degree in co-relation 104102. Up to 5727 conditions per place.). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (4states, 0/194 universal loopers) in iteration 41,while PetriNetUnfolder was constructing finite prefix that currently has 104591 conditions, 6080 events (3186/6079 cut-off events. For 564106/564106 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 53132 event pairs, 717 based on Foata normal form. 3/6361 useless extension candidates. Maximal degree in co-relation 104102. Up to 5727 conditions per place.). - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (4states, 0/194 universal loopers) in iteration 41,while PetriNetUnfolder was constructing finite prefix that currently has 104591 conditions, 6080 events (3186/6079 cut-off events. For 564106/564106 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 53132 event pairs, 717 based on Foata normal form. 3/6361 useless extension candidates. Maximal degree in co-relation 104102. Up to 5727 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 261 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: 811.7s, OverallIterations: 41, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 566.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 113 mSolverCounterUnknown, 3446 SdHoareTripleChecker+Valid, 386.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3446 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 380.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 15 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 3636 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25900 IncrementalHoareTripleChecker+Invalid, 29664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3636 mSolverCounterUnsat, 5 mSDtfsCounter, 25900 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1225 GetRequests, 602 SyntacticMatches, 26 SemanticMatches, 597 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2796 ImplicationChecksByTransitivity, 112.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71850occurred in iteration=40, InterpolantAutomatonStates: 497, 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, 3.3s SatisfiabilityAnalysisTime, 51.3s InterpolantComputationTime, 951 NumberOfCodeBlocks, 951 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 1256 ConstructedInterpolants, 40 QuantifiedInterpolants, 31813 SizeOfPredicates, 214 NumberOfNonLiveVariables, 6279 ConjunctsInSsa, 612 ConjunctsInUnsatCore, 103 InterpolantComputations, 10 PerfectInterpolantSequences, 41/262 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