/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:38:55,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:38:55,319 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:38:55,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:38:55,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:38:55,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:38:55,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:38:55,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:38:55,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:38:55,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:38:55,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:38:55,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:38:55,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:38:55,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:38:55,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:38:55,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:38:55,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:38:55,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:38:55,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:38:55,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:38:55,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:38:55,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:38:55,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:38:55,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:38:55,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:38:55,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:38:55,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:38:55,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:38:55,390 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:38:55,391 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:38:55,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:38:55,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:38:55,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:38:55,397 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:38:55,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:38:55,398 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:38:55,399 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:38:55,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:38:55,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:38:55,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:38:55,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:38:55,401 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:38:55,425 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:38:55,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:38:55,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:38:55,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:38:55,427 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:38:55,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:38:55,428 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:38:55,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:38:55,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:38:55,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:38:55,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:38:55,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:38:55,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:38:55,429 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:38:55,429 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:38:55,429 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:38:55,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:38:55,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:38:55,430 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:38:55,430 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:38:55,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:38:55,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:38:55,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:38:55,430 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:38:55,430 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:38:55,430 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:38:55,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:38:55,431 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:38:55,431 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 07:38:55,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:38:55,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:38:55,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:38:55,700 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:38:55,700 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:38:55,701 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2022-12-06 07:38:56,561 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:38:56,732 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:38:56,732 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2022-12-06 07:38:56,745 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c32d68732/92d798e9700842b6a58bcfd16713995f/FLAG76d5c1213 [2022-12-06 07:38:56,760 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c32d68732/92d798e9700842b6a58bcfd16713995f [2022-12-06 07:38:56,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:38:56,762 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:38:56,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:38:56,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:38:56,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:38:56,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:38:56" (1/1) ... [2022-12-06 07:38:56,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67614171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:56, skipping insertion in model container [2022-12-06 07:38:56,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:38:56" (1/1) ... [2022-12-06 07:38:56,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:38:56,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:38:56,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:56,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:56,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:56,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:56,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:56,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:56,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:56,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:56,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:56,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:56,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:56,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:56,944 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c[2835,2848] [2022-12-06 07:38:56,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:38:56,965 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:38:56,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:56,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:56,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:56,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:56,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:56,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:56,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:56,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:56,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:56,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:56,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:38:56,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:38:57,003 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c[2835,2848] [2022-12-06 07:38:57,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:38:57,019 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:38:57,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:57 WrapperNode [2022-12-06 07:38:57,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:38:57,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:38:57,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:38:57,020 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:38:57,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:57" (1/1) ... [2022-12-06 07:38:57,042 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:57" (1/1) ... [2022-12-06 07:38:57,079 INFO L138 Inliner]: procedures = 25, calls = 58, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 280 [2022-12-06 07:38:57,079 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:38:57,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:38:57,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:38:57,080 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:38:57,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:57" (1/1) ... [2022-12-06 07:38:57,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:57" (1/1) ... [2022-12-06 07:38:57,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:57" (1/1) ... [2022-12-06 07:38:57,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:57" (1/1) ... [2022-12-06 07:38:57,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:57" (1/1) ... [2022-12-06 07:38:57,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:57" (1/1) ... [2022-12-06 07:38:57,109 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:57" (1/1) ... [2022-12-06 07:38:57,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:57" (1/1) ... [2022-12-06 07:38:57,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:38:57,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:38:57,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:38:57,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:38:57,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:57" (1/1) ... [2022-12-06 07:38:57,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:38:57,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:38:57,144 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 07:38:57,146 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 07:38:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:38:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:38:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:38:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:38:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:38:57,169 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:38:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:38:57,169 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:38:57,169 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:38:57,170 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:38:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:38:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:38:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:38:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:38:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:38:57,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:38:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:38:57,171 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 07:38:57,242 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:38:57,243 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:38:57,602 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:38:57,802 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:38:57,802 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-06 07:38:57,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:38:57 BoogieIcfgContainer [2022-12-06 07:38:57,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:38:57,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:38:57,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:38:57,812 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:38:57,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:38:56" (1/3) ... [2022-12-06 07:38:57,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400701d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:38:57, skipping insertion in model container [2022-12-06 07:38:57,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:38:57" (2/3) ... [2022-12-06 07:38:57,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400701d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:38:57, skipping insertion in model container [2022-12-06 07:38:57,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:38:57" (3/3) ... [2022-12-06 07:38:57,814 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2022-12-06 07:38:57,828 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:38:57,828 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:38:57,829 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:38:57,896 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 07:38:57,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 179 transitions, 382 flow [2022-12-06 07:38:58,010 INFO L130 PetriNetUnfolder]: 16/176 cut-off events. [2022-12-06 07:38:58,010 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:38:58,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 176 events. 16/176 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 108 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 139. Up to 2 conditions per place. [2022-12-06 07:38:58,015 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 179 transitions, 382 flow [2022-12-06 07:38:58,021 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 166 transitions, 350 flow [2022-12-06 07:38:58,022 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:38:58,036 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 166 transitions, 350 flow [2022-12-06 07:38:58,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 166 transitions, 350 flow [2022-12-06 07:38:58,070 INFO L130 PetriNetUnfolder]: 16/166 cut-off events. [2022-12-06 07:38:58,070 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:38:58,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 166 events. 16/166 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 107 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 139. Up to 2 conditions per place. [2022-12-06 07:38:58,073 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 166 transitions, 350 flow [2022-12-06 07:38:58,073 INFO L188 LiptonReduction]: Number of co-enabled transitions 1518 [2022-12-06 07:39:03,777 INFO L203 LiptonReduction]: Total number of compositions: 138 [2022-12-06 07:39:03,787 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:39:03,797 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;@5d015855, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:39:03,797 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 07:39:03,803 INFO L130 PetriNetUnfolder]: 5/27 cut-off events. [2022-12-06 07:39:03,804 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:39:03,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:03,804 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:03,805 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:03,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:03,808 INFO L85 PathProgramCache]: Analyzing trace with hash 597230375, now seen corresponding path program 1 times [2022-12-06 07:39:03,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:03,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851580904] [2022-12-06 07:39:03,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:03,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:04,227 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 07:39:04,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:04,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851580904] [2022-12-06 07:39:04,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851580904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:39:04,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:39:04,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:39:04,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029026128] [2022-12-06 07:39:04,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:04,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:39:04,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:04,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:39:04,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:39:04,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 07:39:04,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:04,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:04,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 07:39:04,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:04,446 INFO L130 PetriNetUnfolder]: 620/871 cut-off events. [2022-12-06 07:39:04,446 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-06 07:39:04,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1816 conditions, 871 events. 620/871 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3409 event pairs, 95 based on Foata normal form. 1/577 useless extension candidates. Maximal degree in co-relation 1365. Up to 688 conditions per place. [2022-12-06 07:39:04,455 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 38 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2022-12-06 07:39:04,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 211 flow [2022-12-06 07:39:04,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:39:04,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:39:04,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 07:39:04,464 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2022-12-06 07:39:04,465 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 74 flow. Second operand 3 states and 53 transitions. [2022-12-06 07:39:04,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 46 transitions, 211 flow [2022-12-06 07:39:04,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 46 transitions, 189 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 07:39:04,471 INFO L231 Difference]: Finished difference. Result has 30 places, 31 transitions, 88 flow [2022-12-06 07:39:04,473 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=30, PETRI_TRANSITIONS=31} [2022-12-06 07:39:04,476 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, -3 predicate places. [2022-12-06 07:39:04,476 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:04,477 INFO L89 Accepts]: Start accepts. Operand has 30 places, 31 transitions, 88 flow [2022-12-06 07:39:04,479 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:04,480 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:04,481 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 31 transitions, 88 flow [2022-12-06 07:39:04,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 31 transitions, 88 flow [2022-12-06 07:39:04,496 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([796] thread3EXIT-->L103-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][29], [116#L103-2true, Black: 178#(= ~res2~0 ~res1~0), 176#true]) [2022-12-06 07:39:04,496 INFO L382 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-06 07:39:04,496 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 07:39:04,497 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 07:39:04,497 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 07:39:04,497 INFO L130 PetriNetUnfolder]: 24/74 cut-off events. [2022-12-06 07:39:04,497 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:39:04,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 74 events. 24/74 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 184 event pairs, 1 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 72. Up to 26 conditions per place. [2022-12-06 07:39:04,498 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 31 transitions, 88 flow [2022-12-06 07:39:04,498 INFO L188 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-06 07:39:04,505 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:39:04,506 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 07:39:04,506 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 31 transitions, 88 flow [2022-12-06 07:39:04,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:04,506 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:04,507 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:04,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:39:04,507 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:04,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:04,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1243665619, now seen corresponding path program 1 times [2022-12-06 07:39:04,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:04,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141501819] [2022-12-06 07:39:04,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:04,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:04,615 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 07:39:04,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:04,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141501819] [2022-12-06 07:39:04,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141501819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:39:04,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:39:04,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:39:04,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273847311] [2022-12-06 07:39:04,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:04,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:39:04,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:04,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:39:04,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:39:04,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 07:39:04,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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 07:39:04,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:04,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 07:39:04,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:04,730 INFO L130 PetriNetUnfolder]: 619/901 cut-off events. [2022-12-06 07:39:04,731 INFO L131 PetriNetUnfolder]: For 140/140 co-relation queries the response was YES. [2022-12-06 07:39:04,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2090 conditions, 901 events. 619/901 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3613 event pairs, 367 based on Foata normal form. 1/694 useless extension candidates. Maximal degree in co-relation 520. Up to 882 conditions per place. [2022-12-06 07:39:04,735 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 27 selfloop transitions, 4 changer transitions 1/34 dead transitions. [2022-12-06 07:39:04,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 158 flow [2022-12-06 07:39:04,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:39:04,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:39:04,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 07:39:04,736 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-06 07:39:04,736 INFO L175 Difference]: Start difference. First operand has 30 places, 31 transitions, 88 flow. Second operand 4 states and 40 transitions. [2022-12-06 07:39:04,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 158 flow [2022-12-06 07:39:04,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 154 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:39:04,738 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 110 flow [2022-12-06 07:39:04,738 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2022-12-06 07:39:04,738 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2022-12-06 07:39:04,738 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:04,738 INFO L89 Accepts]: Start accepts. Operand has 34 places, 33 transitions, 110 flow [2022-12-06 07:39:04,739 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:04,739 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:04,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 33 transitions, 110 flow [2022-12-06 07:39:04,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 33 transitions, 110 flow [2022-12-06 07:39:04,746 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([796] thread3EXIT-->L103-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][31], [116#L103-2true, Black: 178#(= ~res2~0 ~res1~0), 180#true, Black: 182#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 186#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))]) [2022-12-06 07:39:04,746 INFO L382 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-06 07:39:04,746 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-06 07:39:04,746 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 07:39:04,746 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 07:39:04,746 INFO L130 PetriNetUnfolder]: 24/76 cut-off events. [2022-12-06 07:39:04,746 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:39:04,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 76 events. 24/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 183 event pairs, 1 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 103. Up to 26 conditions per place. [2022-12-06 07:39:04,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 33 transitions, 110 flow [2022-12-06 07:39:04,747 INFO L188 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-06 07:39:04,748 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:39:04,749 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 07:39:04,749 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 110 flow [2022-12-06 07:39:04,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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 07:39:04,749 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:04,749 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:04,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:39:04,749 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:04,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:04,750 INFO L85 PathProgramCache]: Analyzing trace with hash -444556866, now seen corresponding path program 1 times [2022-12-06 07:39:04,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:04,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062977728] [2022-12-06 07:39:04,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:04,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 07:39:04,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:04,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062977728] [2022-12-06 07:39:04,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062977728] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:39:04,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005016824] [2022-12-06 07:39:04,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:04,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:39:04,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:39:04,887 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 07:39:04,921 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 07:39:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:05,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:39:05,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:39:05,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 07:39:05,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:39:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 07:39:05,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005016824] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 07:39:05,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 07:39:05,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2022-12-06 07:39:05,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184483577] [2022-12-06 07:39:05,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:05,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:39:05,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:05,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:39:05,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:39:05,163 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 07:39:05,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 110 flow. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 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 07:39:05,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:05,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 07:39:05,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:05,376 INFO L130 PetriNetUnfolder]: 891/1281 cut-off events. [2022-12-06 07:39:05,377 INFO L131 PetriNetUnfolder]: For 220/220 co-relation queries the response was YES. [2022-12-06 07:39:05,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2917 conditions, 1281 events. 891/1281 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5141 event pairs, 111 based on Foata normal form. 0/1118 useless extension candidates. Maximal degree in co-relation 2893. Up to 405 conditions per place. [2022-12-06 07:39:05,383 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 57 selfloop transitions, 19 changer transitions 0/77 dead transitions. [2022-12-06 07:39:05,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 77 transitions, 380 flow [2022-12-06 07:39:05,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:39:05,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:39:05,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-12-06 07:39:05,391 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-06 07:39:05,391 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 110 flow. Second operand 8 states and 77 transitions. [2022-12-06 07:39:05,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 77 transitions, 380 flow [2022-12-06 07:39:05,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 77 transitions, 368 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:39:05,398 INFO L231 Difference]: Finished difference. Result has 42 places, 43 transitions, 211 flow [2022-12-06 07:39:05,398 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=211, PETRI_PLACES=42, PETRI_TRANSITIONS=43} [2022-12-06 07:39:05,399 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2022-12-06 07:39:05,399 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:05,399 INFO L89 Accepts]: Start accepts. Operand has 42 places, 43 transitions, 211 flow [2022-12-06 07:39:05,401 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:05,401 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:05,402 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 43 transitions, 211 flow [2022-12-06 07:39:05,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 43 transitions, 211 flow [2022-12-06 07:39:05,414 INFO L130 PetriNetUnfolder]: 54/139 cut-off events. [2022-12-06 07:39:05,414 INFO L131 PetriNetUnfolder]: For 49/57 co-relation queries the response was YES. [2022-12-06 07:39:05,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 139 events. 54/139 cut-off events. For 49/57 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 488 event pairs, 3 based on Foata normal form. 3/136 useless extension candidates. Maximal degree in co-relation 324. Up to 46 conditions per place. [2022-12-06 07:39:05,416 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 43 transitions, 211 flow [2022-12-06 07:39:05,416 INFO L188 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-06 07:39:06,592 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:39:06,593 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1194 [2022-12-06 07:39:06,593 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 41 transitions, 201 flow [2022-12-06 07:39:06,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 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 07:39:06,593 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:06,593 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:06,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 07:39:06,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:39:06,794 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:06,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:06,795 INFO L85 PathProgramCache]: Analyzing trace with hash -681447277, now seen corresponding path program 1 times [2022-12-06 07:39:06,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:06,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861883303] [2022-12-06 07:39:06,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:06,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:06,891 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 07:39:06,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:06,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861883303] [2022-12-06 07:39:06,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861883303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:39:06,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:39:06,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:39:06,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207158028] [2022-12-06 07:39:06,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:06,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:39:06,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:06,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:39:06,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:39:06,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 07:39:06,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:06,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:06,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 07:39:06,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:07,033 INFO L130 PetriNetUnfolder]: 765/1133 cut-off events. [2022-12-06 07:39:07,034 INFO L131 PetriNetUnfolder]: For 1244/1314 co-relation queries the response was YES. [2022-12-06 07:39:07,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3588 conditions, 1133 events. 765/1133 cut-off events. For 1244/1314 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4315 event pairs, 250 based on Foata normal form. 123/1234 useless extension candidates. Maximal degree in co-relation 3561. Up to 850 conditions per place. [2022-12-06 07:39:07,040 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 55 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2022-12-06 07:39:07,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 63 transitions, 443 flow [2022-12-06 07:39:07,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:39:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:39:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 07:39:07,042 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41964285714285715 [2022-12-06 07:39:07,042 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 201 flow. Second operand 4 states and 47 transitions. [2022-12-06 07:39:07,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 63 transitions, 443 flow [2022-12-06 07:39:07,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 63 transitions, 430 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 07:39:07,048 INFO L231 Difference]: Finished difference. Result has 41 places, 42 transitions, 207 flow [2022-12-06 07:39:07,048 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=41, PETRI_TRANSITIONS=42} [2022-12-06 07:39:07,049 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2022-12-06 07:39:07,049 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:07,049 INFO L89 Accepts]: Start accepts. Operand has 41 places, 42 transitions, 207 flow [2022-12-06 07:39:07,050 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:07,050 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:07,050 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 42 transitions, 207 flow [2022-12-06 07:39:07,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 42 transitions, 207 flow [2022-12-06 07:39:07,060 INFO L130 PetriNetUnfolder]: 52/128 cut-off events. [2022-12-06 07:39:07,060 INFO L131 PetriNetUnfolder]: For 72/91 co-relation queries the response was YES. [2022-12-06 07:39:07,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 128 events. 52/128 cut-off events. For 72/91 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 402 event pairs, 4 based on Foata normal form. 5/128 useless extension candidates. Maximal degree in co-relation 317. Up to 45 conditions per place. [2022-12-06 07:39:07,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 42 transitions, 207 flow [2022-12-06 07:39:07,065 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-06 07:39:07,325 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:39:07,326 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 277 [2022-12-06 07:39:07,326 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 41 transitions, 204 flow [2022-12-06 07:39:07,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:07,326 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:07,326 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:07,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:39:07,327 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:07,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:07,327 INFO L85 PathProgramCache]: Analyzing trace with hash -137883018, now seen corresponding path program 1 times [2022-12-06 07:39:07,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:07,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443998923] [2022-12-06 07:39:07,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:07,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:07,980 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 07:39:07,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:07,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443998923] [2022-12-06 07:39:07,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443998923] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:39:07,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942409681] [2022-12-06 07:39:07,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:07,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:39:07,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:39:07,982 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 07:39:07,985 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 07:39:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:08,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-06 07:39:08,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:39:08,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 07:39:08,291 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-06 07:39:08,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 25 [2022-12-06 07:39:08,328 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 07:39:08,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:39:08,383 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:39:08,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 82 [2022-12-06 07:39:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:39:08,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942409681] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:39:08,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:39:08,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 21 [2022-12-06 07:39:08,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740846944] [2022-12-06 07:39:08,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:39:08,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 07:39:08,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:08,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 07:39:08,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2022-12-06 07:39:08,584 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 07:39:08,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 204 flow. Second operand has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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 07:39:08,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:08,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 07:39:08,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:10,319 INFO L130 PetriNetUnfolder]: 1643/2415 cut-off events. [2022-12-06 07:39:10,319 INFO L131 PetriNetUnfolder]: For 4003/4003 co-relation queries the response was YES. [2022-12-06 07:39:10,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8552 conditions, 2415 events. 1643/2415 cut-off events. For 4003/4003 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10198 event pairs, 242 based on Foata normal form. 19/2432 useless extension candidates. Maximal degree in co-relation 2665. Up to 1124 conditions per place. [2022-12-06 07:39:10,332 INFO L137 encePairwiseOnDemand]: 12/29 looper letters, 153 selfloop transitions, 88 changer transitions 2/243 dead transitions. [2022-12-06 07:39:10,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 243 transitions, 1630 flow [2022-12-06 07:39:10,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 07:39:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 07:39:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 226 transitions. [2022-12-06 07:39:10,337 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26872770511296074 [2022-12-06 07:39:10,337 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 204 flow. Second operand 29 states and 226 transitions. [2022-12-06 07:39:10,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 243 transitions, 1630 flow [2022-12-06 07:39:10,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 243 transitions, 1520 flow, removed 54 selfloop flow, removed 3 redundant places. [2022-12-06 07:39:10,345 INFO L231 Difference]: Finished difference. Result has 80 places, 128 transitions, 1015 flow [2022-12-06 07:39:10,346 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1015, PETRI_PLACES=80, PETRI_TRANSITIONS=128} [2022-12-06 07:39:10,347 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 47 predicate places. [2022-12-06 07:39:10,347 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:10,347 INFO L89 Accepts]: Start accepts. Operand has 80 places, 128 transitions, 1015 flow [2022-12-06 07:39:10,349 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:10,349 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:10,349 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 128 transitions, 1015 flow [2022-12-06 07:39:10,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 128 transitions, 1015 flow [2022-12-06 07:39:10,379 INFO L130 PetriNetUnfolder]: 161/397 cut-off events. [2022-12-06 07:39:10,379 INFO L131 PetriNetUnfolder]: For 959/985 co-relation queries the response was YES. [2022-12-06 07:39:10,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1420 conditions, 397 events. 161/397 cut-off events. For 959/985 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1898 event pairs, 7 based on Foata normal form. 7/396 useless extension candidates. Maximal degree in co-relation 1288. Up to 146 conditions per place. [2022-12-06 07:39:10,382 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 128 transitions, 1015 flow [2022-12-06 07:39:10,382 INFO L188 LiptonReduction]: Number of co-enabled transitions 822 [2022-12-06 07:39:10,503 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] $Ultimate##0-->L74-4: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_1| v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2#1] and [966] $Ultimate##0-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_~b#1_21|))) (and (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_21| 0) (<= .cse0 2147483647)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (< 0 v_~N~0_113) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| |v_thread1Thread1of1ForFork2_plus_#res#1_21|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483647) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483648)) (= (+ (select (select |v_#memory_int_218| v_~B~0.base_102) v_~B~0.offset_102) (select (select |v_#memory_int_218| v_~A~0.base_106) v_~A~0.offset_106)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (= |v_thread1Thread1of1ForFork2_~i~0#1_44| 1) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (= v_~res1~0_85 |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= |v_thread1Thread1of1ForFork2_plus_~b#1_21| |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| v_~res1~0_84) (= |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_21|))) InVars {~res1~0=v_~res1~0_85, ~A~0.base=v_~A~0.base_106, ~B~0.base=v_~B~0.base_102, ~A~0.offset=v_~A~0.offset_106, #memory_int=|v_#memory_int_218|, ~N~0=v_~N~0_113, ~B~0.offset=v_~B~0.offset_102} OutVars{~res1~0=v_~res1~0_84, ~A~0.base=v_~A~0.base_106, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_21|, ~B~0.base=v_~B~0.base_102, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_21|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_23|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_21|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_21|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_21|, ~N~0=v_~N~0_113, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_21|, ~A~0.offset=v_~A~0.offset_106, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_44|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_21|, #memory_int=|v_#memory_int_218|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_21|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_21|, ~B~0.offset=v_~B~0.offset_102, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:39:10,624 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] $Ultimate##0-->L74-4: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_1| v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2#1] and [766] $Ultimate##0-->L61-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] [2022-12-06 07:39:11,498 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [968] $Ultimate##0-->L77: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_21| |v_thread3Thread1of1ForFork1_plus_~b#1_21|))) (and (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_21| 0) (<= .cse0 2147483647)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_21| 2147483648)) (= (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_51| 4))) (+ (select (select |v_#memory_int_226| v_~A~0.base_111) (+ .cse1 v_~A~0.offset_111)) (select (select |v_#memory_int_226| v_~B~0.base_107) (+ .cse1 v_~B~0.offset_107)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_21|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_21| v_~res2~0_115) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_31| 2147483648)) (= |v_thread3Thread1of1ForFork1_~i~2#1_51| v_~M~0_75) (< |v_thread3Thread1of1ForFork1_~i~2#1_51| v_~N~0_117) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_21| |v_thread3Thread1of1ForFork1_plus_~a#1_21|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_21| 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_21|) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_21| |v_thread3Thread1of1ForFork1_plus_~b#1_21|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_31| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#res#1_21| |v_thread3Thread1of1ForFork1_~tmp~2#1_31|))) InVars {~A~0.base=v_~A~0.base_111, ~B~0.base=v_~B~0.base_107, ~A~0.offset=v_~A~0.offset_111, ~M~0=v_~M~0_75, #memory_int=|v_#memory_int_226|, ~N~0=v_~N~0_117, ~B~0.offset=v_~B~0.offset_107, ~res2~0=v_~res2~0_115} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~A~0.base=v_~A~0.base_111, ~B~0.base=v_~B~0.base_107, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_21|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_21|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_21|, ~N~0=v_~N~0_117, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_21|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_51|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_21|, ~A~0.offset=v_~A~0.offset_111, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_31|, ~M~0=v_~M~0_75, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_21|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_21|, #memory_int=|v_#memory_int_226|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_21|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_21|, ~B~0.offset=v_~B~0.offset_107, ~res2~0=v_~res2~0_115} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1] and [966] $Ultimate##0-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_~b#1_21|))) (and (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_21| 0) (<= .cse0 2147483647)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (< 0 v_~N~0_113) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| |v_thread1Thread1of1ForFork2_plus_#res#1_21|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483647) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483648)) (= (+ (select (select |v_#memory_int_218| v_~B~0.base_102) v_~B~0.offset_102) (select (select |v_#memory_int_218| v_~A~0.base_106) v_~A~0.offset_106)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (= |v_thread1Thread1of1ForFork2_~i~0#1_44| 1) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (= v_~res1~0_85 |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= |v_thread1Thread1of1ForFork2_plus_~b#1_21| |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| v_~res1~0_84) (= |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_21|))) InVars {~res1~0=v_~res1~0_85, ~A~0.base=v_~A~0.base_106, ~B~0.base=v_~B~0.base_102, ~A~0.offset=v_~A~0.offset_106, #memory_int=|v_#memory_int_218|, ~N~0=v_~N~0_113, ~B~0.offset=v_~B~0.offset_102} OutVars{~res1~0=v_~res1~0_84, ~A~0.base=v_~A~0.base_106, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_21|, ~B~0.base=v_~B~0.base_102, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_21|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_23|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_21|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_21|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_21|, ~N~0=v_~N~0_113, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_21|, ~A~0.offset=v_~A~0.offset_106, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_44|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_21|, #memory_int=|v_#memory_int_218|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_21|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_21|, ~B~0.offset=v_~B~0.offset_102, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:39:11,808 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [968] $Ultimate##0-->L77: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_21| |v_thread3Thread1of1ForFork1_plus_~b#1_21|))) (and (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_21| 0) (<= .cse0 2147483647)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_21| 2147483648)) (= (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_51| 4))) (+ (select (select |v_#memory_int_226| v_~A~0.base_111) (+ .cse1 v_~A~0.offset_111)) (select (select |v_#memory_int_226| v_~B~0.base_107) (+ .cse1 v_~B~0.offset_107)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_21|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_21| v_~res2~0_115) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_31| 2147483648)) (= |v_thread3Thread1of1ForFork1_~i~2#1_51| v_~M~0_75) (< |v_thread3Thread1of1ForFork1_~i~2#1_51| v_~N~0_117) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_21| |v_thread3Thread1of1ForFork1_plus_~a#1_21|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_21| 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_21|) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_21| |v_thread3Thread1of1ForFork1_plus_~b#1_21|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_31| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#res#1_21| |v_thread3Thread1of1ForFork1_~tmp~2#1_31|))) InVars {~A~0.base=v_~A~0.base_111, ~B~0.base=v_~B~0.base_107, ~A~0.offset=v_~A~0.offset_111, ~M~0=v_~M~0_75, #memory_int=|v_#memory_int_226|, ~N~0=v_~N~0_117, ~B~0.offset=v_~B~0.offset_107, ~res2~0=v_~res2~0_115} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~A~0.base=v_~A~0.base_111, ~B~0.base=v_~B~0.base_107, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_21|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_21|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_21|, ~N~0=v_~N~0_117, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_21|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_51|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_21|, ~A~0.offset=v_~A~0.offset_111, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_31|, ~M~0=v_~M~0_75, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_21|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_21|, #memory_int=|v_#memory_int_226|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_21|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_21|, ~B~0.offset=v_~B~0.offset_107, ~res2~0=v_~res2~0_115} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1] and [766] $Ultimate##0-->L61-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] [2022-12-06 07:39:11,935 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:11,936 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:11,936 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:11,936 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:11,936 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:11,936 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:11,936 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:11,936 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:12,332 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [966] $Ultimate##0-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_~b#1_21|))) (and (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_21| 0) (<= .cse0 2147483647)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (< 0 v_~N~0_113) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| |v_thread1Thread1of1ForFork2_plus_#res#1_21|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483647) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483648)) (= (+ (select (select |v_#memory_int_218| v_~B~0.base_102) v_~B~0.offset_102) (select (select |v_#memory_int_218| v_~A~0.base_106) v_~A~0.offset_106)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (= |v_thread1Thread1of1ForFork2_~i~0#1_44| 1) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (= v_~res1~0_85 |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= |v_thread1Thread1of1ForFork2_plus_~b#1_21| |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| v_~res1~0_84) (= |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_21|))) InVars {~res1~0=v_~res1~0_85, ~A~0.base=v_~A~0.base_106, ~B~0.base=v_~B~0.base_102, ~A~0.offset=v_~A~0.offset_106, #memory_int=|v_#memory_int_218|, ~N~0=v_~N~0_113, ~B~0.offset=v_~B~0.offset_102} OutVars{~res1~0=v_~res1~0_84, ~A~0.base=v_~A~0.base_106, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_21|, ~B~0.base=v_~B~0.base_102, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_21|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_23|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_21|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_21|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_21|, ~N~0=v_~N~0_113, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_21|, ~A~0.offset=v_~A~0.offset_106, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_44|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_21|, #memory_int=|v_#memory_int_218|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_21|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_21|, ~B~0.offset=v_~B~0.offset_102, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] and [915] L77-->L74-4: Formula: (and (= |v_thread3Thread1of1ForFork1_~i~2#1_29| (+ |v_thread3Thread1of1ForFork1_~i~2#1_30| 1)) (= v_~res2~0_79 |v_thread3Thread1of1ForFork1_~tmp~2#1_17|)) InVars {thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_30|} OutVars{thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_17|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_29|, ~res2~0=v_~res2~0_79} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_~i~2#1, ~res2~0] [2022-12-06 07:39:12,598 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [847] L74-4-->L77: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|))) (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_5| 0)) 1 0)) (= v_~res2~0_47 |v_thread3Thread1of1ForFork1_plus_#in~a#1_5|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483647) (= (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_17| 4))) (+ (select (select |v_#memory_int_88| v_~B~0.base_42) (+ .cse1 v_~B~0.offset_42)) (select (select |v_#memory_int_88| v_~A~0.base_44) (+ .cse1 v_~A~0.offset_44)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_5|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_5|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_5| |v_thread3Thread1of1ForFork1_plus_~a#1_5|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_5| |v_thread3Thread1of1ForFork1_~tmp~2#1_7|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|) (< |v_thread3Thread1of1ForFork1_~i~2#1_17| v_~N~0_20))) InVars {~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, ~A~0.offset=v_~A~0.offset_44, #memory_int=|v_#memory_int_88|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_5|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_5|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_5|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_5|, ~A~0.offset=v_~A~0.offset_44, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_7|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_5|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_5|, #memory_int=|v_#memory_int_88|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_5|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1] and [966] $Ultimate##0-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_~b#1_21|))) (and (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_21| 0) (<= .cse0 2147483647)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (< 0 v_~N~0_113) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| |v_thread1Thread1of1ForFork2_plus_#res#1_21|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483647) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483648)) (= (+ (select (select |v_#memory_int_218| v_~B~0.base_102) v_~B~0.offset_102) (select (select |v_#memory_int_218| v_~A~0.base_106) v_~A~0.offset_106)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (= |v_thread1Thread1of1ForFork2_~i~0#1_44| 1) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (= v_~res1~0_85 |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= |v_thread1Thread1of1ForFork2_plus_~b#1_21| |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| v_~res1~0_84) (= |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_21|))) InVars {~res1~0=v_~res1~0_85, ~A~0.base=v_~A~0.base_106, ~B~0.base=v_~B~0.base_102, ~A~0.offset=v_~A~0.offset_106, #memory_int=|v_#memory_int_218|, ~N~0=v_~N~0_113, ~B~0.offset=v_~B~0.offset_102} OutVars{~res1~0=v_~res1~0_84, ~A~0.base=v_~A~0.base_106, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_21|, ~B~0.base=v_~B~0.base_102, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_21|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_23|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_21|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_21|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_21|, ~N~0=v_~N~0_113, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_21|, ~A~0.offset=v_~A~0.offset_106, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_44|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_21|, #memory_int=|v_#memory_int_218|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_21|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_21|, ~B~0.offset=v_~B~0.offset_102, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:39:12,890 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [847] L74-4-->L77: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|))) (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_5| 0)) 1 0)) (= v_~res2~0_47 |v_thread3Thread1of1ForFork1_plus_#in~a#1_5|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483647) (= (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_17| 4))) (+ (select (select |v_#memory_int_88| v_~B~0.base_42) (+ .cse1 v_~B~0.offset_42)) (select (select |v_#memory_int_88| v_~A~0.base_44) (+ .cse1 v_~A~0.offset_44)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_5|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_5|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_5| |v_thread3Thread1of1ForFork1_plus_~a#1_5|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_5| |v_thread3Thread1of1ForFork1_~tmp~2#1_7|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|) (< |v_thread3Thread1of1ForFork1_~i~2#1_17| v_~N~0_20))) InVars {~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, ~A~0.offset=v_~A~0.offset_44, #memory_int=|v_#memory_int_88|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_5|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_5|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_5|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_5|, ~A~0.offset=v_~A~0.offset_44, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_7|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_5|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_5|, #memory_int=|v_#memory_int_88|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_5|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1] and [766] $Ultimate##0-->L61-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] [2022-12-06 07:39:13,035 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] $Ultimate##0-->L74-4: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_1| v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2#1] and [966] $Ultimate##0-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_~b#1_21|))) (and (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_21| 0) (<= .cse0 2147483647)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (< 0 v_~N~0_113) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| |v_thread1Thread1of1ForFork2_plus_#res#1_21|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483647) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483648)) (= (+ (select (select |v_#memory_int_218| v_~B~0.base_102) v_~B~0.offset_102) (select (select |v_#memory_int_218| v_~A~0.base_106) v_~A~0.offset_106)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (= |v_thread1Thread1of1ForFork2_~i~0#1_44| 1) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (= v_~res1~0_85 |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= |v_thread1Thread1of1ForFork2_plus_~b#1_21| |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| v_~res1~0_84) (= |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_21|))) InVars {~res1~0=v_~res1~0_85, ~A~0.base=v_~A~0.base_106, ~B~0.base=v_~B~0.base_102, ~A~0.offset=v_~A~0.offset_106, #memory_int=|v_#memory_int_218|, ~N~0=v_~N~0_113, ~B~0.offset=v_~B~0.offset_102} OutVars{~res1~0=v_~res1~0_84, ~A~0.base=v_~A~0.base_106, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_21|, ~B~0.base=v_~B~0.base_102, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_21|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_23|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_21|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_21|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_21|, ~N~0=v_~N~0_113, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_21|, ~A~0.offset=v_~A~0.offset_106, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_44|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_21|, #memory_int=|v_#memory_int_218|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_21|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_21|, ~B~0.offset=v_~B~0.offset_102, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:39:13,618 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] $Ultimate##0-->L74-4: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_1| v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2#1] and [766] $Ultimate##0-->L61-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] [2022-12-06 07:39:13,753 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [959] L61-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_In_3| v_~M~0_In_6)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0)) InVars {~M~0=v_~M~0_In_6, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_3|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, ~M~0=v_~M~0_In_6, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset] and [915] L77-->L74-4: Formula: (and (= |v_thread3Thread1of1ForFork1_~i~2#1_29| (+ |v_thread3Thread1of1ForFork1_~i~2#1_30| 1)) (= v_~res2~0_79 |v_thread3Thread1of1ForFork1_~tmp~2#1_17|)) InVars {thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_30|} OutVars{thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_17|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_29|, ~res2~0=v_~res2~0_79} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_~i~2#1, ~res2~0] [2022-12-06 07:39:13,792 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [959] L61-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_In_3| v_~M~0_In_6)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0)) InVars {~M~0=v_~M~0_In_6, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_3|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, ~M~0=v_~M~0_In_6, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset] and [966] $Ultimate##0-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_~b#1_21|))) (and (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_21| 0) (<= .cse0 2147483647)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (< 0 v_~N~0_113) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| |v_thread1Thread1of1ForFork2_plus_#res#1_21|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483647) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483648)) (= (+ (select (select |v_#memory_int_218| v_~B~0.base_102) v_~B~0.offset_102) (select (select |v_#memory_int_218| v_~A~0.base_106) v_~A~0.offset_106)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (= |v_thread1Thread1of1ForFork2_~i~0#1_44| 1) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (= v_~res1~0_85 |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= |v_thread1Thread1of1ForFork2_plus_~b#1_21| |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| v_~res1~0_84) (= |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_21|))) InVars {~res1~0=v_~res1~0_85, ~A~0.base=v_~A~0.base_106, ~B~0.base=v_~B~0.base_102, ~A~0.offset=v_~A~0.offset_106, #memory_int=|v_#memory_int_218|, ~N~0=v_~N~0_113, ~B~0.offset=v_~B~0.offset_102} OutVars{~res1~0=v_~res1~0_84, ~A~0.base=v_~A~0.base_106, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_21|, ~B~0.base=v_~B~0.base_102, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_21|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_23|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_21|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_21|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_21|, ~N~0=v_~N~0_113, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_21|, ~A~0.offset=v_~A~0.offset_106, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_44|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_21|, #memory_int=|v_#memory_int_218|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_21|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_21|, ~B~0.offset=v_~B~0.offset_102, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:39:13,966 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [959] L61-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_In_3| v_~M~0_In_6)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0)) InVars {~M~0=v_~M~0_In_6, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_3|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, ~M~0=v_~M~0_In_6, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset] and [847] L74-4-->L77: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|))) (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_5| 0)) 1 0)) (= v_~res2~0_47 |v_thread3Thread1of1ForFork1_plus_#in~a#1_5|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483647) (= (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_17| 4))) (+ (select (select |v_#memory_int_88| v_~B~0.base_42) (+ .cse1 v_~B~0.offset_42)) (select (select |v_#memory_int_88| v_~A~0.base_44) (+ .cse1 v_~A~0.offset_44)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_5|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_5|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_5| |v_thread3Thread1of1ForFork1_plus_~a#1_5|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_5| |v_thread3Thread1of1ForFork1_~tmp~2#1_7|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|) (< |v_thread3Thread1of1ForFork1_~i~2#1_17| v_~N~0_20))) InVars {~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, ~A~0.offset=v_~A~0.offset_44, #memory_int=|v_#memory_int_88|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_5|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_5|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_5|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_5|, ~A~0.offset=v_~A~0.offset_44, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_7|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_5|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_5|, #memory_int=|v_#memory_int_88|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_5|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1] [2022-12-06 07:39:14,301 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [989] L61-4-->L77: Formula: (let ((.cse1 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_41| |v_thread3Thread1of1ForFork1_plus_~b#1_41|))) (and (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_55| 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|) (< |v_thread3Thread1of1ForFork1_~i~2#1_93| v_~N~0_162) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_41| (let ((.cse0 (* |v_thread3Thread1of1ForFork1_~i~2#1_93| 4))) (+ (select (select |v_#memory_int_286| v_~B~0.base_148) (+ v_~B~0.offset_150 .cse0)) (select (select |v_#memory_int_286| v_~A~0.base_154) (+ .cse0 v_~A~0.offset_156))))) (= |v_thread3Thread1of1ForFork1_plus_#res#1_41| |v_thread3Thread1of1ForFork1_~tmp~2#1_55|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_41| 2147483647) (= |v_thread2Thread1of1ForFork0_#res#1.base_19| 0) (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_41| 0) (<= .cse1 2147483647)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_55| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_41| |v_thread3Thread1of1ForFork1_plus_~b#1_41|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_41| |v_thread3Thread1of1ForFork1_plus_~a#1_41|) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_71| v_~M~0_107)) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_41| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_41| .cse1) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_41| v_~res2~0_151) (= |v_thread2Thread1of1ForFork0_#res#1.offset_19| 0))) InVars {~A~0.base=v_~A~0.base_154, ~B~0.base=v_~B~0.base_148, ~A~0.offset=v_~A~0.offset_156, ~M~0=v_~M~0_107, #memory_int=|v_#memory_int_286|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_71|, ~N~0=v_~N~0_162, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_93|, ~B~0.offset=v_~B~0.offset_150, ~res2~0=v_~res2~0_151} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|, ~A~0.base=v_~A~0.base_154, ~B~0.base=v_~B~0.base_148, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_41|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_19|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_41|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_41|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_71|, ~N~0=v_~N~0_162, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_41|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_93|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_41|, ~A~0.offset=v_~A~0.offset_156, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_55|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_19|, ~M~0=v_~M~0_107, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_41|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_41|, #memory_int=|v_#memory_int_286|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_41|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_41|, ~B~0.offset=v_~B~0.offset_150, ~res2~0=v_~res2~0_151} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread2Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1] and [977] $Ultimate##0-->L48-4: Formula: (let ((.cse3 (select |v_#memory_int_266| v_~A~0.base_134)) (.cse5 (select |v_#memory_int_266| v_~B~0.base_128))) (let ((.cse1 (select .cse5 v_~B~0.offset_130)) (.cse2 (select .cse3 v_~A~0.offset_136))) (let ((.cse0 (+ .cse1 v_~res1~0_125 .cse2)) (.cse6 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_40| |v_thread1Thread1of1ForFork2_plus_~b#1_40|))) (and (= |v_thread1Thread1of1ForFork2_~i~0#1_67| 2) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_40| .cse0) (<= (+ .cse1 .cse2) 2147483647) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_42| |v_thread1Thread1of1ForFork2_plus_#res#1_40|) (= (let ((.cse4 (* |v_thread1Thread1of1ForFork2_~i~0#1_67| 4))) (+ (select .cse3 (+ .cse4 v_~A~0.offset_136 (- 4))) (select .cse5 (+ .cse4 v_~B~0.offset_130 (- 4))))) |v_thread1Thread1of1ForFork2_plus_#in~b#1_40|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_40| 2147483647) (= |v_thread1Thread1of1ForFork2_plus_~b#1_40| |v_thread1Thread1of1ForFork2_plus_#in~b#1_40|) (< |v_thread1Thread1of1ForFork2_~i~0#1_67| (+ v_~N~0_142 1)) (= |v_thread1Thread1of1ForFork2_plus_~a#1_40| |v_thread1Thread1of1ForFork2_plus_#in~a#1_40|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_40| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_40|) (<= .cse0 2147483647) (= .cse6 |v_thread1Thread1of1ForFork2_plus_#res#1_40|) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_42| v_~res1~0_123) (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_40| 0) (<= .cse6 2147483647)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_40|) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_42| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_40| 2147483648)) (<= 0 (+ .cse1 v_~res1~0_125 .cse2 2147483648)) (<= 0 (+ .cse1 .cse2 2147483648)) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_42| 2147483648)))))) InVars {~res1~0=v_~res1~0_125, ~A~0.base=v_~A~0.base_134, ~B~0.base=v_~B~0.base_128, ~A~0.offset=v_~A~0.offset_136, #memory_int=|v_#memory_int_266|, ~N~0=v_~N~0_142, ~B~0.offset=v_~B~0.offset_130} OutVars{~res1~0=v_~res1~0_123, ~A~0.base=v_~A~0.base_134, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_40|, ~B~0.base=v_~B~0.base_128, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_40|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_42|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_40|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_40|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_40|, ~N~0=v_~N~0_142, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_40|, ~A~0.offset=v_~A~0.offset_136, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_67|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_40|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_40|, #memory_int=|v_#memory_int_266|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_40|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_40|, ~B~0.offset=v_~B~0.offset_130, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_40|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_40|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:39:14,780 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [989] L61-4-->L77: Formula: (let ((.cse1 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_41| |v_thread3Thread1of1ForFork1_plus_~b#1_41|))) (and (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_55| 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|) (< |v_thread3Thread1of1ForFork1_~i~2#1_93| v_~N~0_162) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_41| (let ((.cse0 (* |v_thread3Thread1of1ForFork1_~i~2#1_93| 4))) (+ (select (select |v_#memory_int_286| v_~B~0.base_148) (+ v_~B~0.offset_150 .cse0)) (select (select |v_#memory_int_286| v_~A~0.base_154) (+ .cse0 v_~A~0.offset_156))))) (= |v_thread3Thread1of1ForFork1_plus_#res#1_41| |v_thread3Thread1of1ForFork1_~tmp~2#1_55|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_41| 2147483647) (= |v_thread2Thread1of1ForFork0_#res#1.base_19| 0) (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_41| 0) (<= .cse1 2147483647)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_55| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_41| |v_thread3Thread1of1ForFork1_plus_~b#1_41|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_41| |v_thread3Thread1of1ForFork1_plus_~a#1_41|) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_71| v_~M~0_107)) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_41| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_41| .cse1) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_41| v_~res2~0_151) (= |v_thread2Thread1of1ForFork0_#res#1.offset_19| 0))) InVars {~A~0.base=v_~A~0.base_154, ~B~0.base=v_~B~0.base_148, ~A~0.offset=v_~A~0.offset_156, ~M~0=v_~M~0_107, #memory_int=|v_#memory_int_286|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_71|, ~N~0=v_~N~0_162, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_93|, ~B~0.offset=v_~B~0.offset_150, ~res2~0=v_~res2~0_151} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|, ~A~0.base=v_~A~0.base_154, ~B~0.base=v_~B~0.base_148, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_41|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_19|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_41|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_41|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_71|, ~N~0=v_~N~0_162, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_41|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_93|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_41|, ~A~0.offset=v_~A~0.offset_156, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_55|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_19|, ~M~0=v_~M~0_107, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_41|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_41|, #memory_int=|v_#memory_int_286|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_41|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_41|, ~B~0.offset=v_~B~0.offset_150, ~res2~0=v_~res2~0_151} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread2Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1] and [978] $Ultimate##0-->L74-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_44| |v_thread1Thread1of1ForFork2_plus_~b#1_44|))) (and (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_46| 2147483647) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_46| |v_thread1Thread1of1ForFork2_plus_#res#1_44|) (= |v_thread1Thread1of1ForFork2_~i~0#1_71| 1) (= |v_thread1Thread1of1ForFork2_plus_#res#1_44| .cse0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_44| (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_44| 0) (<= .cse0 2147483647)) 1 0)) (= v_~res2~0_131 |v_thread3Thread1of1ForFork1_~tmp~2#1_39|) (= (+ (select (select |v_#memory_int_268| v_~A~0.base_136) v_~A~0.offset_138) (select (select |v_#memory_int_268| v_~B~0.base_130) v_~B~0.offset_132)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_44|) (= |v_thread1Thread1of1ForFork2_plus_~b#1_44| |v_thread1Thread1of1ForFork2_plus_#in~b#1_44|) (< 0 v_~N~0_144) (= v_~res1~0_130 |v_thread1Thread1of1ForFork2_plus_#in~a#1_44|) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_46| v_~res1~0_129) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_46| 2147483648)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_44| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_44|) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_44| 2147483648)) (= |v_thread1Thread1of1ForFork2_plus_~a#1_44| |v_thread1Thread1of1ForFork2_plus_#in~a#1_44|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_44| 2147483647) (= (+ |v_thread3Thread1of1ForFork1_~i~2#1_66| 1) |v_thread3Thread1of1ForFork1_~i~2#1_65|))) InVars {~res1~0=v_~res1~0_130, ~A~0.base=v_~A~0.base_136, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_39|, ~B~0.base=v_~B~0.base_130, ~A~0.offset=v_~A~0.offset_138, #memory_int=|v_#memory_int_268|, ~N~0=v_~N~0_144, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_66|, ~B~0.offset=v_~B~0.offset_132} OutVars{~res1~0=v_~res1~0_129, ~A~0.base=v_~A~0.base_136, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_44|, ~B~0.base=v_~B~0.base_130, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_44|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_44|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_44|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_65|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_44|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_39|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_44|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_44|, ~B~0.offset=v_~B~0.offset_132, ~res2~0=v_~res2~0_131, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_44|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_46|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_44|, ~N~0=v_~N~0_144, ~A~0.offset=v_~A~0.offset_138, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_71|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_44|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_44|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_26|, #memory_int=|v_#memory_int_268|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_44|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork1_~i~2#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread3Thread1of1ForFork1_#t~post11#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, ~res2~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:39:15,173 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 07:39:15,174 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4827 [2022-12-06 07:39:15,174 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 120 transitions, 1049 flow [2022-12-06 07:39:15,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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 07:39:15,174 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:15,174 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:15,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 07:39:15,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:39:15,377 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:15,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:15,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1255937729, now seen corresponding path program 1 times [2022-12-06 07:39:15,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:15,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002209886] [2022-12-06 07:39:15,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:15,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:15,965 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 07:39:15,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:15,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002209886] [2022-12-06 07:39:15,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002209886] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:39:15,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080004849] [2022-12-06 07:39:15,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:15,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:39:15,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:39:15,967 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 07:39:15,969 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 07:39:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:16,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-06 07:39:16,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:39:16,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 07:39:16,208 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-06 07:39:16,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 25 [2022-12-06 07:39:16,227 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 07:39:16,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:39:16,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:39:16,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 82 [2022-12-06 07:39:16,430 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 07:39:16,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080004849] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:39:16,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:39:16,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2022-12-06 07:39:16,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941569885] [2022-12-06 07:39:16,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:39:16,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:39:16,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:16,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:39:16,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-12-06 07:39:16,432 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-06 07:39:16,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 120 transitions, 1049 flow. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 07:39:16,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:16,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-06 07:39:16,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:17,862 INFO L130 PetriNetUnfolder]: 3772/5521 cut-off events. [2022-12-06 07:39:17,862 INFO L131 PetriNetUnfolder]: For 23600/23737 co-relation queries the response was YES. [2022-12-06 07:39:17,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24288 conditions, 5521 events. 3772/5521 cut-off events. For 23600/23737 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 28923 event pairs, 414 based on Foata normal form. 113/5607 useless extension candidates. Maximal degree in co-relation 22023. Up to 2183 conditions per place. [2022-12-06 07:39:17,894 INFO L137 encePairwiseOnDemand]: 20/46 looper letters, 226 selfloop transitions, 174 changer transitions 3/411 dead transitions. [2022-12-06 07:39:17,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 411 transitions, 3646 flow [2022-12-06 07:39:17,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 07:39:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 07:39:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 309 transitions. [2022-12-06 07:39:17,896 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30533596837944665 [2022-12-06 07:39:17,896 INFO L175 Difference]: Start difference. First operand has 72 places, 120 transitions, 1049 flow. Second operand 22 states and 309 transitions. [2022-12-06 07:39:17,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 411 transitions, 3646 flow [2022-12-06 07:39:18,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 411 transitions, 3331 flow, removed 142 selfloop flow, removed 6 redundant places. [2022-12-06 07:39:18,008 INFO L231 Difference]: Finished difference. Result has 89 places, 235 transitions, 2396 flow [2022-12-06 07:39:18,008 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2396, PETRI_PLACES=89, PETRI_TRANSITIONS=235} [2022-12-06 07:39:18,008 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 56 predicate places. [2022-12-06 07:39:18,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:18,009 INFO L89 Accepts]: Start accepts. Operand has 89 places, 235 transitions, 2396 flow [2022-12-06 07:39:18,010 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:18,010 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:18,010 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 235 transitions, 2396 flow [2022-12-06 07:39:18,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 235 transitions, 2396 flow [2022-12-06 07:39:18,069 INFO L130 PetriNetUnfolder]: 314/789 cut-off events. [2022-12-06 07:39:18,070 INFO L131 PetriNetUnfolder]: For 1940/2017 co-relation queries the response was YES. [2022-12-06 07:39:18,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3115 conditions, 789 events. 314/789 cut-off events. For 1940/2017 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5054 event pairs, 18 based on Foata normal form. 10/782 useless extension candidates. Maximal degree in co-relation 2839. Up to 234 conditions per place. [2022-12-06 07:39:18,076 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 235 transitions, 2396 flow [2022-12-06 07:39:18,076 INFO L188 LiptonReduction]: Number of co-enabled transitions 1992 [2022-12-06 07:39:22,061 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:39:22,061 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4053 [2022-12-06 07:39:22,061 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 234 transitions, 2394 flow [2022-12-06 07:39:22,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 07:39:22,062 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:22,062 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:22,067 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 07:39:22,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:39:22,267 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:22,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:22,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1243259432, now seen corresponding path program 1 times [2022-12-06 07:39:22,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:22,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898995160] [2022-12-06 07:39:22,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:22,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:22,796 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 07:39:22,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:22,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898995160] [2022-12-06 07:39:22,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898995160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:39:22,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:39:22,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:39:22,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744153354] [2022-12-06 07:39:22,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:22,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:39:22,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:22,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:39:22,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:39:22,797 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 07:39:22,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 234 transitions, 2394 flow. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:22,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:22,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 07:39:22,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:23,696 INFO L130 PetriNetUnfolder]: 4120/6025 cut-off events. [2022-12-06 07:39:23,696 INFO L131 PetriNetUnfolder]: For 29991/30142 co-relation queries the response was YES. [2022-12-06 07:39:23,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28621 conditions, 6025 events. 4120/6025 cut-off events. For 29991/30142 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 32253 event pairs, 1355 based on Foata normal form. 116/6073 useless extension candidates. Maximal degree in co-relation 26611. Up to 5402 conditions per place. [2022-12-06 07:39:23,731 INFO L137 encePairwiseOnDemand]: 22/42 looper letters, 229 selfloop transitions, 65 changer transitions 4/306 dead transitions. [2022-12-06 07:39:23,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 306 transitions, 3486 flow [2022-12-06 07:39:23,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:39:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:39:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2022-12-06 07:39:23,733 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36607142857142855 [2022-12-06 07:39:23,733 INFO L175 Difference]: Start difference. First operand has 88 places, 234 transitions, 2394 flow. Second operand 8 states and 123 transitions. [2022-12-06 07:39:23,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 306 transitions, 3486 flow [2022-12-06 07:39:23,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 306 transitions, 3390 flow, removed 48 selfloop flow, removed 0 redundant places. [2022-12-06 07:39:23,808 INFO L231 Difference]: Finished difference. Result has 99 places, 254 transitions, 2724 flow [2022-12-06 07:39:23,808 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2298, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2724, PETRI_PLACES=99, PETRI_TRANSITIONS=254} [2022-12-06 07:39:23,809 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 66 predicate places. [2022-12-06 07:39:23,809 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:23,809 INFO L89 Accepts]: Start accepts. Operand has 99 places, 254 transitions, 2724 flow [2022-12-06 07:39:23,810 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:23,810 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:23,810 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 254 transitions, 2724 flow [2022-12-06 07:39:23,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 254 transitions, 2724 flow [2022-12-06 07:39:23,893 INFO L130 PetriNetUnfolder]: 354/869 cut-off events. [2022-12-06 07:39:23,893 INFO L131 PetriNetUnfolder]: For 2547/2633 co-relation queries the response was YES. [2022-12-06 07:39:23,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3628 conditions, 869 events. 354/869 cut-off events. For 2547/2633 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5672 event pairs, 19 based on Foata normal form. 9/858 useless extension candidates. Maximal degree in co-relation 3596. Up to 265 conditions per place. [2022-12-06 07:39:23,901 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 254 transitions, 2724 flow [2022-12-06 07:39:23,902 INFO L188 LiptonReduction]: Number of co-enabled transitions 2148 [2022-12-06 07:39:23,903 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:39:23,903 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 07:39:23,904 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 254 transitions, 2724 flow [2022-12-06 07:39:23,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:23,904 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:23,904 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:23,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 07:39:23,904 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:23,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:23,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1981175882, now seen corresponding path program 1 times [2022-12-06 07:39:23,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:23,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138613411] [2022-12-06 07:39:23,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:23,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:24,643 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 07:39:24,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:24,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138613411] [2022-12-06 07:39:24,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138613411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:39:24,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:39:24,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 07:39:24,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260527767] [2022-12-06 07:39:24,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:24,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:39:24,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:24,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:39:24,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:39:24,645 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 07:39:24,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 254 transitions, 2724 flow. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:24,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:24,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 07:39:24,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:25,857 INFO L130 PetriNetUnfolder]: 4406/6472 cut-off events. [2022-12-06 07:39:25,858 INFO L131 PetriNetUnfolder]: For 32323/32323 co-relation queries the response was YES. [2022-12-06 07:39:25,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31700 conditions, 6472 events. 4406/6472 cut-off events. For 32323/32323 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 34193 event pairs, 1074 based on Foata normal form. 1/6472 useless extension candidates. Maximal degree in co-relation 31666. Up to 4573 conditions per place. [2022-12-06 07:39:25,890 INFO L137 encePairwiseOnDemand]: 19/41 looper letters, 191 selfloop transitions, 166 changer transitions 3/360 dead transitions. [2022-12-06 07:39:25,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 360 transitions, 4181 flow [2022-12-06 07:39:25,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:39:25,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:39:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 154 transitions. [2022-12-06 07:39:25,891 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28893058161350843 [2022-12-06 07:39:25,891 INFO L175 Difference]: Start difference. First operand has 97 places, 254 transitions, 2724 flow. Second operand 13 states and 154 transitions. [2022-12-06 07:39:25,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 360 transitions, 4181 flow [2022-12-06 07:39:26,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 360 transitions, 4128 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 07:39:26,014 INFO L231 Difference]: Finished difference. Result has 114 places, 290 transitions, 3720 flow [2022-12-06 07:39:26,014 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2675, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3720, PETRI_PLACES=114, PETRI_TRANSITIONS=290} [2022-12-06 07:39:26,016 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 81 predicate places. [2022-12-06 07:39:26,016 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:26,016 INFO L89 Accepts]: Start accepts. Operand has 114 places, 290 transitions, 3720 flow [2022-12-06 07:39:26,018 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:26,018 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:26,018 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 290 transitions, 3720 flow [2022-12-06 07:39:26,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 290 transitions, 3720 flow [2022-12-06 07:39:26,101 INFO L130 PetriNetUnfolder]: 384/951 cut-off events. [2022-12-06 07:39:26,102 INFO L131 PetriNetUnfolder]: For 4458/4574 co-relation queries the response was YES. [2022-12-06 07:39:26,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4763 conditions, 951 events. 384/951 cut-off events. For 4458/4574 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6407 event pairs, 25 based on Foata normal form. 13/945 useless extension candidates. Maximal degree in co-relation 4512. Up to 282 conditions per place. [2022-12-06 07:39:26,110 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 290 transitions, 3720 flow [2022-12-06 07:39:26,110 INFO L188 LiptonReduction]: Number of co-enabled transitions 2316 [2022-12-06 07:39:26,111 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [986] $Ultimate##0-->L61-4: Formula: (let ((.cse1 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_39| |v_thread3Thread1of1ForFork1_plus_~b#1_39|))) (and (= |v_thread2Thread1of1ForFork0_~i~1#1_65| 0) (= (let ((.cse0 (* |v_thread3Thread1of1ForFork1_~i~2#1_87| 4))) (+ (select (select |v_#memory_int_282| v_~B~0.base_144) (+ v_~B~0.offset_146 .cse0)) (select (select |v_#memory_int_282| v_~A~0.base_150) (+ v_~A~0.offset_152 .cse0)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_39|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_51| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_39| |v_thread3Thread1of1ForFork1_plus_~a#1_39|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_39| |v_thread3Thread1of1ForFork1_~tmp~2#1_51|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_51| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_39| v_~res2~0_147) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_39| |v_thread3Thread1of1ForFork1_plus_~b#1_39|) (< |v_thread3Thread1of1ForFork1_~i~2#1_87| v_~N~0_158) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_39| 2147483647) (= v_~M~0_101 |v_thread3Thread1of1ForFork1_~i~2#1_87|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39| (ite (or (<= .cse1 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_39| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_39| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_39| .cse1))) InVars {~A~0.base=v_~A~0.base_150, ~B~0.base=v_~B~0.base_144, ~A~0.offset=v_~A~0.offset_152, ~M~0=v_~M~0_101, #memory_int=|v_#memory_int_282|, ~N~0=v_~N~0_158, ~B~0.offset=v_~B~0.offset_146, ~res2~0=v_~res2~0_147} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|, ~A~0.base=v_~A~0.base_150, ~B~0.base=v_~B~0.base_144, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_39|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_39|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_39|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_65|, ~N~0=v_~N~0_158, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_39|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_87|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_39|, ~A~0.offset=v_~A~0.offset_152, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_51|, ~M~0=v_~M~0_101, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_39|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_39|, #memory_int=|v_#memory_int_282|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_39|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_39|, ~B~0.offset=v_~B~0.offset_146, ~res2~0=v_~res2~0_147} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork0_~i~1#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1] and [966] $Ultimate##0-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_~b#1_21|))) (and (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_21| 0) (<= .cse0 2147483647)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (< 0 v_~N~0_113) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| |v_thread1Thread1of1ForFork2_plus_#res#1_21|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483647) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483648)) (= (+ (select (select |v_#memory_int_218| v_~B~0.base_102) v_~B~0.offset_102) (select (select |v_#memory_int_218| v_~A~0.base_106) v_~A~0.offset_106)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (= |v_thread1Thread1of1ForFork2_~i~0#1_44| 1) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (= v_~res1~0_85 |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= |v_thread1Thread1of1ForFork2_plus_~b#1_21| |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| v_~res1~0_84) (= |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_21|))) InVars {~res1~0=v_~res1~0_85, ~A~0.base=v_~A~0.base_106, ~B~0.base=v_~B~0.base_102, ~A~0.offset=v_~A~0.offset_106, #memory_int=|v_#memory_int_218|, ~N~0=v_~N~0_113, ~B~0.offset=v_~B~0.offset_102} OutVars{~res1~0=v_~res1~0_84, ~A~0.base=v_~A~0.base_106, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_21|, ~B~0.base=v_~B~0.base_102, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_21|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_23|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_21|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_21|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_21|, ~N~0=v_~N~0_113, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_21|, ~A~0.offset=v_~A~0.offset_106, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_44|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_21|, #memory_int=|v_#memory_int_218|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_21|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_21|, ~B~0.offset=v_~B~0.offset_102, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:39:26,545 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [847] L74-4-->L77: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|))) (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_5| 0)) 1 0)) (= v_~res2~0_47 |v_thread3Thread1of1ForFork1_plus_#in~a#1_5|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483647) (= (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_17| 4))) (+ (select (select |v_#memory_int_88| v_~B~0.base_42) (+ .cse1 v_~B~0.offset_42)) (select (select |v_#memory_int_88| v_~A~0.base_44) (+ .cse1 v_~A~0.offset_44)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_5|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_5|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_5| |v_thread3Thread1of1ForFork1_plus_~a#1_5|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_5| |v_thread3Thread1of1ForFork1_~tmp~2#1_7|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|) (< |v_thread3Thread1of1ForFork1_~i~2#1_17| v_~N~0_20))) InVars {~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, ~A~0.offset=v_~A~0.offset_44, #memory_int=|v_#memory_int_88|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_5|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_5|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_5|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_5|, ~A~0.offset=v_~A~0.offset_44, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_7|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_5|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_5|, #memory_int=|v_#memory_int_88|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_5|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1] and [967] $Ultimate##0-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_23| |v_thread1Thread1of1ForFork2_plus_~b#1_23|))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23| (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_23| 0)) 1 0)) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_23| 2147483647) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_23|) (= v_~res1~0_89 |v_thread1Thread1of1ForFork2_plus_#in~a#1_23|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_25| 2147483648)) (= |v_thread1Thread1of1ForFork2_plus_~b#1_23| |v_thread1Thread1of1ForFork2_plus_#in~b#1_23|) (= (+ (select (select |v_#memory_int_220| v_~B~0.base_104) v_~B~0.offset_104) (select (select |v_#memory_int_220| v_~A~0.base_108) v_~A~0.offset_108)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_23|) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_25| 2147483647) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= |v_thread1Thread1of1ForFork2_~i~0#1_48| 1) (< 0 v_~N~0_115) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_25| |v_thread1Thread1of1ForFork2_plus_#res#1_23|) (= |v_thread1Thread1of1ForFork2_plus_~a#1_23| |v_thread1Thread1of1ForFork2_plus_#in~a#1_23|) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_23| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_25| v_~res1~0_88))) InVars {~res1~0=v_~res1~0_89, ~A~0.base=v_~A~0.base_108, ~B~0.base=v_~B~0.base_104, ~A~0.offset=v_~A~0.offset_108, #memory_int=|v_#memory_int_220|, ~N~0=v_~N~0_115, ~B~0.offset=v_~B~0.offset_104} OutVars{~res1~0=v_~res1~0_88, ~A~0.base=v_~A~0.base_108, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_23|, ~B~0.base=v_~B~0.base_104, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_23|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_25|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_23|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_23|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_23|, ~N~0=v_~N~0_115, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_23|, ~A~0.offset=v_~A~0.offset_108, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_48|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_23|, #memory_int=|v_#memory_int_220|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_23|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_23|, ~B~0.offset=v_~B~0.offset_104, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_23|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:39:26,831 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [847] L74-4-->L77: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|))) (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_5| 0)) 1 0)) (= v_~res2~0_47 |v_thread3Thread1of1ForFork1_plus_#in~a#1_5|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483647) (= (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_17| 4))) (+ (select (select |v_#memory_int_88| v_~B~0.base_42) (+ .cse1 v_~B~0.offset_42)) (select (select |v_#memory_int_88| v_~A~0.base_44) (+ .cse1 v_~A~0.offset_44)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_5|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_5|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_5| |v_thread3Thread1of1ForFork1_plus_~a#1_5|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_5| |v_thread3Thread1of1ForFork1_~tmp~2#1_7|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|) (< |v_thread3Thread1of1ForFork1_~i~2#1_17| v_~N~0_20))) InVars {~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, ~A~0.offset=v_~A~0.offset_44, #memory_int=|v_#memory_int_88|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_5|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_5|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_5|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_5|, ~A~0.offset=v_~A~0.offset_44, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_7|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_5|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_5|, #memory_int=|v_#memory_int_88|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_5|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1] and [931] L64-->L61-4: Formula: (and (= v_~res2~0_86 |v_thread2Thread1of1ForFork0_~tmp~1#1_23|) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_30| 1) |v_thread2Thread1of1ForFork0_~i~1#1_29|)) InVars {thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_23|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_30|} OutVars{thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_23|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_29|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_19|, ~res2~0=v_~res2~0_86} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post6#1, ~res2~0] [2022-12-06 07:39:26,953 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [847] L74-4-->L77: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|))) (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_5| 0)) 1 0)) (= v_~res2~0_47 |v_thread3Thread1of1ForFork1_plus_#in~a#1_5|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483647) (= (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_17| 4))) (+ (select (select |v_#memory_int_88| v_~B~0.base_42) (+ .cse1 v_~B~0.offset_42)) (select (select |v_#memory_int_88| v_~A~0.base_44) (+ .cse1 v_~A~0.offset_44)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_5|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_5|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_5| |v_thread3Thread1of1ForFork1_plus_~a#1_5|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_5| |v_thread3Thread1of1ForFork1_~tmp~2#1_7|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|) (< |v_thread3Thread1of1ForFork1_~i~2#1_17| v_~N~0_20))) InVars {~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, ~A~0.offset=v_~A~0.offset_44, #memory_int=|v_#memory_int_88|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_5|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_5|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_5|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_5|, ~A~0.offset=v_~A~0.offset_44, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_7|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_5|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_5|, #memory_int=|v_#memory_int_88|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_5|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1] and [959] L61-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_In_3| v_~M~0_In_6)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0)) InVars {~M~0=v_~M~0_In_6, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_3|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, ~M~0=v_~M~0_In_6, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset] [2022-12-06 07:39:27,124 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [915] L77-->L74-4: Formula: (and (= |v_thread3Thread1of1ForFork1_~i~2#1_29| (+ |v_thread3Thread1of1ForFork1_~i~2#1_30| 1)) (= v_~res2~0_79 |v_thread3Thread1of1ForFork1_~tmp~2#1_17|)) InVars {thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_30|} OutVars{thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_17|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_29|, ~res2~0=v_~res2~0_79} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_~i~2#1, ~res2~0] and [967] $Ultimate##0-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_23| |v_thread1Thread1of1ForFork2_plus_~b#1_23|))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23| (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_23| 0)) 1 0)) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_23| 2147483647) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_23|) (= v_~res1~0_89 |v_thread1Thread1of1ForFork2_plus_#in~a#1_23|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_25| 2147483648)) (= |v_thread1Thread1of1ForFork2_plus_~b#1_23| |v_thread1Thread1of1ForFork2_plus_#in~b#1_23|) (= (+ (select (select |v_#memory_int_220| v_~B~0.base_104) v_~B~0.offset_104) (select (select |v_#memory_int_220| v_~A~0.base_108) v_~A~0.offset_108)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_23|) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_25| 2147483647) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= |v_thread1Thread1of1ForFork2_~i~0#1_48| 1) (< 0 v_~N~0_115) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_25| |v_thread1Thread1of1ForFork2_plus_#res#1_23|) (= |v_thread1Thread1of1ForFork2_plus_~a#1_23| |v_thread1Thread1of1ForFork2_plus_#in~a#1_23|) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_23| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_25| v_~res1~0_88))) InVars {~res1~0=v_~res1~0_89, ~A~0.base=v_~A~0.base_108, ~B~0.base=v_~B~0.base_104, ~A~0.offset=v_~A~0.offset_108, #memory_int=|v_#memory_int_220|, ~N~0=v_~N~0_115, ~B~0.offset=v_~B~0.offset_104} OutVars{~res1~0=v_~res1~0_88, ~A~0.base=v_~A~0.base_108, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_23|, ~B~0.base=v_~B~0.base_104, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_23|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_25|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_23|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_23|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_23|, ~N~0=v_~N~0_115, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_23|, ~A~0.offset=v_~A~0.offset_108, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_48|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_23|, #memory_int=|v_#memory_int_220|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_23|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_23|, ~B~0.offset=v_~B~0.offset_104, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_23|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:39:27,838 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [915] L77-->L74-4: Formula: (and (= |v_thread3Thread1of1ForFork1_~i~2#1_29| (+ |v_thread3Thread1of1ForFork1_~i~2#1_30| 1)) (= v_~res2~0_79 |v_thread3Thread1of1ForFork1_~tmp~2#1_17|)) InVars {thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_30|} OutVars{thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_17|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_29|, ~res2~0=v_~res2~0_79} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_~i~2#1, ~res2~0] and [959] L61-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_Out_4| 0) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_In_3| v_~M~0_In_6)) (= |v_thread2Thread1of1ForFork0_#res#1.base_Out_4| 0)) InVars {~M~0=v_~M~0_In_6, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_3|} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_In_3|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_Out_4|, ~M~0=v_~M~0_In_6, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset] [2022-12-06 07:39:27,893 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [985] $Ultimate##0-->L61-4: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_63| 0) (= |v_thread3Thread1of1ForFork1_~i~2#1_85| v_~M~0_99)) InVars {~M~0=v_~M~0_99} OutVars{~M~0=v_~M~0_99, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_63|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_85|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread3Thread1of1ForFork1_~i~2#1] and [966] $Ultimate##0-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_~b#1_21|))) (and (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_21| 0) (<= .cse0 2147483647)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (< 0 v_~N~0_113) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| |v_thread1Thread1of1ForFork2_plus_#res#1_21|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483647) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483648)) (= (+ (select (select |v_#memory_int_218| v_~B~0.base_102) v_~B~0.offset_102) (select (select |v_#memory_int_218| v_~A~0.base_106) v_~A~0.offset_106)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (= |v_thread1Thread1of1ForFork2_~i~0#1_44| 1) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (= v_~res1~0_85 |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= |v_thread1Thread1of1ForFork2_plus_~b#1_21| |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| v_~res1~0_84) (= |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_21|))) InVars {~res1~0=v_~res1~0_85, ~A~0.base=v_~A~0.base_106, ~B~0.base=v_~B~0.base_102, ~A~0.offset=v_~A~0.offset_106, #memory_int=|v_#memory_int_218|, ~N~0=v_~N~0_113, ~B~0.offset=v_~B~0.offset_102} OutVars{~res1~0=v_~res1~0_84, ~A~0.base=v_~A~0.base_106, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_21|, ~B~0.base=v_~B~0.base_102, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_21|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_23|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_21|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_21|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_21|, ~N~0=v_~N~0_113, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_21|, ~A~0.offset=v_~A~0.offset_106, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_44|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_21|, #memory_int=|v_#memory_int_218|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_21|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_21|, ~B~0.offset=v_~B~0.offset_102, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:39:28,007 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [985] $Ultimate##0-->L61-4: Formula: (and (= |v_thread2Thread1of1ForFork0_~i~1#1_63| 0) (= |v_thread3Thread1of1ForFork1_~i~2#1_85| v_~M~0_99)) InVars {~M~0=v_~M~0_99} OutVars{~M~0=v_~M~0_99, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_63|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_85|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread3Thread1of1ForFork1_~i~2#1] and [847] L74-4-->L77: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|))) (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_5| 0)) 1 0)) (= v_~res2~0_47 |v_thread3Thread1of1ForFork1_plus_#in~a#1_5|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483647) (= (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_17| 4))) (+ (select (select |v_#memory_int_88| v_~B~0.base_42) (+ .cse1 v_~B~0.offset_42)) (select (select |v_#memory_int_88| v_~A~0.base_44) (+ .cse1 v_~A~0.offset_44)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_5|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_5|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_5| |v_thread3Thread1of1ForFork1_plus_~a#1_5|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_5| |v_thread3Thread1of1ForFork1_~tmp~2#1_7|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|) (< |v_thread3Thread1of1ForFork1_~i~2#1_17| v_~N~0_20))) InVars {~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, ~A~0.offset=v_~A~0.offset_44, #memory_int=|v_#memory_int_88|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_5|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_5|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_5|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_5|, ~A~0.offset=v_~A~0.offset_44, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_7|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_5|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_5|, #memory_int=|v_#memory_int_88|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_5|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1] [2022-12-06 07:39:28,145 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 07:39:28,146 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2130 [2022-12-06 07:39:28,146 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 289 transitions, 3820 flow [2022-12-06 07:39:28,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:28,146 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:28,146 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:28,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 07:39:28,147 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:28,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:28,147 INFO L85 PathProgramCache]: Analyzing trace with hash 79245884, now seen corresponding path program 1 times [2022-12-06 07:39:28,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:28,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696721668] [2022-12-06 07:39:28,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:28,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:28,836 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 07:39:28,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:28,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696721668] [2022-12-06 07:39:28,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696721668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:39:28,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:39:28,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:39:28,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73149117] [2022-12-06 07:39:28,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:28,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:39:28,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:28,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:39:28,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:39:28,838 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 51 [2022-12-06 07:39:28,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 289 transitions, 3820 flow. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:28,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:28,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 51 [2022-12-06 07:39:28,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:29,953 INFO L130 PetriNetUnfolder]: 4509/6611 cut-off events. [2022-12-06 07:39:29,953 INFO L131 PetriNetUnfolder]: For 57931/58108 co-relation queries the response was YES. [2022-12-06 07:39:29,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38598 conditions, 6611 events. 4509/6611 cut-off events. For 57931/58108 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 36313 event pairs, 1533 based on Foata normal form. 126/6681 useless extension candidates. Maximal degree in co-relation 36290. Up to 6078 conditions per place. [2022-12-06 07:39:29,991 INFO L137 encePairwiseOnDemand]: 21/51 looper letters, 269 selfloop transitions, 81 changer transitions 4/363 dead transitions. [2022-12-06 07:39:29,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 363 transitions, 5116 flow [2022-12-06 07:39:29,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:39:29,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:39:29,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2022-12-06 07:39:29,992 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2784313725490196 [2022-12-06 07:39:29,992 INFO L175 Difference]: Start difference. First operand has 113 places, 289 transitions, 3820 flow. Second operand 10 states and 142 transitions. [2022-12-06 07:39:29,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 363 transitions, 5116 flow [2022-12-06 07:39:30,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 363 transitions, 5014 flow, removed 44 selfloop flow, removed 2 redundant places. [2022-12-06 07:39:30,131 INFO L231 Difference]: Finished difference. Result has 124 places, 312 transitions, 4289 flow [2022-12-06 07:39:30,131 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=3708, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4289, PETRI_PLACES=124, PETRI_TRANSITIONS=312} [2022-12-06 07:39:30,132 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 91 predicate places. [2022-12-06 07:39:30,132 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:30,132 INFO L89 Accepts]: Start accepts. Operand has 124 places, 312 transitions, 4289 flow [2022-12-06 07:39:30,133 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:30,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:30,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 312 transitions, 4289 flow [2022-12-06 07:39:30,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 312 transitions, 4289 flow [2022-12-06 07:39:30,233 INFO L130 PetriNetUnfolder]: 423/1061 cut-off events. [2022-12-06 07:39:30,233 INFO L131 PetriNetUnfolder]: For 5450/5550 co-relation queries the response was YES. [2022-12-06 07:39:30,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5472 conditions, 1061 events. 423/1061 cut-off events. For 5450/5550 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7496 event pairs, 24 based on Foata normal form. 9/1051 useless extension candidates. Maximal degree in co-relation 5216. Up to 316 conditions per place. [2022-12-06 07:39:30,244 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 312 transitions, 4289 flow [2022-12-06 07:39:30,244 INFO L188 LiptonReduction]: Number of co-enabled transitions 2448 [2022-12-06 07:39:30,245 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [986] $Ultimate##0-->L61-4: Formula: (let ((.cse1 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_39| |v_thread3Thread1of1ForFork1_plus_~b#1_39|))) (and (= |v_thread2Thread1of1ForFork0_~i~1#1_65| 0) (= (let ((.cse0 (* |v_thread3Thread1of1ForFork1_~i~2#1_87| 4))) (+ (select (select |v_#memory_int_282| v_~B~0.base_144) (+ v_~B~0.offset_146 .cse0)) (select (select |v_#memory_int_282| v_~A~0.base_150) (+ v_~A~0.offset_152 .cse0)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_39|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_51| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_39| |v_thread3Thread1of1ForFork1_plus_~a#1_39|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_39| |v_thread3Thread1of1ForFork1_~tmp~2#1_51|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_51| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_39| v_~res2~0_147) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_39| |v_thread3Thread1of1ForFork1_plus_~b#1_39|) (< |v_thread3Thread1of1ForFork1_~i~2#1_87| v_~N~0_158) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_39| 2147483647) (= v_~M~0_101 |v_thread3Thread1of1ForFork1_~i~2#1_87|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39| (ite (or (<= .cse1 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_39| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_39| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_39| .cse1))) InVars {~A~0.base=v_~A~0.base_150, ~B~0.base=v_~B~0.base_144, ~A~0.offset=v_~A~0.offset_152, ~M~0=v_~M~0_101, #memory_int=|v_#memory_int_282|, ~N~0=v_~N~0_158, ~B~0.offset=v_~B~0.offset_146, ~res2~0=v_~res2~0_147} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|, ~A~0.base=v_~A~0.base_150, ~B~0.base=v_~B~0.base_144, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_39|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_39|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_39|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_65|, ~N~0=v_~N~0_158, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_39|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_87|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_39|, ~A~0.offset=v_~A~0.offset_152, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_51|, ~M~0=v_~M~0_101, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_39|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_39|, #memory_int=|v_#memory_int_282|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_39|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_39|, ~B~0.offset=v_~B~0.offset_146, ~res2~0=v_~res2~0_147} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork0_~i~1#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1] and [1006] L77-->thread2EXIT: Formula: (and (= (+ |v_thread3Thread1of1ForFork1_~i~2#1_156| 1) |v_thread3Thread1of1ForFork1_~i~2#1_155|) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_106| v_~M~0_138)) (= v_~res2~0_211 |v_thread3Thread1of1ForFork1_~tmp~2#1_100|) (= |v_thread2Thread1of1ForFork0_#res#1.base_33| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_33| 0)) InVars {thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_100|, ~M~0=v_~M~0_138, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_106|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_156|} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_33|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_100|, ~M~0=v_~M~0_138, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_33|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_59|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_106|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_155|, ~res2~0=v_~res2~0_211} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_~i~2#1, ~res2~0] [2022-12-06 07:39:30,404 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [986] $Ultimate##0-->L61-4: Formula: (let ((.cse1 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_39| |v_thread3Thread1of1ForFork1_plus_~b#1_39|))) (and (= |v_thread2Thread1of1ForFork0_~i~1#1_65| 0) (= (let ((.cse0 (* |v_thread3Thread1of1ForFork1_~i~2#1_87| 4))) (+ (select (select |v_#memory_int_282| v_~B~0.base_144) (+ v_~B~0.offset_146 .cse0)) (select (select |v_#memory_int_282| v_~A~0.base_150) (+ v_~A~0.offset_152 .cse0)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_39|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_51| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_39| |v_thread3Thread1of1ForFork1_plus_~a#1_39|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_39| |v_thread3Thread1of1ForFork1_~tmp~2#1_51|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_51| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_39| v_~res2~0_147) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_39| |v_thread3Thread1of1ForFork1_plus_~b#1_39|) (< |v_thread3Thread1of1ForFork1_~i~2#1_87| v_~N~0_158) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_39| 2147483647) (= v_~M~0_101 |v_thread3Thread1of1ForFork1_~i~2#1_87|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39| (ite (or (<= .cse1 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_39| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_39| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_39| .cse1))) InVars {~A~0.base=v_~A~0.base_150, ~B~0.base=v_~B~0.base_144, ~A~0.offset=v_~A~0.offset_152, ~M~0=v_~M~0_101, #memory_int=|v_#memory_int_282|, ~N~0=v_~N~0_158, ~B~0.offset=v_~B~0.offset_146, ~res2~0=v_~res2~0_147} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|, ~A~0.base=v_~A~0.base_150, ~B~0.base=v_~B~0.base_144, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_39|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_39|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_39|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_65|, ~N~0=v_~N~0_158, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_39|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_87|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_39|, ~A~0.offset=v_~A~0.offset_152, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_51|, ~M~0=v_~M~0_101, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_39|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_39|, #memory_int=|v_#memory_int_282|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_39|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_39|, ~B~0.offset=v_~B~0.offset_146, ~res2~0=v_~res2~0_147} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork0_~i~1#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1] and [1005] L77-->thread2EXIT: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_74| |v_thread3Thread1of1ForFork1_plus_~b#1_74|))) (and (= (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_74| 0)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_74|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_74| |v_thread3Thread1of1ForFork1_plus_~a#1_74|) (= v_~res2~0_209 |v_thread3Thread1of1ForFork1_~tmp~2#1_97|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_74| v_~res2~0_209) (= |v_thread3Thread1of1ForFork1_plus_#res#1_74| |v_thread3Thread1of1ForFork1_~tmp~2#1_96|) (= |v_thread3Thread1of1ForFork1_~i~2#1_151| (+ |v_thread3Thread1of1ForFork1_~i~2#1_152| 1)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_74| |v_thread3Thread1of1ForFork1_plus_~b#1_74|) (< |v_thread3Thread1of1ForFork1_~i~2#1_151| v_~N~0_204) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_74| (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_151| 4))) (+ (select (select |v_#memory_int_348| v_~B~0.base_192) (+ .cse1 v_~B~0.offset_194)) (select (select |v_#memory_int_348| v_~A~0.base_200) (+ .cse1 v_~A~0.offset_202))))) (= |v_thread3Thread1of1ForFork1_plus_#res#1_74| .cse0) (= |v_thread2Thread1of1ForFork0_#res#1.base_31| 0) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_74| 2147483648)) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_104| v_~M~0_136)) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_74| 2147483647) (= |v_thread2Thread1of1ForFork0_#res#1.offset_31| 0) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_96| 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_74| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_74|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_96| 2147483648)))) InVars {~A~0.base=v_~A~0.base_200, ~B~0.base=v_~B~0.base_192, ~A~0.offset=v_~A~0.offset_202, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_97|, ~M~0=v_~M~0_136, #memory_int=|v_#memory_int_348|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_104|, ~N~0=v_~N~0_204, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_152|, ~B~0.offset=v_~B~0.offset_194} OutVars{~A~0.base=v_~A~0.base_200, ~B~0.base=v_~B~0.base_192, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_31|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_74|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_104|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_74|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_151|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_96|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_74|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_74|, ~B~0.offset=v_~B~0.offset_194, ~res2~0=v_~res2~0_209, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_74|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_74|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_74|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_74|, ~N~0=v_~N~0_204, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_74|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_31|, ~A~0.offset=v_~A~0.offset_202, ~M~0=v_~M~0_136, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_74|, #memory_int=|v_#memory_int_348|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_57|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_74|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread2Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1, ~res2~0] [2022-12-06 07:39:30,405 WARN L322 ript$VariableManager]: TermVariable LBE534 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:30,405 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:30,405 WARN L322 ript$VariableManager]: TermVariable LBE444 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:30,405 WARN L322 ript$VariableManager]: TermVariable LBE520 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:30,405 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:30,405 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:30,405 WARN L322 ript$VariableManager]: TermVariable LBE192 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:30,406 WARN L322 ript$VariableManager]: TermVariable LBE535 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:30,854 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:39:30,855 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 723 [2022-12-06 07:39:30,855 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 312 transitions, 4305 flow [2022-12-06 07:39:30,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:30,855 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:30,855 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:30,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 07:39:30,855 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:30,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:30,856 INFO L85 PathProgramCache]: Analyzing trace with hash 360800076, now seen corresponding path program 1 times [2022-12-06 07:39:30,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:30,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575166279] [2022-12-06 07:39:30,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:30,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:31,724 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 07:39:31,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:31,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575166279] [2022-12-06 07:39:31,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575166279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:39:31,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:39:31,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:39:31,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367308485] [2022-12-06 07:39:31,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:31,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:39:31,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:31,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:39:31,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:39:31,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-06 07:39:31,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 312 transitions, 4305 flow. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 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 07:39:31,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:31,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-06 07:39:31,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:32,882 INFO L130 PetriNetUnfolder]: 4492/6590 cut-off events. [2022-12-06 07:39:32,882 INFO L131 PetriNetUnfolder]: For 60711/60878 co-relation queries the response was YES. [2022-12-06 07:39:32,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38973 conditions, 6590 events. 4492/6590 cut-off events. For 60711/60878 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 36082 event pairs, 1652 based on Foata normal form. 125/6662 useless extension candidates. Maximal degree in co-relation 36670. Up to 6069 conditions per place. [2022-12-06 07:39:32,925 INFO L137 encePairwiseOnDemand]: 23/50 looper letters, 256 selfloop transitions, 85 changer transitions 3/353 dead transitions. [2022-12-06 07:39:32,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 353 transitions, 5250 flow [2022-12-06 07:39:32,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:39:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:39:32,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-12-06 07:39:32,926 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2925 [2022-12-06 07:39:32,926 INFO L175 Difference]: Start difference. First operand has 123 places, 312 transitions, 4305 flow. Second operand 8 states and 117 transitions. [2022-12-06 07:39:32,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 353 transitions, 5250 flow [2022-12-06 07:39:33,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 353 transitions, 5149 flow, removed 34 selfloop flow, removed 3 redundant places. [2022-12-06 07:39:33,083 INFO L231 Difference]: Finished difference. Result has 129 places, 319 transitions, 4549 flow [2022-12-06 07:39:33,083 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=4216, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4549, PETRI_PLACES=129, PETRI_TRANSITIONS=319} [2022-12-06 07:39:33,083 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 96 predicate places. [2022-12-06 07:39:33,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:33,084 INFO L89 Accepts]: Start accepts. Operand has 129 places, 319 transitions, 4549 flow [2022-12-06 07:39:33,085 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:33,085 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:33,085 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 319 transitions, 4549 flow [2022-12-06 07:39:33,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 319 transitions, 4549 flow [2022-12-06 07:39:33,177 INFO L130 PetriNetUnfolder]: 429/1070 cut-off events. [2022-12-06 07:39:33,177 INFO L131 PetriNetUnfolder]: For 5991/6099 co-relation queries the response was YES. [2022-12-06 07:39:33,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5618 conditions, 1070 events. 429/1070 cut-off events. For 5991/6099 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7596 event pairs, 23 based on Foata normal form. 10/1060 useless extension candidates. Maximal degree in co-relation 5359. Up to 320 conditions per place. [2022-12-06 07:39:33,188 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 319 transitions, 4549 flow [2022-12-06 07:39:33,188 INFO L188 LiptonReduction]: Number of co-enabled transitions 2482 [2022-12-06 07:39:33,189 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [983] $Ultimate##0-->L74-4: Formula: (let ((.cse1 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_35| |v_thread3Thread1of1ForFork1_plus_~b#1_35|))) (and (= |v_thread3Thread1of1ForFork1_plus_#res#1_35| |v_thread3Thread1of1ForFork1_~tmp~2#1_47|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_35| v_~res2~0_142) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_35| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_35| |v_thread3Thread1of1ForFork1_plus_~b#1_35|) (= v_~res2~0_141 |v_thread3Thread1of1ForFork1_~tmp~2#1_47|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_47| 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|) (= (let ((.cse0 (* 4 v_~M~0_95))) (+ (select (select |v_#memory_int_278| v_~A~0.base_146) (+ v_~A~0.offset_148 .cse0)) (select (select |v_#memory_int_278| v_~B~0.base_140) (+ v_~B~0.offset_142 .cse0)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_35|) (= |v_thread3Thread1of1ForFork1_~i~2#1_79| (+ 1 v_~M~0_95)) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_35| 2147483648)) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_47| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_35| |v_thread3Thread1of1ForFork1_plus_~a#1_35|) (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_35| 0) (<= .cse1 2147483647)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (< v_~M~0_95 v_~N~0_154) (= |v_thread3Thread1of1ForFork1_plus_#res#1_35| .cse1))) InVars {~A~0.base=v_~A~0.base_146, ~B~0.base=v_~B~0.base_140, ~A~0.offset=v_~A~0.offset_148, ~M~0=v_~M~0_95, #memory_int=|v_#memory_int_278|, ~N~0=v_~N~0_154, ~B~0.offset=v_~B~0.offset_142, ~res2~0=v_~res2~0_142} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~A~0.base=v_~A~0.base_146, ~B~0.base=v_~B~0.base_140, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_35|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_35|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_35|, ~N~0=v_~N~0_154, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_79|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_35|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_35|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_47|, ~A~0.offset=v_~A~0.offset_148, ~M~0=v_~M~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_35|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_30|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_35|, #memory_int=|v_#memory_int_278|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_35|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_35|, ~B~0.offset=v_~B~0.offset_142, ~res2~0=v_~res2~0_141} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1, ~res2~0] and [967] $Ultimate##0-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_23| |v_thread1Thread1of1ForFork2_plus_~b#1_23|))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23| (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_23| 0)) 1 0)) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_23| 2147483647) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_23|) (= v_~res1~0_89 |v_thread1Thread1of1ForFork2_plus_#in~a#1_23|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_25| 2147483648)) (= |v_thread1Thread1of1ForFork2_plus_~b#1_23| |v_thread1Thread1of1ForFork2_plus_#in~b#1_23|) (= (+ (select (select |v_#memory_int_220| v_~B~0.base_104) v_~B~0.offset_104) (select (select |v_#memory_int_220| v_~A~0.base_108) v_~A~0.offset_108)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_23|) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_25| 2147483647) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= |v_thread1Thread1of1ForFork2_~i~0#1_48| 1) (< 0 v_~N~0_115) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_25| |v_thread1Thread1of1ForFork2_plus_#res#1_23|) (= |v_thread1Thread1of1ForFork2_plus_~a#1_23| |v_thread1Thread1of1ForFork2_plus_#in~a#1_23|) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_23| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_25| v_~res1~0_88))) InVars {~res1~0=v_~res1~0_89, ~A~0.base=v_~A~0.base_108, ~B~0.base=v_~B~0.base_104, ~A~0.offset=v_~A~0.offset_108, #memory_int=|v_#memory_int_220|, ~N~0=v_~N~0_115, ~B~0.offset=v_~B~0.offset_104} OutVars{~res1~0=v_~res1~0_88, ~A~0.base=v_~A~0.base_108, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_23|, ~B~0.base=v_~B~0.base_104, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_23|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_25|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_23|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_23|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_23|, ~N~0=v_~N~0_115, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_23|, ~A~0.offset=v_~A~0.offset_108, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_48|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_23|, #memory_int=|v_#memory_int_220|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_23|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_23|, ~B~0.offset=v_~B~0.offset_104, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_23|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:39:33,517 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1012] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse3 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_80| |v_thread3Thread1of1ForFork1_plus_~b#1_80|)) (.cse4 (+ v_~res2~0_219 2147483648)) (.cse2 (select |v_#memory_int_356| v_~B~0.base_200)) (.cse0 (select |v_#memory_int_356| v_~A~0.base_208))) (and (= |v_thread3Thread1of1ForFork1_plus_#res#1_80| |v_thread3Thread1of1ForFork1_~tmp~2#1_106|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_80| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_80| |v_thread3Thread1of1ForFork1_plus_~a#1_80|) (<= v_~res2~0_219 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_80| (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_169| 4))) (+ (select .cse0 (+ v_~A~0.offset_210 .cse1)) (select .cse2 (+ v_~B~0.offset_202 .cse1))))) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_80| v_~res2~0_219) (= .cse3 |v_thread3Thread1of1ForFork1_plus_#res#1_80|) (<= v_~res2~0_220 .cse4) (= |v_thread2Thread1of1ForFork0_~i~1#1_116| 0) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_80| (ite (or (<= .cse3 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_80| 0)) 1 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_39| 0) (<= 0 .cse4) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_106| 2147483648)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_80| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_80|) (= |v_thread2Thread1of1ForFork0_#res#1.base_39| 0) (< |v_thread3Thread1of1ForFork1_~i~2#1_169| v_~N~0_212) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_80| |v_thread3Thread1of1ForFork1_plus_~b#1_80|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_106| 2147483647) (<= v_~res2~0_219 (+ 2147483647 v_~res2~0_220)) (= (let ((.cse5 (* v_~M~0_148 4))) (+ (select .cse2 (+ v_~B~0.offset_202 .cse5)) (select .cse0 (+ .cse5 v_~A~0.offset_210)) v_~res2~0_220)) v_~res2~0_219) (= (+ v_~M~0_148 1) |v_thread3Thread1of1ForFork1_~i~2#1_169|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_80| 2147483647) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_116| v_~M~0_148)))) InVars {~A~0.base=v_~A~0.base_208, ~B~0.base=v_~B~0.base_200, ~A~0.offset=v_~A~0.offset_210, ~M~0=v_~M~0_148, #memory_int=|v_#memory_int_356|, ~N~0=v_~N~0_212, ~B~0.offset=v_~B~0.offset_202, ~res2~0=v_~res2~0_220} OutVars{~A~0.base=v_~A~0.base_208, ~B~0.base=v_~B~0.base_200, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_39|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_80|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_116|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_80|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_169|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_106|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_80|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_80|, ~B~0.offset=v_~B~0.offset_202, ~res2~0=v_~res2~0_219, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_80|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_80|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_80|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_80|, ~N~0=v_~N~0_212, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_80|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_39|, ~A~0.offset=v_~A~0.offset_210, ~M~0=v_~M~0_148, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_80|, #memory_int=|v_#memory_int_356|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_63|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_80|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork0_~i~1#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread2Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1, ~res2~0] and [967] $Ultimate##0-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_23| |v_thread1Thread1of1ForFork2_plus_~b#1_23|))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23| (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_23| 0)) 1 0)) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_23| 2147483647) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_23|) (= v_~res1~0_89 |v_thread1Thread1of1ForFork2_plus_#in~a#1_23|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_25| 2147483648)) (= |v_thread1Thread1of1ForFork2_plus_~b#1_23| |v_thread1Thread1of1ForFork2_plus_#in~b#1_23|) (= (+ (select (select |v_#memory_int_220| v_~B~0.base_104) v_~B~0.offset_104) (select (select |v_#memory_int_220| v_~A~0.base_108) v_~A~0.offset_108)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_23|) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_25| 2147483647) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= |v_thread1Thread1of1ForFork2_~i~0#1_48| 1) (< 0 v_~N~0_115) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_25| |v_thread1Thread1of1ForFork2_plus_#res#1_23|) (= |v_thread1Thread1of1ForFork2_plus_~a#1_23| |v_thread1Thread1of1ForFork2_plus_#in~a#1_23|) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_23| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_25| v_~res1~0_88))) InVars {~res1~0=v_~res1~0_89, ~A~0.base=v_~A~0.base_108, ~B~0.base=v_~B~0.base_104, ~A~0.offset=v_~A~0.offset_108, #memory_int=|v_#memory_int_220|, ~N~0=v_~N~0_115, ~B~0.offset=v_~B~0.offset_104} OutVars{~res1~0=v_~res1~0_88, ~A~0.base=v_~A~0.base_108, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_23|, ~B~0.base=v_~B~0.base_104, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_23|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_25|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_23|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_23|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_23|, ~N~0=v_~N~0_115, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_23|, ~A~0.offset=v_~A~0.offset_108, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_48|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_23|, #memory_int=|v_#memory_int_220|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_23|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_23|, ~B~0.offset=v_~B~0.offset_104, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_23|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:39:34,059 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1012] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse3 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_80| |v_thread3Thread1of1ForFork1_plus_~b#1_80|)) (.cse4 (+ v_~res2~0_219 2147483648)) (.cse2 (select |v_#memory_int_356| v_~B~0.base_200)) (.cse0 (select |v_#memory_int_356| v_~A~0.base_208))) (and (= |v_thread3Thread1of1ForFork1_plus_#res#1_80| |v_thread3Thread1of1ForFork1_~tmp~2#1_106|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_80| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_80| |v_thread3Thread1of1ForFork1_plus_~a#1_80|) (<= v_~res2~0_219 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_80| (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_169| 4))) (+ (select .cse0 (+ v_~A~0.offset_210 .cse1)) (select .cse2 (+ v_~B~0.offset_202 .cse1))))) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_80| v_~res2~0_219) (= .cse3 |v_thread3Thread1of1ForFork1_plus_#res#1_80|) (<= v_~res2~0_220 .cse4) (= |v_thread2Thread1of1ForFork0_~i~1#1_116| 0) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_80| (ite (or (<= .cse3 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_80| 0)) 1 0)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_39| 0) (<= 0 .cse4) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_106| 2147483648)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_80| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_80|) (= |v_thread2Thread1of1ForFork0_#res#1.base_39| 0) (< |v_thread3Thread1of1ForFork1_~i~2#1_169| v_~N~0_212) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_80| |v_thread3Thread1of1ForFork1_plus_~b#1_80|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_106| 2147483647) (<= v_~res2~0_219 (+ 2147483647 v_~res2~0_220)) (= (let ((.cse5 (* v_~M~0_148 4))) (+ (select .cse2 (+ v_~B~0.offset_202 .cse5)) (select .cse0 (+ .cse5 v_~A~0.offset_210)) v_~res2~0_220)) v_~res2~0_219) (= (+ v_~M~0_148 1) |v_thread3Thread1of1ForFork1_~i~2#1_169|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_80| 2147483647) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_116| v_~M~0_148)))) InVars {~A~0.base=v_~A~0.base_208, ~B~0.base=v_~B~0.base_200, ~A~0.offset=v_~A~0.offset_210, ~M~0=v_~M~0_148, #memory_int=|v_#memory_int_356|, ~N~0=v_~N~0_212, ~B~0.offset=v_~B~0.offset_202, ~res2~0=v_~res2~0_220} OutVars{~A~0.base=v_~A~0.base_208, ~B~0.base=v_~B~0.base_200, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_39|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_80|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_116|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_80|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_169|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_106|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_80|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_80|, ~B~0.offset=v_~B~0.offset_202, ~res2~0=v_~res2~0_219, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_80|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_80|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_80|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_80|, ~N~0=v_~N~0_212, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_80|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_39|, ~A~0.offset=v_~A~0.offset_210, ~M~0=v_~M~0_148, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_80|, #memory_int=|v_#memory_int_356|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_63|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_80|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork0_~i~1#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread2Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1, ~res2~0] and [915] L77-->L74-4: Formula: (and (= |v_thread3Thread1of1ForFork1_~i~2#1_29| (+ |v_thread3Thread1of1ForFork1_~i~2#1_30| 1)) (= v_~res2~0_79 |v_thread3Thread1of1ForFork1_~tmp~2#1_17|)) InVars {thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_30|} OutVars{thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_17|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_29|, ~res2~0=v_~res2~0_79} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_~i~2#1, ~res2~0] [2022-12-06 07:39:34,298 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [952] L74-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< |v_thread3Thread1of1ForFork1_~i~2#1_In_3| v_~N~0_In_10))) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_In_3|, ~N~0=v_~N~0_In_10} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_Out_4|, ~N~0=v_~N~0_In_10, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_In_3|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base] and [967] $Ultimate##0-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_23| |v_thread1Thread1of1ForFork2_plus_~b#1_23|))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23| (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_23| 0)) 1 0)) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_23| 2147483647) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_23|) (= v_~res1~0_89 |v_thread1Thread1of1ForFork2_plus_#in~a#1_23|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_25| 2147483648)) (= |v_thread1Thread1of1ForFork2_plus_~b#1_23| |v_thread1Thread1of1ForFork2_plus_#in~b#1_23|) (= (+ (select (select |v_#memory_int_220| v_~B~0.base_104) v_~B~0.offset_104) (select (select |v_#memory_int_220| v_~A~0.base_108) v_~A~0.offset_108)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_23|) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_25| 2147483647) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= |v_thread1Thread1of1ForFork2_~i~0#1_48| 1) (< 0 v_~N~0_115) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_25| |v_thread1Thread1of1ForFork2_plus_#res#1_23|) (= |v_thread1Thread1of1ForFork2_plus_~a#1_23| |v_thread1Thread1of1ForFork2_plus_#in~a#1_23|) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_23| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_25| v_~res1~0_88))) InVars {~res1~0=v_~res1~0_89, ~A~0.base=v_~A~0.base_108, ~B~0.base=v_~B~0.base_104, ~A~0.offset=v_~A~0.offset_108, #memory_int=|v_#memory_int_220|, ~N~0=v_~N~0_115, ~B~0.offset=v_~B~0.offset_104} OutVars{~res1~0=v_~res1~0_88, ~A~0.base=v_~A~0.base_108, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_23|, ~B~0.base=v_~B~0.base_104, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_23|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_25|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_23|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_23|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_23|, ~N~0=v_~N~0_115, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_23|, ~A~0.offset=v_~A~0.offset_108, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_48|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_23|, #memory_int=|v_#memory_int_220|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_23|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_23|, ~B~0.offset=v_~B~0.offset_104, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_23|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:39:34,483 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:39:34,483 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1400 [2022-12-06 07:39:34,483 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 318 transitions, 4573 flow [2022-12-06 07:39:34,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 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 07:39:34,483 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:34,484 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:34,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 07:39:34,484 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:34,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:34,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1591447231, now seen corresponding path program 1 times [2022-12-06 07:39:34,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:34,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664585117] [2022-12-06 07:39:34,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:34,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:34,537 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 07:39:34,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:34,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664585117] [2022-12-06 07:39:34,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664585117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:39:34,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:39:34,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:39:34,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185016784] [2022-12-06 07:39:34,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:34,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:39:34,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:34,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:39:34,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:39:34,539 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 53 [2022-12-06 07:39:34,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 318 transitions, 4573 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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 07:39:34,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:34,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 53 [2022-12-06 07:39:34,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:35,310 INFO L130 PetriNetUnfolder]: 4298/6589 cut-off events. [2022-12-06 07:39:35,310 INFO L131 PetriNetUnfolder]: For 68480/68860 co-relation queries the response was YES. [2022-12-06 07:39:35,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38993 conditions, 6589 events. 4298/6589 cut-off events. For 68480/68860 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 39224 event pairs, 1753 based on Foata normal form. 702/7159 useless extension candidates. Maximal degree in co-relation 36909. Up to 4925 conditions per place. [2022-12-06 07:39:35,347 INFO L137 encePairwiseOnDemand]: 39/53 looper letters, 259 selfloop transitions, 33 changer transitions 2/312 dead transitions. [2022-12-06 07:39:35,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 312 transitions, 5071 flow [2022-12-06 07:39:35,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:39:35,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:39:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-06 07:39:35,348 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4339622641509434 [2022-12-06 07:39:35,348 INFO L175 Difference]: Start difference. First operand has 128 places, 318 transitions, 4573 flow. Second operand 4 states and 92 transitions. [2022-12-06 07:39:35,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 312 transitions, 5071 flow [2022-12-06 07:39:35,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 312 transitions, 4926 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-06 07:39:35,509 INFO L231 Difference]: Finished difference. Result has 129 places, 265 transitions, 3939 flow [2022-12-06 07:39:35,509 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=3825, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3939, PETRI_PLACES=129, PETRI_TRANSITIONS=265} [2022-12-06 07:39:35,510 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 96 predicate places. [2022-12-06 07:39:35,510 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:35,510 INFO L89 Accepts]: Start accepts. Operand has 129 places, 265 transitions, 3939 flow [2022-12-06 07:39:35,512 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:35,512 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:35,513 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 265 transitions, 3939 flow [2022-12-06 07:39:35,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 265 transitions, 3939 flow [2022-12-06 07:39:35,611 INFO L130 PetriNetUnfolder]: 341/1004 cut-off events. [2022-12-06 07:39:35,611 INFO L131 PetriNetUnfolder]: For 6630/6747 co-relation queries the response was YES. [2022-12-06 07:39:35,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5448 conditions, 1004 events. 341/1004 cut-off events. For 6630/6747 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7662 event pairs, 27 based on Foata normal form. 10/993 useless extension candidates. Maximal degree in co-relation 5219. Up to 232 conditions per place. [2022-12-06 07:39:35,623 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 265 transitions, 3939 flow [2022-12-06 07:39:35,624 INFO L188 LiptonReduction]: Number of co-enabled transitions 2110 [2022-12-06 07:39:35,625 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:39:35,625 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-06 07:39:35,625 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 265 transitions, 3939 flow [2022-12-06 07:39:35,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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 07:39:35,625 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:35,625 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:35,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 07:39:35,626 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:35,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:35,626 INFO L85 PathProgramCache]: Analyzing trace with hash 153042172, now seen corresponding path program 1 times [2022-12-06 07:39:35,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:35,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880753447] [2022-12-06 07:39:35,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:35,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:35,734 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 07:39:35,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:35,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880753447] [2022-12-06 07:39:35,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880753447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:39:35,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:39:35,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:39:35,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218833281] [2022-12-06 07:39:35,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:35,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:39:35,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:35,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:39:35,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:39:35,735 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 52 [2022-12-06 07:39:35,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 265 transitions, 3939 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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 07:39:35,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:35,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 52 [2022-12-06 07:39:35,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:36,747 INFO L130 PetriNetUnfolder]: 5859/8933 cut-off events. [2022-12-06 07:39:36,747 INFO L131 PetriNetUnfolder]: For 84154/84351 co-relation queries the response was YES. [2022-12-06 07:39:36,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51882 conditions, 8933 events. 5859/8933 cut-off events. For 84154/84351 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 54746 event pairs, 3395 based on Foata normal form. 147/9016 useless extension candidates. Maximal degree in co-relation 49783. Up to 4461 conditions per place. [2022-12-06 07:39:36,805 INFO L137 encePairwiseOnDemand]: 49/52 looper letters, 321 selfloop transitions, 1 changer transitions 0/331 dead transitions. [2022-12-06 07:39:36,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 331 transitions, 5401 flow [2022-12-06 07:39:36,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:39:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:39:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-12-06 07:39:36,816 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2022-12-06 07:39:36,816 INFO L175 Difference]: Start difference. First operand has 129 places, 265 transitions, 3939 flow. Second operand 3 states and 80 transitions. [2022-12-06 07:39:36,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 331 transitions, 5401 flow [2022-12-06 07:39:37,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 331 transitions, 5399 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:39:37,210 INFO L231 Difference]: Finished difference. Result has 130 places, 263 transitions, 3891 flow [2022-12-06 07:39:37,211 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=3889, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3891, PETRI_PLACES=130, PETRI_TRANSITIONS=263} [2022-12-06 07:39:37,211 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 97 predicate places. [2022-12-06 07:39:37,211 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:37,211 INFO L89 Accepts]: Start accepts. Operand has 130 places, 263 transitions, 3891 flow [2022-12-06 07:39:37,212 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:37,212 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:37,213 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 263 transitions, 3891 flow [2022-12-06 07:39:37,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 263 transitions, 3891 flow [2022-12-06 07:39:37,315 INFO L130 PetriNetUnfolder]: 412/1222 cut-off events. [2022-12-06 07:39:37,316 INFO L131 PetriNetUnfolder]: For 8122/8280 co-relation queries the response was YES. [2022-12-06 07:39:37,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6605 conditions, 1222 events. 412/1222 cut-off events. For 8122/8280 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 9818 event pairs, 35 based on Foata normal form. 16/1211 useless extension candidates. Maximal degree in co-relation 6288. Up to 284 conditions per place. [2022-12-06 07:39:37,328 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 263 transitions, 3891 flow [2022-12-06 07:39:37,328 INFO L188 LiptonReduction]: Number of co-enabled transitions 2106 [2022-12-06 07:39:37,329 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:39:37,329 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-06 07:39:37,329 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 263 transitions, 3891 flow [2022-12-06 07:39:37,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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 07:39:37,330 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:37,330 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:37,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 07:39:37,330 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:37,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:37,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1623855692, now seen corresponding path program 1 times [2022-12-06 07:39:37,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:37,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269072792] [2022-12-06 07:39:37,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:37,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:37,479 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 07:39:37,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:37,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269072792] [2022-12-06 07:39:37,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269072792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:39:37,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:39:37,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:39:37,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022671703] [2022-12-06 07:39:37,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:37,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:39:37,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:37,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:39:37,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:39:37,482 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-06 07:39:37,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 263 transitions, 3891 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:37,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:37,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-06 07:39:37,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:38,506 INFO L130 PetriNetUnfolder]: 5842/8902 cut-off events. [2022-12-06 07:39:38,507 INFO L131 PetriNetUnfolder]: For 82868/83068 co-relation queries the response was YES. [2022-12-06 07:39:38,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51649 conditions, 8902 events. 5842/8902 cut-off events. For 82868/83068 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 54199 event pairs, 2793 based on Foata normal form. 150/8994 useless extension candidates. Maximal degree in co-relation 49357. Up to 4348 conditions per place. [2022-12-06 07:39:38,565 INFO L137 encePairwiseOnDemand]: 37/50 looper letters, 313 selfloop transitions, 16 changer transitions 0/338 dead transitions. [2022-12-06 07:39:38,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 338 transitions, 5418 flow [2022-12-06 07:39:38,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:39:38,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:39:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-06 07:39:38,580 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.445 [2022-12-06 07:39:38,580 INFO L175 Difference]: Start difference. First operand has 130 places, 263 transitions, 3891 flow. Second operand 4 states and 89 transitions. [2022-12-06 07:39:38,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 338 transitions, 5418 flow [2022-12-06 07:39:38,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 338 transitions, 5415 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 07:39:38,948 INFO L231 Difference]: Finished difference. Result has 133 places, 262 transitions, 3909 flow [2022-12-06 07:39:38,949 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3835, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3909, PETRI_PLACES=133, PETRI_TRANSITIONS=262} [2022-12-06 07:39:38,949 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 100 predicate places. [2022-12-06 07:39:38,949 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:38,949 INFO L89 Accepts]: Start accepts. Operand has 133 places, 262 transitions, 3909 flow [2022-12-06 07:39:38,950 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:38,950 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:38,950 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 262 transitions, 3909 flow [2022-12-06 07:39:38,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 262 transitions, 3909 flow [2022-12-06 07:39:39,047 INFO L130 PetriNetUnfolder]: 407/1205 cut-off events. [2022-12-06 07:39:39,047 INFO L131 PetriNetUnfolder]: For 8157/8308 co-relation queries the response was YES. [2022-12-06 07:39:39,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6565 conditions, 1205 events. 407/1205 cut-off events. For 8157/8308 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 9605 event pairs, 34 based on Foata normal form. 16/1195 useless extension candidates. Maximal degree in co-relation 6247. Up to 277 conditions per place. [2022-12-06 07:39:39,059 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 262 transitions, 3909 flow [2022-12-06 07:39:39,059 INFO L188 LiptonReduction]: Number of co-enabled transitions 2110 [2022-12-06 07:39:39,060 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:39:39,061 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-06 07:39:39,061 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 262 transitions, 3909 flow [2022-12-06 07:39:39,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:39,061 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:39,061 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:39,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 07:39:39,061 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:39,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:39,062 INFO L85 PathProgramCache]: Analyzing trace with hash -772096631, now seen corresponding path program 1 times [2022-12-06 07:39:39,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:39,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912531908] [2022-12-06 07:39:39,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:39,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:39,527 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 07:39:39,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:39,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912531908] [2022-12-06 07:39:39,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912531908] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:39:39,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843069064] [2022-12-06 07:39:39,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:39,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:39:39,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:39:39,529 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 07:39:39,531 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 07:39:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:39,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-06 07:39:39,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:39:39,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13430 treesize of output 13302 [2022-12-06 07:39:39,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-06 07:39:39,920 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 07:39:39,921 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-06 07:39:40,336 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 07:39:40,365 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 07:39:40,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 07:39:40,524 INFO L321 Elim1Store]: treesize reduction 47, result has 30.9 percent of original size [2022-12-06 07:39:40,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 31 [2022-12-06 07:39:40,535 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 07:39:40,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:39:40,800 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 07:39:40,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843069064] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:39:40,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:39:40,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 20 [2022-12-06 07:39:40,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715100185] [2022-12-06 07:39:40,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:39:40,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 07:39:40,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:40,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 07:39:40,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-12-06 07:39:40,802 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2022-12-06 07:39:40,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 262 transitions, 3909 flow. Second operand has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 07:39:40,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:40,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2022-12-06 07:39:40,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:42,499 INFO L130 PetriNetUnfolder]: 6017/9176 cut-off events. [2022-12-06 07:39:42,500 INFO L131 PetriNetUnfolder]: For 85534/85731 co-relation queries the response was YES. [2022-12-06 07:39:42,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53591 conditions, 9176 events. 6017/9176 cut-off events. For 85534/85731 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 56446 event pairs, 1892 based on Foata normal form. 159/9271 useless extension candidates. Maximal degree in co-relation 51192. Up to 6544 conditions per place. [2022-12-06 07:39:42,566 INFO L137 encePairwiseOnDemand]: 20/49 looper letters, 151 selfloop transitions, 176 changer transitions 4/340 dead transitions. [2022-12-06 07:39:42,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 340 transitions, 5204 flow [2022-12-06 07:39:42,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 07:39:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 07:39:42,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 155 transitions. [2022-12-06 07:39:42,568 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2259475218658892 [2022-12-06 07:39:42,568 INFO L175 Difference]: Start difference. First operand has 133 places, 262 transitions, 3909 flow. Second operand 14 states and 155 transitions. [2022-12-06 07:39:42,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 340 transitions, 5204 flow [2022-12-06 07:39:42,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 340 transitions, 5203 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:39:42,943 INFO L231 Difference]: Finished difference. Result has 149 places, 285 transitions, 4941 flow [2022-12-06 07:39:42,944 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3908, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4941, PETRI_PLACES=149, PETRI_TRANSITIONS=285} [2022-12-06 07:39:42,944 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 116 predicate places. [2022-12-06 07:39:42,944 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:42,944 INFO L89 Accepts]: Start accepts. Operand has 149 places, 285 transitions, 4941 flow [2022-12-06 07:39:42,945 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:42,945 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:42,945 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 285 transitions, 4941 flow [2022-12-06 07:39:42,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 285 transitions, 4941 flow [2022-12-06 07:39:43,062 INFO L130 PetriNetUnfolder]: 430/1281 cut-off events. [2022-12-06 07:39:43,062 INFO L131 PetriNetUnfolder]: For 12271/12442 co-relation queries the response was YES. [2022-12-06 07:39:43,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7755 conditions, 1281 events. 430/1281 cut-off events. For 12271/12442 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 10411 event pairs, 35 based on Foata normal form. 24/1278 useless extension candidates. Maximal degree in co-relation 7408. Up to 301 conditions per place. [2022-12-06 07:39:43,076 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 285 transitions, 4941 flow [2022-12-06 07:39:43,076 INFO L188 LiptonReduction]: Number of co-enabled transitions 2216 [2022-12-06 07:39:43,101 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1009] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_35| 0) (= |v_thread2Thread1of1ForFork0_#res#1.base_35| 0) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_112| v_~M~0_144)) (= v_~M~0_144 |v_thread3Thread1of1ForFork1_~i~2#1_163|) (= |v_thread2Thread1of1ForFork0_~i~1#1_112| 0)) InVars {~M~0=v_~M~0_144} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_35|, ~M~0=v_~M~0_144, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_35|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_112|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_163|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1, thread3Thread1of1ForFork1_~i~2#1] and [847] L74-4-->L77: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|))) (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_5| 0)) 1 0)) (= v_~res2~0_47 |v_thread3Thread1of1ForFork1_plus_#in~a#1_5|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483647) (= (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_17| 4))) (+ (select (select |v_#memory_int_88| v_~B~0.base_42) (+ .cse1 v_~B~0.offset_42)) (select (select |v_#memory_int_88| v_~A~0.base_44) (+ .cse1 v_~A~0.offset_44)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_5|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_5|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_5| |v_thread3Thread1of1ForFork1_plus_~a#1_5|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_5| |v_thread3Thread1of1ForFork1_~tmp~2#1_7|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|) (< |v_thread3Thread1of1ForFork1_~i~2#1_17| v_~N~0_20))) InVars {~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, ~A~0.offset=v_~A~0.offset_44, #memory_int=|v_#memory_int_88|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_5|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_5|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_5|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_5|, ~A~0.offset=v_~A~0.offset_44, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_7|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_5|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_5|, #memory_int=|v_#memory_int_88|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_5|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1] [2022-12-06 07:39:43,261 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1009] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_35| 0) (= |v_thread2Thread1of1ForFork0_#res#1.base_35| 0) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_112| v_~M~0_144)) (= v_~M~0_144 |v_thread3Thread1of1ForFork1_~i~2#1_163|) (= |v_thread2Thread1of1ForFork0_~i~1#1_112| 0)) InVars {~M~0=v_~M~0_144} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_35|, ~M~0=v_~M~0_144, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_35|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_112|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_163|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~i~1#1, thread3Thread1of1ForFork1_~i~2#1] and [966] $Ultimate##0-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_~b#1_21|))) (and (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_21| 0) (<= .cse0 2147483647)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (< 0 v_~N~0_113) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| |v_thread1Thread1of1ForFork2_plus_#res#1_21|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483647) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483648)) (= (+ (select (select |v_#memory_int_218| v_~B~0.base_102) v_~B~0.offset_102) (select (select |v_#memory_int_218| v_~A~0.base_106) v_~A~0.offset_106)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (= |v_thread1Thread1of1ForFork2_~i~0#1_44| 1) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (= v_~res1~0_85 |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= |v_thread1Thread1of1ForFork2_plus_~b#1_21| |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| v_~res1~0_84) (= |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_21|))) InVars {~res1~0=v_~res1~0_85, ~A~0.base=v_~A~0.base_106, ~B~0.base=v_~B~0.base_102, ~A~0.offset=v_~A~0.offset_106, #memory_int=|v_#memory_int_218|, ~N~0=v_~N~0_113, ~B~0.offset=v_~B~0.offset_102} OutVars{~res1~0=v_~res1~0_84, ~A~0.base=v_~A~0.base_106, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_21|, ~B~0.base=v_~B~0.base_102, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_21|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_23|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_21|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_21|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_21|, ~N~0=v_~N~0_113, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_21|, ~A~0.offset=v_~A~0.offset_106, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_44|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_21|, #memory_int=|v_#memory_int_218|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_21|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_21|, ~B~0.offset=v_~B~0.offset_102, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:39:43,419 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [991] L61-4-->L48-4: Formula: (let ((.cse1 (select |v_#memory_int_290| v_~B~0.base_152)) (.cse3 (select |v_#memory_int_290| v_~A~0.base_158))) (let ((.cse6 (select .cse3 v_~A~0.offset_160)) (.cse7 (select .cse1 v_~B~0.offset_154))) (let ((.cse0 (+ v_~res1~0_150 .cse6 .cse7)) (.cse4 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_54| |v_thread1Thread1of1ForFork2_plus_~b#1_54|)) (.cse8 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_45| |v_thread3Thread1of1ForFork1_plus_~b#1_45|))) (and (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_54| 2147483648)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_23| 0) (<= .cse0 2147483647) (< |v_thread3Thread1of1ForFork1_~i~2#1_99| v_~N~0_166) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_56| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_45| |v_thread3Thread1of1ForFork1_plus_~a#1_45|) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_45| (let ((.cse2 (* |v_thread3Thread1of1ForFork1_~i~2#1_99| 4))) (+ (select .cse1 (+ v_~B~0.offset_154 .cse2)) (select .cse3 (+ v_~A~0.offset_160 .cse2))))) (= |v_thread1Thread1of1ForFork2_plus_~a#1_54| |v_thread1Thread1of1ForFork2_plus_#in~a#1_54|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_54| 2147483647) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_56| |v_thread1Thread1of1ForFork2_plus_#res#1_54|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_75| v_~M~0_111)) (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_54| 0) (<= .cse4 2147483647)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_54|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_54| .cse0) (= .cse4 |v_thread1Thread1of1ForFork2_plus_#res#1_54|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_45| 2147483647) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_59| 2147483648)) (= (let ((.cse5 (* |v_thread1Thread1of1ForFork2_~i~0#1_81| 4))) (+ (select .cse1 (+ v_~B~0.offset_154 (- 4) .cse5)) (select .cse3 (+ v_~A~0.offset_160 (- 4) .cse5)))) |v_thread1Thread1of1ForFork2_plus_#in~b#1_54|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_45| 2147483648)) (<= 0 (+ .cse6 .cse7 2147483648)) (<= (+ .cse6 .cse7) 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#res#1_45| |v_thread3Thread1of1ForFork1_~tmp~2#1_59|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_45| 0) (<= .cse8 2147483647)) 1 0)) (< |v_thread1Thread1of1ForFork2_~i~0#1_81| (+ v_~N~0_166 1)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_45| |v_thread3Thread1of1ForFork1_plus_~b#1_45|) (<= 0 (+ v_~res1~0_150 .cse6 .cse7 2147483648)) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_59| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_56| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_56| v_~res1~0_149) (= |v_thread1Thread1of1ForFork2_plus_~b#1_54| |v_thread1Thread1of1ForFork2_plus_#in~b#1_54|) (= .cse8 |v_thread3Thread1of1ForFork1_plus_#res#1_45|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_54| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_54|) (= |v_thread1Thread1of1ForFork2_~i~0#1_81| 2) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_45| v_~res2~0_157) (= |v_thread2Thread1of1ForFork0_#res#1.base_23| 0))))) InVars {~res1~0=v_~res1~0_150, ~A~0.base=v_~A~0.base_158, ~B~0.base=v_~B~0.base_152, ~A~0.offset=v_~A~0.offset_160, ~M~0=v_~M~0_111, #memory_int=|v_#memory_int_290|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_75|, ~N~0=v_~N~0_166, ~B~0.offset=v_~B~0.offset_154, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_99|, ~res2~0=v_~res2~0_157} OutVars{~res1~0=v_~res1~0_149, ~A~0.base=v_~A~0.base_158, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_54|, ~B~0.base=v_~B~0.base_152, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_54|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_23|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_54|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_45|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_75|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_54|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_45|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_99|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_54|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_59|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_45|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_54|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_54|, ~B~0.offset=v_~B~0.offset_154, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_45|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_54|, ~res2~0=v_~res2~0_157, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_45|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_56|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_45|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_54|, ~N~0=v_~N~0_166, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_45|, ~A~0.offset=v_~A~0.offset_160, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_23|, ~M~0=v_~M~0_111, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_81|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_54|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_54|, #memory_int=|v_#memory_int_290|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_45|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_45|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_54|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread1Thread1of1ForFork2_#t~post1#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread3Thread1of1ForFork1_#t~mem12#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~tmp~0#1, thread3Thread1of1ForFork1_#t~mem13#1, thread1Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork2_plus_#res#1] and [915] L77-->L74-4: Formula: (and (= |v_thread3Thread1of1ForFork1_~i~2#1_29| (+ |v_thread3Thread1of1ForFork1_~i~2#1_30| 1)) (= v_~res2~0_79 |v_thread3Thread1of1ForFork1_~tmp~2#1_17|)) InVars {thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_30|} OutVars{thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_17|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_29|, ~res2~0=v_~res2~0_79} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_~i~2#1, ~res2~0] [2022-12-06 07:39:44,006 WARN L322 ript$VariableManager]: TermVariable LBE534 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:44,007 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:44,007 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:44,007 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:44,007 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:44,007 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:44,007 WARN L322 ript$VariableManager]: TermVariable LBE535 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:44,007 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:44,007 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:44,007 WARN L322 ript$VariableManager]: TermVariable LBE444 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:44,007 WARN L322 ript$VariableManager]: TermVariable LBE520 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:44,008 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:44,008 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:44,008 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:44,008 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:44,008 WARN L322 ript$VariableManager]: TermVariable LBE192 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:39:45,078 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:39:45,078 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2134 [2022-12-06 07:39:45,078 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 284 transitions, 4975 flow [2022-12-06 07:39:45,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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 07:39:45,079 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:45,079 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:45,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 07:39:45,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:39:45,283 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:45,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:45,284 INFO L85 PathProgramCache]: Analyzing trace with hash -216048318, now seen corresponding path program 1 times [2022-12-06 07:39:45,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:45,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387852500] [2022-12-06 07:39:45,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:45,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:45,915 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 07:39:45,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:45,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387852500] [2022-12-06 07:39:45,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387852500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:39:45,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:39:45,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 07:39:45,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127549585] [2022-12-06 07:39:45,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:45,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 07:39:45,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:45,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 07:39:45,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-06 07:39:45,916 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 52 [2022-12-06 07:39:45,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 284 transitions, 4975 flow. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:45,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:45,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 52 [2022-12-06 07:39:45,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:47,336 INFO L130 PetriNetUnfolder]: 6186/9442 cut-off events. [2022-12-06 07:39:47,336 INFO L131 PetriNetUnfolder]: For 119414/119609 co-relation queries the response was YES. [2022-12-06 07:39:47,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60733 conditions, 9442 events. 6186/9442 cut-off events. For 119414/119609 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 58421 event pairs, 1831 based on Foata normal form. 156/9531 useless extension candidates. Maximal degree in co-relation 58114. Up to 6564 conditions per place. [2022-12-06 07:39:47,397 INFO L137 encePairwiseOnDemand]: 22/52 looper letters, 146 selfloop transitions, 183 changer transitions 5/343 dead transitions. [2022-12-06 07:39:47,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 343 transitions, 6224 flow [2022-12-06 07:39:47,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:39:47,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:39:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2022-12-06 07:39:47,398 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27350427350427353 [2022-12-06 07:39:47,398 INFO L175 Difference]: Start difference. First operand has 148 places, 284 transitions, 4975 flow. Second operand 9 states and 128 transitions. [2022-12-06 07:39:47,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 343 transitions, 6224 flow [2022-12-06 07:39:47,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 343 transitions, 6056 flow, removed 41 selfloop flow, removed 6 redundant places. [2022-12-06 07:39:47,778 INFO L231 Difference]: Finished difference. Result has 154 places, 301 transitions, 5870 flow [2022-12-06 07:39:47,779 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=4839, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5870, PETRI_PLACES=154, PETRI_TRANSITIONS=301} [2022-12-06 07:39:47,779 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 121 predicate places. [2022-12-06 07:39:47,779 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:47,779 INFO L89 Accepts]: Start accepts. Operand has 154 places, 301 transitions, 5870 flow [2022-12-06 07:39:47,780 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:47,780 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:47,781 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 301 transitions, 5870 flow [2022-12-06 07:39:47,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 301 transitions, 5870 flow [2022-12-06 07:39:47,913 INFO L130 PetriNetUnfolder]: 445/1328 cut-off events. [2022-12-06 07:39:47,914 INFO L131 PetriNetUnfolder]: For 15987/16161 co-relation queries the response was YES. [2022-12-06 07:39:47,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8748 conditions, 1328 events. 445/1328 cut-off events. For 15987/16161 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10909 event pairs, 36 based on Foata normal form. 38/1340 useless extension candidates. Maximal degree in co-relation 8372. Up to 311 conditions per place. [2022-12-06 07:39:47,930 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 301 transitions, 5870 flow [2022-12-06 07:39:47,930 INFO L188 LiptonReduction]: Number of co-enabled transitions 2322 [2022-12-06 07:39:48,041 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [847] L74-4-->L77: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|))) (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_5| 0)) 1 0)) (= v_~res2~0_47 |v_thread3Thread1of1ForFork1_plus_#in~a#1_5|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483647) (= (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_17| 4))) (+ (select (select |v_#memory_int_88| v_~B~0.base_42) (+ .cse1 v_~B~0.offset_42)) (select (select |v_#memory_int_88| v_~A~0.base_44) (+ .cse1 v_~A~0.offset_44)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_5|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_5|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_5| |v_thread3Thread1of1ForFork1_plus_~a#1_5|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_5| |v_thread3Thread1of1ForFork1_~tmp~2#1_7|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|) (< |v_thread3Thread1of1ForFork1_~i~2#1_17| v_~N~0_20))) InVars {~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, ~A~0.offset=v_~A~0.offset_44, #memory_int=|v_#memory_int_88|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_5|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_5|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_5|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_5|, ~A~0.offset=v_~A~0.offset_44, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_7|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_5|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_5|, #memory_int=|v_#memory_int_88|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_5|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1] and [966] $Ultimate##0-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_~b#1_21|))) (and (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_21| 0) (<= .cse0 2147483647)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (< 0 v_~N~0_113) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| |v_thread1Thread1of1ForFork2_plus_#res#1_21|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483647) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483648)) (= (+ (select (select |v_#memory_int_218| v_~B~0.base_102) v_~B~0.offset_102) (select (select |v_#memory_int_218| v_~A~0.base_106) v_~A~0.offset_106)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (= |v_thread1Thread1of1ForFork2_~i~0#1_44| 1) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (= v_~res1~0_85 |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= |v_thread1Thread1of1ForFork2_plus_~b#1_21| |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| v_~res1~0_84) (= |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_21|))) InVars {~res1~0=v_~res1~0_85, ~A~0.base=v_~A~0.base_106, ~B~0.base=v_~B~0.base_102, ~A~0.offset=v_~A~0.offset_106, #memory_int=|v_#memory_int_218|, ~N~0=v_~N~0_113, ~B~0.offset=v_~B~0.offset_102} OutVars{~res1~0=v_~res1~0_84, ~A~0.base=v_~A~0.base_106, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_21|, ~B~0.base=v_~B~0.base_102, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_21|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_23|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_21|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_21|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_21|, ~N~0=v_~N~0_113, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_21|, ~A~0.offset=v_~A~0.offset_106, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_44|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_21|, #memory_int=|v_#memory_int_218|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_21|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_21|, ~B~0.offset=v_~B~0.offset_102, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:39:48,326 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:39:48,327 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 548 [2022-12-06 07:39:48,327 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 300 transitions, 5866 flow [2022-12-06 07:39:48,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:48,327 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:48,327 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:48,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 07:39:48,327 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:48,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:48,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1865031330, now seen corresponding path program 1 times [2022-12-06 07:39:48,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:48,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766304856] [2022-12-06 07:39:48,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:48,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:39:48,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:48,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766304856] [2022-12-06 07:39:48,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766304856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:39:48,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:39:48,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:39:48,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13858803] [2022-12-06 07:39:48,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:48,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:39:48,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:48,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:39:48,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:39:48,438 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 53 [2022-12-06 07:39:48,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 300 transitions, 5866 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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 07:39:48,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:48,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 53 [2022-12-06 07:39:48,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:49,630 INFO L130 PetriNetUnfolder]: 6038/9240 cut-off events. [2022-12-06 07:39:49,630 INFO L131 PetriNetUnfolder]: For 157044/157241 co-relation queries the response was YES. [2022-12-06 07:39:49,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64018 conditions, 9240 events. 6038/9240 cut-off events. For 157044/157241 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 57441 event pairs, 2854 based on Foata normal form. 219/9408 useless extension candidates. Maximal degree in co-relation 63205. Up to 4546 conditions per place. [2022-12-06 07:39:49,700 INFO L137 encePairwiseOnDemand]: 47/53 looper letters, 360 selfloop transitions, 8 changer transitions 2/379 dead transitions. [2022-12-06 07:39:49,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 379 transitions, 7719 flow [2022-12-06 07:39:49,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:39:49,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:39:49,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-06 07:39:49,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44339622641509435 [2022-12-06 07:39:49,701 INFO L175 Difference]: Start difference. First operand has 152 places, 300 transitions, 5866 flow. Second operand 4 states and 94 transitions. [2022-12-06 07:39:49,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 379 transitions, 7719 flow [2022-12-06 07:39:50,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 379 transitions, 7584 flow, removed 32 selfloop flow, removed 4 redundant places. [2022-12-06 07:39:50,191 INFO L231 Difference]: Finished difference. Result has 153 places, 283 transitions, 5382 flow [2022-12-06 07:39:50,192 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=5350, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=5382, PETRI_PLACES=153, PETRI_TRANSITIONS=283} [2022-12-06 07:39:50,192 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 120 predicate places. [2022-12-06 07:39:50,192 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:50,192 INFO L89 Accepts]: Start accepts. Operand has 153 places, 283 transitions, 5382 flow [2022-12-06 07:39:50,193 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:50,193 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:50,194 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 283 transitions, 5382 flow [2022-12-06 07:39:50,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 283 transitions, 5382 flow [2022-12-06 07:39:50,312 INFO L130 PetriNetUnfolder]: 428/1287 cut-off events. [2022-12-06 07:39:50,313 INFO L131 PetriNetUnfolder]: For 16100/16279 co-relation queries the response was YES. [2022-12-06 07:39:50,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8421 conditions, 1287 events. 428/1287 cut-off events. For 16100/16279 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 10533 event pairs, 37 based on Foata normal form. 35/1295 useless extension candidates. Maximal degree in co-relation 8194. Up to 296 conditions per place. [2022-12-06 07:39:50,432 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 283 transitions, 5382 flow [2022-12-06 07:39:50,433 INFO L188 LiptonReduction]: Number of co-enabled transitions 2222 [2022-12-06 07:39:50,592 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [847] L74-4-->L77: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|))) (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_5| 0)) 1 0)) (= v_~res2~0_47 |v_thread3Thread1of1ForFork1_plus_#in~a#1_5|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483647) (= (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_17| 4))) (+ (select (select |v_#memory_int_88| v_~B~0.base_42) (+ .cse1 v_~B~0.offset_42)) (select (select |v_#memory_int_88| v_~A~0.base_44) (+ .cse1 v_~A~0.offset_44)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_5|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_5|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_5| |v_thread3Thread1of1ForFork1_plus_~a#1_5|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_5| |v_thread3Thread1of1ForFork1_~tmp~2#1_7|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|) (< |v_thread3Thread1of1ForFork1_~i~2#1_17| v_~N~0_20))) InVars {~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, ~A~0.offset=v_~A~0.offset_44, #memory_int=|v_#memory_int_88|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_5|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_5|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_5|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_5|, ~A~0.offset=v_~A~0.offset_44, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_7|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_5|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_5|, #memory_int=|v_#memory_int_88|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_5|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1] and [967] $Ultimate##0-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_23| |v_thread1Thread1of1ForFork2_plus_~b#1_23|))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23| (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_23| 0)) 1 0)) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_23| 2147483647) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_23|) (= v_~res1~0_89 |v_thread1Thread1of1ForFork2_plus_#in~a#1_23|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_25| 2147483648)) (= |v_thread1Thread1of1ForFork2_plus_~b#1_23| |v_thread1Thread1of1ForFork2_plus_#in~b#1_23|) (= (+ (select (select |v_#memory_int_220| v_~B~0.base_104) v_~B~0.offset_104) (select (select |v_#memory_int_220| v_~A~0.base_108) v_~A~0.offset_108)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_23|) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_25| 2147483647) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_23| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|) (= |v_thread1Thread1of1ForFork2_~i~0#1_48| 1) (< 0 v_~N~0_115) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_25| |v_thread1Thread1of1ForFork2_plus_#res#1_23|) (= |v_thread1Thread1of1ForFork2_plus_~a#1_23| |v_thread1Thread1of1ForFork2_plus_#in~a#1_23|) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_23| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_25| v_~res1~0_88))) InVars {~res1~0=v_~res1~0_89, ~A~0.base=v_~A~0.base_108, ~B~0.base=v_~B~0.base_104, ~A~0.offset=v_~A~0.offset_108, #memory_int=|v_#memory_int_220|, ~N~0=v_~N~0_115, ~B~0.offset=v_~B~0.offset_104} OutVars{~res1~0=v_~res1~0_88, ~A~0.base=v_~A~0.base_108, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_23|, ~B~0.base=v_~B~0.base_104, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_23|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_25|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_23|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_23|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_23|, ~N~0=v_~N~0_115, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_23|, ~A~0.offset=v_~A~0.offset_108, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_48|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_23|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_23|, #memory_int=|v_#memory_int_220|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_23|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_23|, ~B~0.offset=v_~B~0.offset_104, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_23|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_23|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:39:50,885 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [847] L74-4-->L77: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|))) (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_5| 0)) 1 0)) (= v_~res2~0_47 |v_thread3Thread1of1ForFork1_plus_#in~a#1_5|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483647) (= (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_17| 4))) (+ (select (select |v_#memory_int_88| v_~B~0.base_42) (+ .cse1 v_~B~0.offset_42)) (select (select |v_#memory_int_88| v_~A~0.base_44) (+ .cse1 v_~A~0.offset_44)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_5|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_5|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_5| |v_thread3Thread1of1ForFork1_plus_~a#1_5|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_5| |v_thread3Thread1of1ForFork1_~tmp~2#1_7|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|) (< |v_thread3Thread1of1ForFork1_~i~2#1_17| v_~N~0_20))) InVars {~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, ~A~0.offset=v_~A~0.offset_44, #memory_int=|v_#memory_int_88|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_5|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_5|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_5|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_5|, ~A~0.offset=v_~A~0.offset_44, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_7|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_5|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_5|, #memory_int=|v_#memory_int_88|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_5|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1] and [931] L64-->L61-4: Formula: (and (= v_~res2~0_86 |v_thread2Thread1of1ForFork0_~tmp~1#1_23|) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_30| 1) |v_thread2Thread1of1ForFork0_~i~1#1_29|)) InVars {thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_23|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_30|} OutVars{thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_23|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_29|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_19|, ~res2~0=v_~res2~0_86} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post6#1, ~res2~0] [2022-12-06 07:39:50,999 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:39:51,000 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 808 [2022-12-06 07:39:51,000 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 282 transitions, 5382 flow [2022-12-06 07:39:51,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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 07:39:51,000 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:51,001 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:51,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 07:39:51,001 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:51,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:51,001 INFO L85 PathProgramCache]: Analyzing trace with hash -81182574, now seen corresponding path program 1 times [2022-12-06 07:39:51,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:51,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817513473] [2022-12-06 07:39:51,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:51,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:51,062 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 07:39:51,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:51,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817513473] [2022-12-06 07:39:51,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817513473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:39:51,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:39:51,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:39:51,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4306307] [2022-12-06 07:39:51,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:51,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:39:51,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:51,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:39:51,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:39:51,063 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 55 [2022-12-06 07:39:51,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 282 transitions, 5382 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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 07:39:51,064 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:51,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 55 [2022-12-06 07:39:51,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:51,944 INFO L130 PetriNetUnfolder]: 3886/5930 cut-off events. [2022-12-06 07:39:51,945 INFO L131 PetriNetUnfolder]: For 113194/113505 co-relation queries the response was YES. [2022-12-06 07:39:51,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42994 conditions, 5930 events. 3886/5930 cut-off events. For 113194/113505 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 34269 event pairs, 1968 based on Foata normal form. 238/6060 useless extension candidates. Maximal degree in co-relation 42215. Up to 4393 conditions per place. [2022-12-06 07:39:51,989 INFO L137 encePairwiseOnDemand]: 47/55 looper letters, 259 selfloop transitions, 17 changer transitions 0/292 dead transitions. [2022-12-06 07:39:51,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 292 transitions, 5836 flow [2022-12-06 07:39:51,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:39:51,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:39:51,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-06 07:39:51,990 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42727272727272725 [2022-12-06 07:39:51,990 INFO L175 Difference]: Start difference. First operand has 152 places, 282 transitions, 5382 flow. Second operand 4 states and 94 transitions. [2022-12-06 07:39:51,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 292 transitions, 5836 flow [2022-12-06 07:39:52,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 292 transitions, 5737 flow, removed 21 selfloop flow, removed 7 redundant places. [2022-12-06 07:39:52,203 INFO L231 Difference]: Finished difference. Result has 141 places, 243 transitions, 4583 flow [2022-12-06 07:39:52,203 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=4483, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4583, PETRI_PLACES=141, PETRI_TRANSITIONS=243} [2022-12-06 07:39:52,204 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 108 predicate places. [2022-12-06 07:39:52,204 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:52,204 INFO L89 Accepts]: Start accepts. Operand has 141 places, 243 transitions, 4583 flow [2022-12-06 07:39:52,205 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:52,205 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:52,205 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 243 transitions, 4583 flow [2022-12-06 07:39:52,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 243 transitions, 4583 flow [2022-12-06 07:39:52,296 INFO L130 PetriNetUnfolder]: 344/954 cut-off events. [2022-12-06 07:39:52,296 INFO L131 PetriNetUnfolder]: For 12022/12223 co-relation queries the response was YES. [2022-12-06 07:39:52,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6637 conditions, 954 events. 344/954 cut-off events. For 12022/12223 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7013 event pairs, 37 based on Foata normal form. 27/951 useless extension candidates. Maximal degree in co-relation 6465. Up to 250 conditions per place. [2022-12-06 07:39:52,306 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 243 transitions, 4583 flow [2022-12-06 07:39:52,306 INFO L188 LiptonReduction]: Number of co-enabled transitions 1872 [2022-12-06 07:39:52,341 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] $Ultimate##0-->L74-4: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_1| v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2#1] and [966] $Ultimate##0-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_~b#1_21|))) (and (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_21| 0) (<= .cse0 2147483647)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (< 0 v_~N~0_113) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| |v_thread1Thread1of1ForFork2_plus_#res#1_21|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483647) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483648)) (= (+ (select (select |v_#memory_int_218| v_~B~0.base_102) v_~B~0.offset_102) (select (select |v_#memory_int_218| v_~A~0.base_106) v_~A~0.offset_106)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (= |v_thread1Thread1of1ForFork2_~i~0#1_44| 1) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (= v_~res1~0_85 |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= |v_thread1Thread1of1ForFork2_plus_~b#1_21| |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| v_~res1~0_84) (= |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_21|))) InVars {~res1~0=v_~res1~0_85, ~A~0.base=v_~A~0.base_106, ~B~0.base=v_~B~0.base_102, ~A~0.offset=v_~A~0.offset_106, #memory_int=|v_#memory_int_218|, ~N~0=v_~N~0_113, ~B~0.offset=v_~B~0.offset_102} OutVars{~res1~0=v_~res1~0_84, ~A~0.base=v_~A~0.base_106, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_21|, ~B~0.base=v_~B~0.base_102, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_21|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_23|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_21|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_21|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_21|, ~N~0=v_~N~0_113, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_21|, ~A~0.offset=v_~A~0.offset_106, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_44|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_21|, #memory_int=|v_#memory_int_218|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_21|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_21|, ~B~0.offset=v_~B~0.offset_102, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:39:52,856 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:39:52,857 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 653 [2022-12-06 07:39:52,857 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 243 transitions, 4613 flow [2022-12-06 07:39:52,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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 07:39:52,857 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:52,857 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:52,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 07:39:52,857 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:52,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:52,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1618178568, now seen corresponding path program 1 times [2022-12-06 07:39:52,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:52,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397360235] [2022-12-06 07:39:52,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:52,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:52,938 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 07:39:52,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:52,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397360235] [2022-12-06 07:39:52,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397360235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:39:52,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:39:52,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:39:52,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146472691] [2022-12-06 07:39:52,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:52,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:39:52,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:52,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:39:52,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:39:52,939 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 54 [2022-12-06 07:39:52,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 243 transitions, 4613 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:52,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:52,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 54 [2022-12-06 07:39:52,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:53,761 INFO L130 PetriNetUnfolder]: 3225/5090 cut-off events. [2022-12-06 07:39:53,761 INFO L131 PetriNetUnfolder]: For 96210/96326 co-relation queries the response was YES. [2022-12-06 07:39:53,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34689 conditions, 5090 events. 3225/5090 cut-off events. For 96210/96326 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 29591 event pairs, 927 based on Foata normal form. 432/5493 useless extension candidates. Maximal degree in co-relation 34131. Up to 2231 conditions per place. [2022-12-06 07:39:53,793 INFO L137 encePairwiseOnDemand]: 31/54 looper letters, 192 selfloop transitions, 44 changer transitions 7/250 dead transitions. [2022-12-06 07:39:53,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 250 transitions, 4432 flow [2022-12-06 07:39:53,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:39:53,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:39:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2022-12-06 07:39:53,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.345679012345679 [2022-12-06 07:39:53,794 INFO L175 Difference]: Start difference. First operand has 141 places, 243 transitions, 4613 flow. Second operand 6 states and 112 transitions. [2022-12-06 07:39:53,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 250 transitions, 4432 flow [2022-12-06 07:39:53,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 250 transitions, 4133 flow, removed 46 selfloop flow, removed 7 redundant places. [2022-12-06 07:39:53,969 INFO L231 Difference]: Finished difference. Result has 141 places, 191 transitions, 3296 flow [2022-12-06 07:39:53,969 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3163, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3296, PETRI_PLACES=141, PETRI_TRANSITIONS=191} [2022-12-06 07:39:53,970 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 108 predicate places. [2022-12-06 07:39:53,970 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:53,970 INFO L89 Accepts]: Start accepts. Operand has 141 places, 191 transitions, 3296 flow [2022-12-06 07:39:53,971 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:53,971 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:53,971 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 191 transitions, 3296 flow [2022-12-06 07:39:53,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 191 transitions, 3296 flow [2022-12-06 07:39:54,040 INFO L130 PetriNetUnfolder]: 262/786 cut-off events. [2022-12-06 07:39:54,040 INFO L131 PetriNetUnfolder]: For 8567/8698 co-relation queries the response was YES. [2022-12-06 07:39:54,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5129 conditions, 786 events. 262/786 cut-off events. For 8567/8698 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5674 event pairs, 36 based on Foata normal form. 21/779 useless extension candidates. Maximal degree in co-relation 4906. Up to 199 conditions per place. [2022-12-06 07:39:54,048 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 191 transitions, 3296 flow [2022-12-06 07:39:54,048 INFO L188 LiptonReduction]: Number of co-enabled transitions 1394 [2022-12-06 07:39:54,176 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1008] $Ultimate##0-->L77: Formula: (let ((.cse1 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_76| |v_thread3Thread1of1ForFork1_plus_~b#1_76|))) (and (= (let ((.cse0 (* |v_thread3Thread1of1ForFork1_~i~2#1_161| 4))) (+ (select (select |v_#memory_int_352| v_~B~0.base_196) (+ .cse0 v_~B~0.offset_198)) (select (select |v_#memory_int_352| v_~A~0.base_204) (+ .cse0 v_~A~0.offset_206)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_76|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_76| (ite (or (<= .cse1 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_76| 0)) 1 0)) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_76| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_76| |v_thread3Thread1of1ForFork1_plus_~b#1_76|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_76| .cse1) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_102| 2147483647) (= |v_thread2Thread1of1ForFork0_~i~1#1_110| 0) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_102| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_76| v_~res2~0_213) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_76| |v_thread3Thread1of1ForFork1_plus_~a#1_76|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_76| 2147483648)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_76| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_76|) (< |v_thread3Thread1of1ForFork1_~i~2#1_161| v_~N~0_208) (= |v_thread3Thread1of1ForFork1_plus_#res#1_76| |v_thread3Thread1of1ForFork1_~tmp~2#1_102|) (= v_~M~0_142 |v_thread3Thread1of1ForFork1_~i~2#1_161|))) InVars {~A~0.base=v_~A~0.base_204, ~B~0.base=v_~B~0.base_196, ~A~0.offset=v_~A~0.offset_206, ~M~0=v_~M~0_142, #memory_int=|v_#memory_int_352|, ~N~0=v_~N~0_208, ~B~0.offset=v_~B~0.offset_198, ~res2~0=v_~res2~0_213} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_76|, ~A~0.base=v_~A~0.base_204, ~B~0.base=v_~B~0.base_196, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_76|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_76|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_76|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_76|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_110|, ~N~0=v_~N~0_208, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_76|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_161|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_76|, ~A~0.offset=v_~A~0.offset_206, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_102|, ~M~0=v_~M~0_142, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_76|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_76|, #memory_int=|v_#memory_int_352|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_76|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_76|, ~B~0.offset=v_~B~0.offset_198, ~res2~0=v_~res2~0_213} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork0_~i~1#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1] and [966] $Ultimate##0-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_~b#1_21|))) (and (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_21| 0) (<= .cse0 2147483647)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (< 0 v_~N~0_113) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| |v_thread1Thread1of1ForFork2_plus_#res#1_21|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483647) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483648)) (= (+ (select (select |v_#memory_int_218| v_~B~0.base_102) v_~B~0.offset_102) (select (select |v_#memory_int_218| v_~A~0.base_106) v_~A~0.offset_106)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (= |v_thread1Thread1of1ForFork2_~i~0#1_44| 1) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (= v_~res1~0_85 |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= |v_thread1Thread1of1ForFork2_plus_~b#1_21| |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| v_~res1~0_84) (= |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_21|))) InVars {~res1~0=v_~res1~0_85, ~A~0.base=v_~A~0.base_106, ~B~0.base=v_~B~0.base_102, ~A~0.offset=v_~A~0.offset_106, #memory_int=|v_#memory_int_218|, ~N~0=v_~N~0_113, ~B~0.offset=v_~B~0.offset_102} OutVars{~res1~0=v_~res1~0_84, ~A~0.base=v_~A~0.base_106, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_21|, ~B~0.base=v_~B~0.base_102, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_21|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_23|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_21|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_21|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_21|, ~N~0=v_~N~0_113, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_21|, ~A~0.offset=v_~A~0.offset_106, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_44|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_21|, #memory_int=|v_#memory_int_218|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_21|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_21|, ~B~0.offset=v_~B~0.offset_102, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:39:54,497 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [952] L74-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< |v_thread3Thread1of1ForFork1_~i~2#1_In_3| v_~N~0_In_10))) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_In_3|, ~N~0=v_~N~0_In_10} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_Out_4|, ~N~0=v_~N~0_In_10, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_In_3|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base] and [946] L48-4-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_17| |v_thread1Thread1of1ForFork2_plus_~b#1_17|))) (and (= |v_thread1Thread1of1ForFork2_plus_#res#1_17| .cse0) (= v_~res1~0_74 |v_thread1Thread1of1ForFork2_plus_#in~a#1_17|) (< |v_thread1Thread1of1ForFork2_~i~0#1_38| v_~N~0_96) (= (let ((.cse1 (* |v_thread1Thread1of1ForFork2_~i~0#1_38| 4))) (+ (select (select |v_#memory_int_182| v_~A~0.base_84) (+ v_~A~0.offset_84 .cse1)) (select (select |v_#memory_int_182| v_~B~0.base_82) (+ v_~B~0.offset_82 .cse1)))) |v_thread1Thread1of1ForFork2_plus_#in~b#1_17|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_17| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_17| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_19| 2147483648)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_17| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_17| 2147483648)) (= |v_thread1Thread1of1ForFork2_plus_~a#1_17| |v_thread1Thread1of1ForFork2_plus_#in~a#1_17|) (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_38| 1) |v_thread1Thread1of1ForFork2_~i~0#1_37|) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_19| |v_thread1Thread1of1ForFork2_plus_#res#1_17|) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_19| v_~res1~0_73) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_19| 2147483647) (= |v_thread1Thread1of1ForFork2_plus_~b#1_17| |v_thread1Thread1of1ForFork2_plus_#in~b#1_17|))) InVars {~res1~0=v_~res1~0_74, ~A~0.base=v_~A~0.base_84, ~B~0.base=v_~B~0.base_82, ~A~0.offset=v_~A~0.offset_84, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_38|, #memory_int=|v_#memory_int_182|, ~N~0=v_~N~0_96, ~B~0.offset=v_~B~0.offset_82} OutVars{~res1~0=v_~res1~0_73, ~A~0.base=v_~A~0.base_84, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_17|, ~B~0.base=v_~B~0.base_82, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_17|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_19|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_17|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_17|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_17|, ~N~0=v_~N~0_96, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0.offset=v_~A~0.offset_84, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_37|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_17|, #memory_int=|v_#memory_int_182|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_17|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_17|, ~B~0.offset=v_~B~0.offset_82, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_17|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:39:54,682 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:39:54,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 713 [2022-12-06 07:39:54,683 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 189 transitions, 3300 flow [2022-12-06 07:39:54,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:54,683 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:54,683 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:54,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 07:39:54,683 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:54,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:54,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1054547083, now seen corresponding path program 1 times [2022-12-06 07:39:54,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:54,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259725676] [2022-12-06 07:39:54,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:54,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:55,140 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 07:39:55,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:55,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259725676] [2022-12-06 07:39:55,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259725676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:39:55,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:39:55,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 07:39:55,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011797167] [2022-12-06 07:39:55,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:55,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:39:55,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:55,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:39:55,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:39:55,143 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-06 07:39:55,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 189 transitions, 3300 flow. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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 07:39:55,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:55,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-06 07:39:55,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:55,967 INFO L130 PetriNetUnfolder]: 3238/5097 cut-off events. [2022-12-06 07:39:55,968 INFO L131 PetriNetUnfolder]: For 80284/80397 co-relation queries the response was YES. [2022-12-06 07:39:55,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34595 conditions, 5097 events. 3238/5097 cut-off events. For 80284/80397 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 29900 event pairs, 1256 based on Foata normal form. 88/5154 useless extension candidates. Maximal degree in co-relation 32643. Up to 3881 conditions per place. [2022-12-06 07:39:55,997 INFO L137 encePairwiseOnDemand]: 21/50 looper letters, 126 selfloop transitions, 94 changer transitions 9/236 dead transitions. [2022-12-06 07:39:55,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 236 transitions, 4031 flow [2022-12-06 07:39:55,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:39:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:39:55,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2022-12-06 07:39:55,998 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29 [2022-12-06 07:39:55,998 INFO L175 Difference]: Start difference. First operand has 138 places, 189 transitions, 3300 flow. Second operand 8 states and 116 transitions. [2022-12-06 07:39:55,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 236 transitions, 4031 flow [2022-12-06 07:39:56,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 236 transitions, 3888 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-12-06 07:39:56,156 INFO L231 Difference]: Finished difference. Result has 142 places, 192 transitions, 3495 flow [2022-12-06 07:39:56,157 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3167, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3495, PETRI_PLACES=142, PETRI_TRANSITIONS=192} [2022-12-06 07:39:56,157 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 109 predicate places. [2022-12-06 07:39:56,157 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:56,157 INFO L89 Accepts]: Start accepts. Operand has 142 places, 192 transitions, 3495 flow [2022-12-06 07:39:56,158 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:56,158 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:56,158 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 192 transitions, 3495 flow [2022-12-06 07:39:56,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 192 transitions, 3495 flow [2022-12-06 07:39:56,226 INFO L130 PetriNetUnfolder]: 260/782 cut-off events. [2022-12-06 07:39:56,226 INFO L131 PetriNetUnfolder]: For 8752/8895 co-relation queries the response was YES. [2022-12-06 07:39:56,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5196 conditions, 782 events. 260/782 cut-off events. For 8752/8895 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5695 event pairs, 36 based on Foata normal form. 24/777 useless extension candidates. Maximal degree in co-relation 4972. Up to 199 conditions per place. [2022-12-06 07:39:56,234 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 192 transitions, 3495 flow [2022-12-06 07:39:56,234 INFO L188 LiptonReduction]: Number of co-enabled transitions 1416 [2022-12-06 07:39:56,238 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:39:56,239 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 07:39:56,239 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 192 transitions, 3495 flow [2022-12-06 07:39:56,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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 07:39:56,239 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:56,239 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:56,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 07:39:56,239 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:56,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:56,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1953747205, now seen corresponding path program 1 times [2022-12-06 07:39:56,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:56,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987052554] [2022-12-06 07:39:56,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:56,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:56,309 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 07:39:56,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:56,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987052554] [2022-12-06 07:39:56,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987052554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:39:56,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:39:56,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:39:56,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892474792] [2022-12-06 07:39:56,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:56,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:39:56,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:56,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:39:56,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:39:56,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 07:39:56,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 192 transitions, 3495 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 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 07:39:56,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:56,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 07:39:56,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:57,183 INFO L130 PetriNetUnfolder]: 3691/5770 cut-off events. [2022-12-06 07:39:57,183 INFO L131 PetriNetUnfolder]: For 92079/92079 co-relation queries the response was YES. [2022-12-06 07:39:57,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40282 conditions, 5770 events. 3691/5770 cut-off events. For 92079/92079 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 33205 event pairs, 1589 based on Foata normal form. 14/5784 useless extension candidates. Maximal degree in co-relation 38321. Up to 2967 conditions per place. [2022-12-06 07:39:57,221 INFO L137 encePairwiseOnDemand]: 28/50 looper letters, 223 selfloop transitions, 93 changer transitions 0/316 dead transitions. [2022-12-06 07:39:57,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 316 transitions, 5465 flow [2022-12-06 07:39:57,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 07:39:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 07:39:57,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2022-12-06 07:39:57,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3488888888888889 [2022-12-06 07:39:57,231 INFO L175 Difference]: Start difference. First operand has 142 places, 192 transitions, 3495 flow. Second operand 9 states and 157 transitions. [2022-12-06 07:39:57,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 316 transitions, 5465 flow [2022-12-06 07:39:57,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 316 transitions, 5397 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-12-06 07:39:57,449 INFO L231 Difference]: Finished difference. Result has 152 places, 220 transitions, 4288 flow [2022-12-06 07:39:57,449 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3416, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4288, PETRI_PLACES=152, PETRI_TRANSITIONS=220} [2022-12-06 07:39:57,450 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 119 predicate places. [2022-12-06 07:39:57,450 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:57,450 INFO L89 Accepts]: Start accepts. Operand has 152 places, 220 transitions, 4288 flow [2022-12-06 07:39:57,451 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:57,451 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:57,451 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 220 transitions, 4288 flow [2022-12-06 07:39:57,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 220 transitions, 4288 flow [2022-12-06 07:39:57,538 INFO L130 PetriNetUnfolder]: 322/897 cut-off events. [2022-12-06 07:39:57,538 INFO L131 PetriNetUnfolder]: For 13002/13193 co-relation queries the response was YES. [2022-12-06 07:39:57,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6794 conditions, 897 events. 322/897 cut-off events. For 13002/13193 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6488 event pairs, 38 based on Foata normal form. 17/880 useless extension candidates. Maximal degree in co-relation 6556. Up to 267 conditions per place. [2022-12-06 07:39:57,548 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 220 transitions, 4288 flow [2022-12-06 07:39:57,548 INFO L188 LiptonReduction]: Number of co-enabled transitions 1674 [2022-12-06 07:39:57,551 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:39:57,552 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 07:39:57,552 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 220 transitions, 4288 flow [2022-12-06 07:39:57,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 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 07:39:57,552 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:57,552 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:57,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 07:39:57,552 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:57,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:57,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1027887870, now seen corresponding path program 1 times [2022-12-06 07:39:57,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:57,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882977948] [2022-12-06 07:39:57,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:57,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:57,606 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 07:39:57,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:57,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882977948] [2022-12-06 07:39:57,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882977948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:39:57,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:39:57,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:39:57,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19800097] [2022-12-06 07:39:57,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:57,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:39:57,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:57,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:39:57,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:39:57,607 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 07:39:57,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 220 transitions, 4288 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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 07:39:57,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:57,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 07:39:57,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:58,150 INFO L130 PetriNetUnfolder]: 2242/3555 cut-off events. [2022-12-06 07:39:58,151 INFO L131 PetriNetUnfolder]: For 73623/73623 co-relation queries the response was YES. [2022-12-06 07:39:58,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28104 conditions, 3555 events. 2242/3555 cut-off events. For 73623/73623 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18856 event pairs, 998 based on Foata normal form. 222/3777 useless extension candidates. Maximal degree in co-relation 28047. Up to 2101 conditions per place. [2022-12-06 07:39:58,173 INFO L137 encePairwiseOnDemand]: 41/49 looper letters, 137 selfloop transitions, 5 changer transitions 48/190 dead transitions. [2022-12-06 07:39:58,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 190 transitions, 3910 flow [2022-12-06 07:39:58,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:39:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:39:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-06 07:39:58,174 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42346938775510207 [2022-12-06 07:39:58,174 INFO L175 Difference]: Start difference. First operand has 152 places, 220 transitions, 4288 flow. Second operand 4 states and 83 transitions. [2022-12-06 07:39:58,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 190 transitions, 3910 flow [2022-12-06 07:39:58,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 190 transitions, 3559 flow, removed 39 selfloop flow, removed 13 redundant places. [2022-12-06 07:39:58,286 INFO L231 Difference]: Finished difference. Result has 139 places, 119 transitions, 2093 flow [2022-12-06 07:39:58,286 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2949, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2093, PETRI_PLACES=139, PETRI_TRANSITIONS=119} [2022-12-06 07:39:58,287 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 106 predicate places. [2022-12-06 07:39:58,287 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:58,287 INFO L89 Accepts]: Start accepts. Operand has 139 places, 119 transitions, 2093 flow [2022-12-06 07:39:58,288 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:58,288 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:58,288 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 119 transitions, 2093 flow [2022-12-06 07:39:58,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 119 transitions, 2093 flow [2022-12-06 07:39:58,332 INFO L130 PetriNetUnfolder]: 223/488 cut-off events. [2022-12-06 07:39:58,332 INFO L131 PetriNetUnfolder]: For 6586/6752 co-relation queries the response was YES. [2022-12-06 07:39:58,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4119 conditions, 488 events. 223/488 cut-off events. For 6586/6752 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2457 event pairs, 20 based on Foata normal form. 12/474 useless extension candidates. Maximal degree in co-relation 4049. Up to 215 conditions per place. [2022-12-06 07:39:58,337 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 119 transitions, 2093 flow [2022-12-06 07:39:58,337 INFO L188 LiptonReduction]: Number of co-enabled transitions 818 [2022-12-06 07:39:58,445 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:39:58,445 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-06 07:39:58,445 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 119 transitions, 2101 flow [2022-12-06 07:39:58,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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 07:39:58,446 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:58,446 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:58,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 07:39:58,446 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:58,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:58,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1900491796, now seen corresponding path program 1 times [2022-12-06 07:39:58,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:58,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055026190] [2022-12-06 07:39:58,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:58,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:58,494 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 07:39:58,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:58,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055026190] [2022-12-06 07:39:58,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055026190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:39:58,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:39:58,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:39:58,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111791460] [2022-12-06 07:39:58,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:39:58,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:39:58,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:39:58,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:39:58,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:39:58,495 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 37 [2022-12-06 07:39:58,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 119 transitions, 2101 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:58,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:39:58,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 37 [2022-12-06 07:39:58,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:39:59,057 INFO L130 PetriNetUnfolder]: 2929/4323 cut-off events. [2022-12-06 07:39:59,057 INFO L131 PetriNetUnfolder]: For 105497/106046 co-relation queries the response was YES. [2022-12-06 07:39:59,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36219 conditions, 4323 events. 2929/4323 cut-off events. For 105497/106046 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 21653 event pairs, 1286 based on Foata normal form. 286/4485 useless extension candidates. Maximal degree in co-relation 36124. Up to 1985 conditions per place. [2022-12-06 07:39:59,090 INFO L137 encePairwiseOnDemand]: 30/37 looper letters, 199 selfloop transitions, 7 changer transitions 0/223 dead transitions. [2022-12-06 07:39:59,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 223 transitions, 4187 flow [2022-12-06 07:39:59,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:39:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:39:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-06 07:39:59,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5243243243243243 [2022-12-06 07:39:59,091 INFO L175 Difference]: Start difference. First operand has 114 places, 119 transitions, 2101 flow. Second operand 5 states and 97 transitions. [2022-12-06 07:39:59,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 223 transitions, 4187 flow [2022-12-06 07:39:59,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 223 transitions, 3423 flow, removed 61 selfloop flow, removed 22 redundant places. [2022-12-06 07:39:59,206 INFO L231 Difference]: Finished difference. Result has 98 places, 123 transitions, 1729 flow [2022-12-06 07:39:59,207 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1686, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1729, PETRI_PLACES=98, PETRI_TRANSITIONS=123} [2022-12-06 07:39:59,207 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 65 predicate places. [2022-12-06 07:39:59,207 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:39:59,207 INFO L89 Accepts]: Start accepts. Operand has 98 places, 123 transitions, 1729 flow [2022-12-06 07:39:59,208 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:39:59,208 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:39:59,208 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 123 transitions, 1729 flow [2022-12-06 07:39:59,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 123 transitions, 1729 flow [2022-12-06 07:39:59,283 INFO L130 PetriNetUnfolder]: 439/928 cut-off events. [2022-12-06 07:39:59,283 INFO L131 PetriNetUnfolder]: For 8212/8523 co-relation queries the response was YES. [2022-12-06 07:39:59,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6505 conditions, 928 events. 439/928 cut-off events. For 8212/8523 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5372 event pairs, 40 based on Foata normal form. 23/898 useless extension candidates. Maximal degree in co-relation 5607. Up to 425 conditions per place. [2022-12-06 07:39:59,296 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 123 transitions, 1729 flow [2022-12-06 07:39:59,296 INFO L188 LiptonReduction]: Number of co-enabled transitions 818 [2022-12-06 07:39:59,297 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:39:59,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 90 [2022-12-06 07:39:59,297 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 123 transitions, 1729 flow [2022-12-06 07:39:59,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:39:59,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:39:59,298 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:39:59,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 07:39:59,298 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:39:59,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:39:59,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1736678054, now seen corresponding path program 1 times [2022-12-06 07:39:59,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:39:59,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519521814] [2022-12-06 07:39:59,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:59,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:39:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:39:59,960 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 07:39:59,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:39:59,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519521814] [2022-12-06 07:39:59,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519521814] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:39:59,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099202646] [2022-12-06 07:39:59,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:39:59,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:39:59,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:39:59,962 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 07:39:59,962 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 07:40:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:40:00,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 78 conjunts are in the unsatisfiable core [2022-12-06 07:40:00,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:40:00,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:00,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:00,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-12-06 07:40:00,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:00,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2022-12-06 07:40:00,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-12-06 07:40:00,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-12-06 07:40:00,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-12-06 07:40:00,135 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 6 treesize of output 5 [2022-12-06 07:40:00,177 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 6 treesize of output 5 [2022-12-06 07:40:00,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:00,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2022-12-06 07:40:00,330 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:40:00,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 31 [2022-12-06 07:40:00,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 07:40:00,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:40:02,503 WARN L837 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_947 (Array Int Int))) (or (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_947)) (.cse1 (* ~M~0 4))) (+ (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)) c_~res2~0)) c_~res1~0) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-12-06 07:40:02,657 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 07:40:02,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099202646] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:40:02,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:40:02,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 19 [2022-12-06 07:40:02,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063038668] [2022-12-06 07:40:02,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:40:02,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 07:40:02,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:40:02,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 07:40:02,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=322, Unknown=3, NotChecked=36, Total=420 [2022-12-06 07:40:02,658 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:40:02,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 123 transitions, 1729 flow. Second operand has 21 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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 07:40:02,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:40:02,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:40:02,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:40:17,055 WARN L233 SmtUtils]: Spent 14.20s on a formula simplification. DAG size of input: 57 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:40:18,537 INFO L130 PetriNetUnfolder]: 3405/5116 cut-off events. [2022-12-06 07:40:18,537 INFO L131 PetriNetUnfolder]: For 61523/61523 co-relation queries the response was YES. [2022-12-06 07:40:18,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34917 conditions, 5116 events. 3405/5116 cut-off events. For 61523/61523 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 25672 event pairs, 990 based on Foata normal form. 1/5117 useless extension candidates. Maximal degree in co-relation 28521. Up to 3438 conditions per place. [2022-12-06 07:40:18,573 INFO L137 encePairwiseOnDemand]: 13/37 looper letters, 133 selfloop transitions, 71 changer transitions 21/225 dead transitions. [2022-12-06 07:40:18,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 225 transitions, 2825 flow [2022-12-06 07:40:18,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:40:18,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:40:18,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2022-12-06 07:40:18,574 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2993762993762994 [2022-12-06 07:40:18,574 INFO L175 Difference]: Start difference. First operand has 98 places, 123 transitions, 1729 flow. Second operand 13 states and 144 transitions. [2022-12-06 07:40:18,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 225 transitions, 2825 flow [2022-12-06 07:40:18,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 225 transitions, 2825 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 07:40:18,651 INFO L231 Difference]: Finished difference. Result has 116 places, 139 transitions, 2140 flow [2022-12-06 07:40:18,652 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1729, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2140, PETRI_PLACES=116, PETRI_TRANSITIONS=139} [2022-12-06 07:40:18,652 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 83 predicate places. [2022-12-06 07:40:18,652 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:40:18,652 INFO L89 Accepts]: Start accepts. Operand has 116 places, 139 transitions, 2140 flow [2022-12-06 07:40:18,653 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:40:18,653 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:40:18,653 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 139 transitions, 2140 flow [2022-12-06 07:40:18,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 139 transitions, 2140 flow [2022-12-06 07:40:18,746 INFO L130 PetriNetUnfolder]: 493/1101 cut-off events. [2022-12-06 07:40:18,747 INFO L131 PetriNetUnfolder]: For 11132/11356 co-relation queries the response was YES. [2022-12-06 07:40:18,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7994 conditions, 1101 events. 493/1101 cut-off events. For 11132/11356 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6708 event pairs, 41 based on Foata normal form. 29/1094 useless extension candidates. Maximal degree in co-relation 7936. Up to 485 conditions per place. [2022-12-06 07:40:18,757 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 139 transitions, 2140 flow [2022-12-06 07:40:18,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 906 [2022-12-06 07:40:18,875 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:40:18,875 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 07:40:18,875 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 139 transitions, 2153 flow [2022-12-06 07:40:18,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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 07:40:18,876 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:40:18,876 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:40:18,880 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 07:40:19,079 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,SelfDestructingSolverStorable22 [2022-12-06 07:40:19,079 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:40:19,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:40:19,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1887045886, now seen corresponding path program 2 times [2022-12-06 07:40:19,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:40:19,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750438476] [2022-12-06 07:40:19,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:40:19,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:40:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:40:19,684 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 07:40:19,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:40:19,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750438476] [2022-12-06 07:40:19,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750438476] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:40:19,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530998275] [2022-12-06 07:40:19,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:40:19,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:40:19,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:40:19,686 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 07:40:19,687 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 07:40:19,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:40:19,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:40:19,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-06 07:40:19,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:40:19,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:19,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:19,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:19,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 07:40:19,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-12-06 07:40:19,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:19,869 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 9 treesize of output 11 [2022-12-06 07:40:20,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:20,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:20,051 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 07:40:20,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2022-12-06 07:40:20,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:20,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:20,126 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 07:40:20,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2022-12-06 07:40:20,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 07:40:20,229 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-06 07:40:20,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 25 [2022-12-06 07:40:20,242 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 07:40:20,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:40:20,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:40:20,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530998275] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:40:20,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:40:20,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2022-12-06 07:40:20,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787650826] [2022-12-06 07:40:20,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:40:20,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 07:40:20,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:40:20,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 07:40:20,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=302, Unknown=4, NotChecked=0, Total=380 [2022-12-06 07:40:20,412 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 07:40:20,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 139 transitions, 2153 flow. Second operand has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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 07:40:20,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:40:20,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 07:40:20,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:40:21,543 INFO L130 PetriNetUnfolder]: 3369/5062 cut-off events. [2022-12-06 07:40:21,544 INFO L131 PetriNetUnfolder]: For 73258/73258 co-relation queries the response was YES. [2022-12-06 07:40:21,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37530 conditions, 5062 events. 3369/5062 cut-off events. For 73258/73258 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 25234 event pairs, 890 based on Foata normal form. 1/5063 useless extension candidates. Maximal degree in co-relation 37462. Up to 3257 conditions per place. [2022-12-06 07:40:21,589 INFO L137 encePairwiseOnDemand]: 19/38 looper letters, 135 selfloop transitions, 63 changer transitions 12/210 dead transitions. [2022-12-06 07:40:21,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 210 transitions, 2902 flow [2022-12-06 07:40:21,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:40:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:40:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2022-12-06 07:40:21,590 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3368421052631579 [2022-12-06 07:40:21,591 INFO L175 Difference]: Start difference. First operand has 114 places, 139 transitions, 2153 flow. Second operand 10 states and 128 transitions. [2022-12-06 07:40:21,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 210 transitions, 2902 flow [2022-12-06 07:40:21,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 210 transitions, 2804 flow, removed 34 selfloop flow, removed 3 redundant places. [2022-12-06 07:40:21,719 INFO L231 Difference]: Finished difference. Result has 121 places, 138 transitions, 2160 flow [2022-12-06 07:40:21,719 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=2059, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2160, PETRI_PLACES=121, PETRI_TRANSITIONS=138} [2022-12-06 07:40:21,720 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 88 predicate places. [2022-12-06 07:40:21,720 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:40:21,720 INFO L89 Accepts]: Start accepts. Operand has 121 places, 138 transitions, 2160 flow [2022-12-06 07:40:21,720 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:40:21,720 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:40:21,721 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 138 transitions, 2160 flow [2022-12-06 07:40:21,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 138 transitions, 2160 flow [2022-12-06 07:40:21,822 INFO L130 PetriNetUnfolder]: 547/1215 cut-off events. [2022-12-06 07:40:21,822 INFO L131 PetriNetUnfolder]: For 13082/13435 co-relation queries the response was YES. [2022-12-06 07:40:21,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8765 conditions, 1215 events. 547/1215 cut-off events. For 13082/13435 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7656 event pairs, 51 based on Foata normal form. 24/1177 useless extension candidates. Maximal degree in co-relation 8706. Up to 484 conditions per place. [2022-12-06 07:40:21,834 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 138 transitions, 2160 flow [2022-12-06 07:40:21,834 INFO L188 LiptonReduction]: Number of co-enabled transitions 896 [2022-12-06 07:40:21,963 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [952] L74-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_Out_4| 0) (not (< |v_thread3Thread1of1ForFork1_~i~2#1_In_3| v_~N~0_In_10))) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_In_3|, ~N~0=v_~N~0_In_10} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_Out_4|, ~N~0=v_~N~0_In_10, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_In_3|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base] and [931] L64-->L61-4: Formula: (and (= v_~res2~0_86 |v_thread2Thread1of1ForFork0_~tmp~1#1_23|) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_30| 1) |v_thread2Thread1of1ForFork0_~i~1#1_29|)) InVars {thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_23|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_30|} OutVars{thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_23|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_29|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_19|, ~res2~0=v_~res2~0_86} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post6#1, ~res2~0] [2022-12-06 07:40:22,005 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:40:22,005 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 285 [2022-12-06 07:40:22,005 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 138 transitions, 2186 flow [2022-12-06 07:40:22,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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 07:40:22,006 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:40:22,006 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:40:22,013 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 07:40:22,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:40:22,214 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:40:22,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:40:22,214 INFO L85 PathProgramCache]: Analyzing trace with hash -702321757, now seen corresponding path program 1 times [2022-12-06 07:40:22,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:40:22,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478587829] [2022-12-06 07:40:22,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:40:22,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:40:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:40:22,841 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 07:40:22,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:40:22,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478587829] [2022-12-06 07:40:22,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478587829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:40:22,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:40:22,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 07:40:22,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722248945] [2022-12-06 07:40:22,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:40:22,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:40:22,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:40:22,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:40:22,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:40:22,842 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-06 07:40:22,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 138 transitions, 2186 flow. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:40:22,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:40:22,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-06 07:40:22,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:40:23,594 INFO L130 PetriNetUnfolder]: 3274/4930 cut-off events. [2022-12-06 07:40:23,594 INFO L131 PetriNetUnfolder]: For 76107/76193 co-relation queries the response was YES. [2022-12-06 07:40:23,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37125 conditions, 4930 events. 3274/4930 cut-off events. For 76107/76193 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 24985 event pairs, 1347 based on Foata normal form. 55/4951 useless extension candidates. Maximal degree in co-relation 37056. Up to 4436 conditions per place. [2022-12-06 07:40:23,626 INFO L137 encePairwiseOnDemand]: 22/38 looper letters, 117 selfloop transitions, 32 changer transitions 24/183 dead transitions. [2022-12-06 07:40:23,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 183 transitions, 2727 flow [2022-12-06 07:40:23,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:40:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:40:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2022-12-06 07:40:23,627 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32894736842105265 [2022-12-06 07:40:23,627 INFO L175 Difference]: Start difference. First operand has 120 places, 138 transitions, 2186 flow. Second operand 8 states and 100 transitions. [2022-12-06 07:40:23,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 183 transitions, 2727 flow [2022-12-06 07:40:23,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 183 transitions, 2648 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-12-06 07:40:23,714 INFO L231 Difference]: Finished difference. Result has 122 places, 132 transitions, 2107 flow [2022-12-06 07:40:23,715 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=2108, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2107, PETRI_PLACES=122, PETRI_TRANSITIONS=132} [2022-12-06 07:40:23,715 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 89 predicate places. [2022-12-06 07:40:23,715 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:40:23,715 INFO L89 Accepts]: Start accepts. Operand has 122 places, 132 transitions, 2107 flow [2022-12-06 07:40:23,716 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:40:23,716 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:40:23,716 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 132 transitions, 2107 flow [2022-12-06 07:40:23,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 132 transitions, 2107 flow [2022-12-06 07:40:23,812 INFO L130 PetriNetUnfolder]: 533/1174 cut-off events. [2022-12-06 07:40:23,812 INFO L131 PetriNetUnfolder]: For 12975/13339 co-relation queries the response was YES. [2022-12-06 07:40:23,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8603 conditions, 1174 events. 533/1174 cut-off events. For 12975/13339 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7390 event pairs, 50 based on Foata normal form. 25/1137 useless extension candidates. Maximal degree in co-relation 8550. Up to 477 conditions per place. [2022-12-06 07:40:23,823 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 132 transitions, 2107 flow [2022-12-06 07:40:23,823 INFO L188 LiptonReduction]: Number of co-enabled transitions 874 [2022-12-06 07:40:23,824 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:40:23,825 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-06 07:40:23,825 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 132 transitions, 2107 flow [2022-12-06 07:40:23,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:40:23,825 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:40:23,825 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:40:23,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 07:40:23,825 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:40:23,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:40:23,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1111616905, now seen corresponding path program 1 times [2022-12-06 07:40:23,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:40:23,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541569215] [2022-12-06 07:40:23,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:40:23,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:40:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:40:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:40:24,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:40:24,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541569215] [2022-12-06 07:40:24,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541569215] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:40:24,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959348410] [2022-12-06 07:40:24,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:40:24,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:40:24,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:40:24,329 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 07:40:24,331 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 07:40:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:40:24,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-06 07:40:24,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:40:24,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:24,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:24,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:24,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:24,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-12-06 07:40:24,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:24,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:24,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-06 07:40:24,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-12-06 07:40:24,548 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 6 treesize of output 5 [2022-12-06 07:40:24,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:24,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:24,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2022-12-06 07:40:24,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 07:40:24,816 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-12-06 07:40:24,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 14 [2022-12-06 07:40:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:40:24,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:40:24,884 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1160 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1160)) (.cse1 (* 4 c_~M~0))) (+ c_~res2~0 (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))) c_~res1~0)) is different from false [2022-12-06 07:40:24,895 WARN L837 $PredicateComparison]: unable to prove that (forall ((~A~0.offset Int) (v_ArrVal_1160 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) ~A~0.offset) (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset) c_~res1~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1160)) (.cse1 (* 4 c_~M~0))) (+ c_~res2~0 (select (select .cse0 c_~A~0.base) (+ .cse1 ~A~0.offset)) (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)))))) is different from false [2022-12-06 07:40:24,905 WARN L837 $PredicateComparison]: unable to prove that (forall ((~A~0.offset Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1160 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1159))) (= (+ (select (select .cse0 c_~B~0.base) c_~B~0.offset) c_~res1~0 (select (select .cse0 c_~A~0.base) ~A~0.offset)) (let ((.cse1 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1160)) (.cse2 (* 4 c_~M~0))) (+ c_~res2~0 (select (select .cse1 c_~A~0.base) (+ .cse2 ~A~0.offset)) (select (select .cse1 c_~B~0.base) (+ .cse2 c_~B~0.offset))))))) is different from false [2022-12-06 07:40:24,910 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 07:40:24,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959348410] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:40:24,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:40:24,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 20 [2022-12-06 07:40:24,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687709722] [2022-12-06 07:40:24,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:40:24,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 07:40:24,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:40:24,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 07:40:24,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=292, Unknown=3, NotChecked=108, Total=462 [2022-12-06 07:40:24,911 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 07:40:24,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 132 transitions, 2107 flow. Second operand has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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 07:40:24,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:40:24,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 07:40:24,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:40:31,185 WARN L233 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 51 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:40:32,603 INFO L130 PetriNetUnfolder]: 3303/4950 cut-off events. [2022-12-06 07:40:32,603 INFO L131 PetriNetUnfolder]: For 77534/77534 co-relation queries the response was YES. [2022-12-06 07:40:32,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37090 conditions, 4950 events. 3303/4950 cut-off events. For 77534/77534 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 24689 event pairs, 1227 based on Foata normal form. 1/4951 useless extension candidates. Maximal degree in co-relation 37020. Up to 3818 conditions per place. [2022-12-06 07:40:32,635 INFO L137 encePairwiseOnDemand]: 17/37 looper letters, 93 selfloop transitions, 55 changer transitions 51/199 dead transitions. [2022-12-06 07:40:32,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 199 transitions, 2839 flow [2022-12-06 07:40:32,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:40:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:40:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 118 transitions. [2022-12-06 07:40:32,636 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24532224532224534 [2022-12-06 07:40:32,636 INFO L175 Difference]: Start difference. First operand has 119 places, 132 transitions, 2107 flow. Second operand 13 states and 118 transitions. [2022-12-06 07:40:32,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 199 transitions, 2839 flow [2022-12-06 07:40:32,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 199 transitions, 2753 flow, removed 7 selfloop flow, removed 8 redundant places. [2022-12-06 07:40:32,712 INFO L231 Difference]: Finished difference. Result has 127 places, 128 transitions, 2088 flow [2022-12-06 07:40:32,712 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2030, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2088, PETRI_PLACES=127, PETRI_TRANSITIONS=128} [2022-12-06 07:40:32,712 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 94 predicate places. [2022-12-06 07:40:32,713 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:40:32,713 INFO L89 Accepts]: Start accepts. Operand has 127 places, 128 transitions, 2088 flow [2022-12-06 07:40:32,713 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:40:32,714 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:40:32,714 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 128 transitions, 2088 flow [2022-12-06 07:40:32,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 128 transitions, 2088 flow [2022-12-06 07:40:32,809 INFO L130 PetriNetUnfolder]: 525/1123 cut-off events. [2022-12-06 07:40:32,809 INFO L131 PetriNetUnfolder]: For 13399/13762 co-relation queries the response was YES. [2022-12-06 07:40:32,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8592 conditions, 1123 events. 525/1123 cut-off events. For 13399/13762 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6839 event pairs, 48 based on Foata normal form. 24/1085 useless extension candidates. Maximal degree in co-relation 8542. Up to 473 conditions per place. [2022-12-06 07:40:32,820 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 128 transitions, 2088 flow [2022-12-06 07:40:32,820 INFO L188 LiptonReduction]: Number of co-enabled transitions 836 [2022-12-06 07:40:35,300 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:40:35,301 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2588 [2022-12-06 07:40:35,301 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 128 transitions, 2102 flow [2022-12-06 07:40:35,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states 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 07:40:35,301 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:40:35,301 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:40:35,307 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 07:40:35,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:40:35,502 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:40:35,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:40:35,502 INFO L85 PathProgramCache]: Analyzing trace with hash 2018918363, now seen corresponding path program 2 times [2022-12-06 07:40:35,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:40:35,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325637018] [2022-12-06 07:40:35,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:40:35,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:40:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:40:36,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:40:36,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:40:36,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325637018] [2022-12-06 07:40:36,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325637018] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:40:36,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817421574] [2022-12-06 07:40:36,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:40:36,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:40:36,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:40:36,169 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 07:40:36,171 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 07:40:36,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:40:36,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:40:36,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 81 conjunts are in the unsatisfiable core [2022-12-06 07:40:36,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:40:36,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:36,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:36,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-12-06 07:40:36,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:36,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2022-12-06 07:40:36,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-12-06 07:40:36,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-12-06 07:40:36,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-12-06 07:40:36,360 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 6 treesize of output 5 [2022-12-06 07:40:36,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:36,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2022-12-06 07:40:36,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:40:36,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2022-12-06 07:40:36,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:40:36,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 31 [2022-12-06 07:40:36,848 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 07:40:36,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:40:37,214 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 07:40:37,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817421574] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:40:37,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:40:37,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25 [2022-12-06 07:40:37,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068647961] [2022-12-06 07:40:37,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:40:37,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 07:40:37,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:40:37,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 07:40:37,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=591, Unknown=10, NotChecked=0, Total=702 [2022-12-06 07:40:37,215 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 07:40:37,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 128 transitions, 2102 flow. Second operand has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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 07:40:37,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:40:37,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 07:40:37,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:40:37,954 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~A~0.base)) (.cse2 (select |c_#memory_int| c_~B~0.base))) (and (forall ((v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1248 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1248) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1249)) (.cse1 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)) (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)))) c_~res1~0) (< 0 ~M~0))) (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= (let ((.cse3 (* ~M~0 4))) (+ (select .cse2 (+ .cse3 c_~B~0.offset)) c_~res2~0 (select .cse4 (+ c_~A~0.offset .cse3)))) c_~res1~0))) (forall ((v_ArrVal_1249 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (= (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1249)) (.cse6 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse5 c_~B~0.base) (+ .cse6 c_~B~0.offset)) (select (select .cse5 c_~A~0.base) (+ c_~A~0.offset .cse6)))) c_~res1~0) (< 0 ~M~0))) (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1248 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1248) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1249)) (.cse8 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse7 c_~A~0.base) (+ c_~A~0.offset .cse8)) (select (select .cse7 c_~B~0.base) (+ .cse8 c_~B~0.offset)))) (+ (select .cse4 c_~A~0.offset) (select .cse2 c_~B~0.offset) c_~res1~0))))))) is different from false [2022-12-06 07:40:38,670 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~A~0.base)) (.cse2 (select |c_#memory_int| c_~B~0.base))) (and (forall ((v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1248 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1248) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1249)) (.cse1 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)) (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)))) c_~res1~0) (< 0 ~M~0))) (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= (let ((.cse3 (* ~M~0 4))) (+ (select .cse2 (+ .cse3 c_~B~0.offset)) c_~res2~0 (select .cse4 (+ c_~A~0.offset .cse3)))) c_~res1~0))) (or (= c_~res2~0 c_~res1~0) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0)) (forall ((v_ArrVal_1249 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (= (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1249)) (.cse6 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse5 c_~B~0.base) (+ .cse6 c_~B~0.offset)) (select (select .cse5 c_~A~0.base) (+ c_~A~0.offset .cse6)))) c_~res1~0) (< 0 ~M~0))) (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1248 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1248) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1249)) (.cse8 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse7 c_~A~0.base) (+ c_~A~0.offset .cse8)) (select (select .cse7 c_~B~0.base) (+ .cse8 c_~B~0.offset)))) (+ (select .cse4 c_~A~0.offset) (select .cse2 c_~B~0.offset) c_~res1~0))))))) is different from false [2022-12-06 07:40:39,335 INFO L130 PetriNetUnfolder]: 3236/4826 cut-off events. [2022-12-06 07:40:39,335 INFO L131 PetriNetUnfolder]: For 82015/82015 co-relation queries the response was YES. [2022-12-06 07:40:39,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37421 conditions, 4826 events. 3236/4826 cut-off events. For 82015/82015 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 23455 event pairs, 1179 based on Foata normal form. 1/4827 useless extension candidates. Maximal degree in co-relation 37352. Up to 3763 conditions per place. [2022-12-06 07:40:39,372 INFO L137 encePairwiseOnDemand]: 14/38 looper letters, 94 selfloop transitions, 55 changer transitions 77/226 dead transitions. [2022-12-06 07:40:39,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 226 transitions, 3138 flow [2022-12-06 07:40:39,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 07:40:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 07:40:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 153 transitions. [2022-12-06 07:40:39,373 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21191135734072022 [2022-12-06 07:40:39,373 INFO L175 Difference]: Start difference. First operand has 118 places, 128 transitions, 2102 flow. Second operand 19 states and 153 transitions. [2022-12-06 07:40:39,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 226 transitions, 3138 flow [2022-12-06 07:40:39,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 226 transitions, 2950 flow, removed 11 selfloop flow, removed 12 redundant places. [2022-12-06 07:40:39,473 INFO L231 Difference]: Finished difference. Result has 129 places, 129 transitions, 2103 flow [2022-12-06 07:40:39,473 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1952, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2103, PETRI_PLACES=129, PETRI_TRANSITIONS=129} [2022-12-06 07:40:39,473 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 96 predicate places. [2022-12-06 07:40:39,473 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:40:39,473 INFO L89 Accepts]: Start accepts. Operand has 129 places, 129 transitions, 2103 flow [2022-12-06 07:40:39,474 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:40:39,474 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:40:39,474 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 129 transitions, 2103 flow [2022-12-06 07:40:39,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 129 transitions, 2103 flow [2022-12-06 07:40:39,629 INFO L130 PetriNetUnfolder]: 891/1664 cut-off events. [2022-12-06 07:40:39,629 INFO L131 PetriNetUnfolder]: For 20045/20710 co-relation queries the response was YES. [2022-12-06 07:40:39,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13313 conditions, 1664 events. 891/1664 cut-off events. For 20045/20710 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9876 event pairs, 131 based on Foata normal form. 68/1551 useless extension candidates. Maximal degree in co-relation 13253. Up to 724 conditions per place. [2022-12-06 07:40:39,651 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 129 transitions, 2103 flow [2022-12-06 07:40:39,651 INFO L188 LiptonReduction]: Number of co-enabled transitions 760 [2022-12-06 07:40:39,661 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1021] L61-4-->L48-4: Formula: (let ((.cse0 (select |v_#memory_int_377| v_~A~0.base_224)) (.cse2 (select |v_#memory_int_377| v_~B~0.base_216))) (let ((.cse3 (select .cse2 v_~B~0.offset_218)) (.cse4 (select .cse0 v_~A~0.offset_226)) (.cse5 (select .cse2 (+ v_~B~0.offset_218 4))) (.cse6 (select .cse0 (+ v_~A~0.offset_226 4))) (.cse7 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_96| |v_thread3Thread1of1ForFork1_plus_~b#1_96|)) (.cse8 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_82| |v_thread1Thread1of1ForFork2_plus_~b#1_82|))) (and (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_96| 2147483648)) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_82| 2147483647) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_84| v_~res1~0_209) (= |v_thread2Thread1of1ForFork0_#res#1.base_53| 0) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_96| |v_thread3Thread1of1ForFork1_plus_~b#1_96|) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_96| (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_195| 4))) (+ (select .cse0 (+ .cse1 v_~A~0.offset_226)) (select .cse2 (+ .cse1 v_~B~0.offset_218))))) (<= (+ v_~res1~0_211 .cse3 .cse4) 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_96| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_96|) (<= (+ .cse3 .cse4) 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_82| 2147483648)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_53| 0) (= (+ .cse5 v_~res1~0_211 .cse3 .cse4 .cse6) |v_thread1Thread1of1ForFork2_plus_#in~a#1_82|) (= |v_thread1Thread1of1ForFork2_plus_~b#1_82| |v_thread1Thread1of1ForFork2_plus_#in~b#1_82|) (= |v_thread1Thread1of1ForFork2_~i~0#1_109| 3) (< |v_thread3Thread1of1ForFork1_~i~2#1_195| v_~N~0_228) (= |v_thread3Thread1of1ForFork1_plus_#res#1_96| |v_thread3Thread1of1ForFork1_~tmp~2#1_122|) (= |v_thread1Thread1of1ForFork2_plus_~a#1_82| |v_thread1Thread1of1ForFork2_plus_#in~a#1_82|) (<= 0 (+ .cse3 .cse4 2147483648)) (<= |v_thread1Thread1of1ForFork2_plus_#in~a#1_82| 2147483647) (= (+ (select .cse2 (+ v_~B~0.offset_218 8)) (select .cse0 (+ v_~A~0.offset_226 8))) |v_thread1Thread1of1ForFork2_plus_#in~b#1_82|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_96| |v_thread3Thread1of1ForFork1_plus_~a#1_96|) (<= 0 (+ v_~res1~0_211 .cse3 .cse4 2147483648)) (<= 0 (+ .cse5 .cse6 2147483648)) (< 2 v_~N~0_228) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_96| 2147483647) (= .cse7 |v_thread3Thread1of1ForFork1_plus_#res#1_96|) (<= (+ .cse5 .cse6) 2147483647) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_130| v_~M~0_162)) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_96| v_~res2~0_244) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~a#1_82| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_84| |v_thread1Thread1of1ForFork2_plus_#res#1_82|) (= |v_thread1Thread1of1ForFork2_plus_#res#1_82| .cse8) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_82| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_82|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_122| 2147483647) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_122| 2147483648)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_96| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_96| 0) (<= .cse7 2147483647)) 1 0)) (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_82| 0) (<= .cse8 2147483647)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_82|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_84| 2147483648)) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_84| 2147483647)))) InVars {~res1~0=v_~res1~0_211, ~A~0.base=v_~A~0.base_224, ~B~0.base=v_~B~0.base_216, ~A~0.offset=v_~A~0.offset_226, ~M~0=v_~M~0_162, #memory_int=|v_#memory_int_377|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_130|, ~N~0=v_~N~0_228, ~B~0.offset=v_~B~0.offset_218, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_195|, ~res2~0=v_~res2~0_244} OutVars{~res1~0=v_~res1~0_209, ~A~0.base=v_~A~0.base_224, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_82|, ~B~0.base=v_~B~0.base_216, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_82|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_53|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_82|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_96|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_130|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_82|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_96|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_195|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_82|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_122|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_96|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_82|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_82|, ~B~0.offset=v_~B~0.offset_218, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_96|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_82|, ~res2~0=v_~res2~0_244, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_96|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_96|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_96|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_84|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_96|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_82|, ~N~0=v_~N~0_228, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_96|, ~A~0.offset=v_~A~0.offset_226, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_53|, ~M~0=v_~M~0_162, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_109|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_82|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_82|, #memory_int=|v_#memory_int_377|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_96|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_96|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_82|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread1Thread1of1ForFork2_#t~post1#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread3Thread1of1ForFork1_#t~mem12#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~tmp~0#1, thread3Thread1of1ForFork1_#t~mem13#1, thread1Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork2_plus_#res#1] and [915] L77-->L74-4: Formula: (and (= |v_thread3Thread1of1ForFork1_~i~2#1_29| (+ |v_thread3Thread1of1ForFork1_~i~2#1_30| 1)) (= v_~res2~0_79 |v_thread3Thread1of1ForFork1_~tmp~2#1_17|)) InVars {thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_30|} OutVars{thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_17|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_29|, ~res2~0=v_~res2~0_79} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_~i~2#1, ~res2~0] [2022-12-06 07:40:40,377 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:40,377 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:40,377 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:40,377 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:40,377 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:40,377 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:40,378 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:40,378 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:42,742 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1021] L61-4-->L48-4: Formula: (let ((.cse0 (select |v_#memory_int_377| v_~A~0.base_224)) (.cse2 (select |v_#memory_int_377| v_~B~0.base_216))) (let ((.cse3 (select .cse2 v_~B~0.offset_218)) (.cse4 (select .cse0 v_~A~0.offset_226)) (.cse5 (select .cse2 (+ v_~B~0.offset_218 4))) (.cse6 (select .cse0 (+ v_~A~0.offset_226 4))) (.cse7 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_96| |v_thread3Thread1of1ForFork1_plus_~b#1_96|)) (.cse8 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_82| |v_thread1Thread1of1ForFork2_plus_~b#1_82|))) (and (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_96| 2147483648)) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_82| 2147483647) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_84| v_~res1~0_209) (= |v_thread2Thread1of1ForFork0_#res#1.base_53| 0) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_96| |v_thread3Thread1of1ForFork1_plus_~b#1_96|) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_96| (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_195| 4))) (+ (select .cse0 (+ .cse1 v_~A~0.offset_226)) (select .cse2 (+ .cse1 v_~B~0.offset_218))))) (<= (+ v_~res1~0_211 .cse3 .cse4) 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_96| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_96|) (<= (+ .cse3 .cse4) 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_82| 2147483648)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_53| 0) (= (+ .cse5 v_~res1~0_211 .cse3 .cse4 .cse6) |v_thread1Thread1of1ForFork2_plus_#in~a#1_82|) (= |v_thread1Thread1of1ForFork2_plus_~b#1_82| |v_thread1Thread1of1ForFork2_plus_#in~b#1_82|) (= |v_thread1Thread1of1ForFork2_~i~0#1_109| 3) (< |v_thread3Thread1of1ForFork1_~i~2#1_195| v_~N~0_228) (= |v_thread3Thread1of1ForFork1_plus_#res#1_96| |v_thread3Thread1of1ForFork1_~tmp~2#1_122|) (= |v_thread1Thread1of1ForFork2_plus_~a#1_82| |v_thread1Thread1of1ForFork2_plus_#in~a#1_82|) (<= 0 (+ .cse3 .cse4 2147483648)) (<= |v_thread1Thread1of1ForFork2_plus_#in~a#1_82| 2147483647) (= (+ (select .cse2 (+ v_~B~0.offset_218 8)) (select .cse0 (+ v_~A~0.offset_226 8))) |v_thread1Thread1of1ForFork2_plus_#in~b#1_82|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_96| |v_thread3Thread1of1ForFork1_plus_~a#1_96|) (<= 0 (+ v_~res1~0_211 .cse3 .cse4 2147483648)) (<= 0 (+ .cse5 .cse6 2147483648)) (< 2 v_~N~0_228) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_96| 2147483647) (= .cse7 |v_thread3Thread1of1ForFork1_plus_#res#1_96|) (<= (+ .cse5 .cse6) 2147483647) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_130| v_~M~0_162)) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_96| v_~res2~0_244) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~a#1_82| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_84| |v_thread1Thread1of1ForFork2_plus_#res#1_82|) (= |v_thread1Thread1of1ForFork2_plus_#res#1_82| .cse8) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_82| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_82|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_122| 2147483647) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_122| 2147483648)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_96| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_96| 0) (<= .cse7 2147483647)) 1 0)) (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_82| 0) (<= .cse8 2147483647)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_82|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_84| 2147483648)) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_84| 2147483647)))) InVars {~res1~0=v_~res1~0_211, ~A~0.base=v_~A~0.base_224, ~B~0.base=v_~B~0.base_216, ~A~0.offset=v_~A~0.offset_226, ~M~0=v_~M~0_162, #memory_int=|v_#memory_int_377|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_130|, ~N~0=v_~N~0_228, ~B~0.offset=v_~B~0.offset_218, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_195|, ~res2~0=v_~res2~0_244} OutVars{~res1~0=v_~res1~0_209, ~A~0.base=v_~A~0.base_224, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_82|, ~B~0.base=v_~B~0.base_216, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_82|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_53|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_82|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_96|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_130|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_82|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_96|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_195|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_82|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_122|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_96|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_82|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_82|, ~B~0.offset=v_~B~0.offset_218, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_96|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_82|, ~res2~0=v_~res2~0_244, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_96|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_96|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_96|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_84|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_96|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_82|, ~N~0=v_~N~0_228, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_96|, ~A~0.offset=v_~A~0.offset_226, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_53|, ~M~0=v_~M~0_162, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_109|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_82|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_82|, #memory_int=|v_#memory_int_377|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_96|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_96|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_82|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread1Thread1of1ForFork2_#t~post1#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread3Thread1of1ForFork1_#t~mem12#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~tmp~0#1, thread3Thread1of1ForFork1_#t~mem13#1, thread1Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork2_plus_#res#1] and [828] L100-4-->L101-1: Formula: (= |v_ULTIMATE.start_main_#t~mem26#1_10| (select (select |v_#memory_int_76| |v_ULTIMATE.start_main_~#t1~0#1.base_13|) |v_ULTIMATE.start_main_~#t1~0#1.offset_13|)) InVars {#memory_int=|v_#memory_int_76|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_13|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_13|} OutVars{ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_10|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_9|, #memory_int=|v_#memory_int_76|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_13|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem26#1, ULTIMATE.start_main_#t~pre24#1, ULTIMATE.start_main_#t~nondet25#1] [2022-12-06 07:40:43,545 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] L61-4-->L74-4: Formula: (let ((.cse2 (select |v_#memory_int_375| v_~A~0.base_222)) (.cse4 (select |v_#memory_int_375| v_~B~0.base_214))) (let ((.cse7 (select .cse4 v_~B~0.offset_216)) (.cse8 (select .cse2 v_~A~0.offset_224))) (let ((.cse1 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_94| |v_thread3Thread1of1ForFork1_plus_~b#1_94|)) (.cse0 (+ .cse7 .cse8 v_~res1~0_206)) (.cse6 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_80| |v_thread1Thread1of1ForFork2_plus_~b#1_80|))) (and (= |v_thread2Thread1of1ForFork0_#res#1.base_51| 0) (= (+ |v_thread3Thread1of1ForFork1_~i~2#1_192| 1) |v_thread3Thread1of1ForFork1_~i~2#1_191|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_82| 2147483648)) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_120| 2147483648)) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#in~a#1_80|) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_80| 2147483648)) (= .cse1 |v_thread3Thread1of1ForFork1_plus_#res#1_94|) (= (let ((.cse3 (* |v_thread3Thread1of1ForFork1_~i~2#1_192| 4))) (+ (select .cse2 (+ .cse3 v_~A~0.offset_224)) (select .cse4 (+ v_~B~0.offset_216 .cse3)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_94|) (= (let ((.cse5 (* |v_thread1Thread1of1ForFork2_~i~0#1_107| 4))) (+ (select .cse4 (+ .cse5 v_~B~0.offset_216 (- 4))) (select .cse2 (+ .cse5 v_~A~0.offset_224 (- 4))))) |v_thread1Thread1of1ForFork2_plus_#in~b#1_80|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_94| 0) (<= .cse1 2147483647)) 1 0)) (= (ite (or (<= .cse6 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_80| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_80|) (<= 0 (+ .cse7 .cse8 v_~res1~0_206 2147483648)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_80| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_80|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_94| v_~res2~0_241) (<= (+ .cse7 .cse8) 2147483647) (< |v_thread1Thread1of1ForFork2_~i~0#1_107| (+ v_~N~0_226 1)) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_94| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_82| v_~res1~0_205) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_80| 2147483647) (<= .cse0 2147483647) (= |v_thread2Thread1of1ForFork0_#res#1.offset_51| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_107| 2) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_128| v_~M~0_160)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_82| |v_thread1Thread1of1ForFork2_plus_#res#1_80|) (= .cse6 |v_thread1Thread1of1ForFork2_plus_#res#1_80|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_94| |v_thread3Thread1of1ForFork1_~tmp~2#1_120|) (< |v_thread3Thread1of1ForFork1_~i~2#1_192| v_~N~0_226) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_82| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_94| |v_thread3Thread1of1ForFork1_plus_~a#1_94|) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_94| |v_thread3Thread1of1ForFork1_plus_~b#1_94|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_94| 2147483647) (= |v_thread1Thread1of1ForFork2_plus_~b#1_80| |v_thread1Thread1of1ForFork2_plus_#in~b#1_80|) (= |v_thread1Thread1of1ForFork2_plus_~a#1_80| |v_thread1Thread1of1ForFork2_plus_#in~a#1_80|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_120| 2147483647) (= v_~res2~0_240 |v_thread3Thread1of1ForFork1_~tmp~2#1_120|) (<= 0 (+ .cse7 .cse8 2147483648)))))) InVars {~res1~0=v_~res1~0_206, ~A~0.base=v_~A~0.base_222, ~B~0.base=v_~B~0.base_214, ~A~0.offset=v_~A~0.offset_224, ~M~0=v_~M~0_160, #memory_int=|v_#memory_int_375|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_128|, ~N~0=v_~N~0_226, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_192|, ~B~0.offset=v_~B~0.offset_216, ~res2~0=v_~res2~0_241} OutVars{~res1~0=v_~res1~0_205, ~A~0.base=v_~A~0.base_222, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_80|, ~B~0.base=v_~B~0.base_214, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_80|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_51|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_80|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_94|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_128|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_80|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_191|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_94|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_80|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_120|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_94|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_80|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_80|, ~B~0.offset=v_~B~0.offset_216, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_94|, ~res2~0=v_~res2~0_240, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_80|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_94|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_82|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_94|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_80|, ~N~0=v_~N~0_226, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_94|, ~A~0.offset=v_~A~0.offset_224, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_51|, ~M~0=v_~M~0_160, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_107|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_80|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_80|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_75|, #memory_int=|v_#memory_int_375|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_94|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_94|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_80|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_#t~ret14#1, thread1Thread1of1ForFork2_#t~post1#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread3Thread1of1ForFork1_#t~mem12#1, ~res2~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~tmp~0#1, thread3Thread1of1ForFork1_#t~mem13#1, thread1Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork2_plus_#res#1] and [946] L48-4-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_17| |v_thread1Thread1of1ForFork2_plus_~b#1_17|))) (and (= |v_thread1Thread1of1ForFork2_plus_#res#1_17| .cse0) (= v_~res1~0_74 |v_thread1Thread1of1ForFork2_plus_#in~a#1_17|) (< |v_thread1Thread1of1ForFork2_~i~0#1_38| v_~N~0_96) (= (let ((.cse1 (* |v_thread1Thread1of1ForFork2_~i~0#1_38| 4))) (+ (select (select |v_#memory_int_182| v_~A~0.base_84) (+ v_~A~0.offset_84 .cse1)) (select (select |v_#memory_int_182| v_~B~0.base_82) (+ v_~B~0.offset_82 .cse1)))) |v_thread1Thread1of1ForFork2_plus_#in~b#1_17|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_17| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_17| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_19| 2147483648)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_17| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_17| 2147483648)) (= |v_thread1Thread1of1ForFork2_plus_~a#1_17| |v_thread1Thread1of1ForFork2_plus_#in~a#1_17|) (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_38| 1) |v_thread1Thread1of1ForFork2_~i~0#1_37|) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_19| |v_thread1Thread1of1ForFork2_plus_#res#1_17|) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_19| v_~res1~0_73) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_19| 2147483647) (= |v_thread1Thread1of1ForFork2_plus_~b#1_17| |v_thread1Thread1of1ForFork2_plus_#in~b#1_17|))) InVars {~res1~0=v_~res1~0_74, ~A~0.base=v_~A~0.base_84, ~B~0.base=v_~B~0.base_82, ~A~0.offset=v_~A~0.offset_84, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_38|, #memory_int=|v_#memory_int_182|, ~N~0=v_~N~0_96, ~B~0.offset=v_~B~0.offset_82} OutVars{~res1~0=v_~res1~0_73, ~A~0.base=v_~A~0.base_84, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_17|, ~B~0.base=v_~B~0.base_82, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_17|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_19|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_17|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_17|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_17|, ~N~0=v_~N~0_96, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0.offset=v_~A~0.offset_84, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_37|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_17|, #memory_int=|v_#memory_int_182|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_17|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_17|, ~B~0.offset=v_~B~0.offset_82, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_17|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:40:43,546 WARN L322 ript$VariableManager]: TermVariable LBE534 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:43,546 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:43,546 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:43,546 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:43,546 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:43,546 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:43,546 WARN L322 ript$VariableManager]: TermVariable LBE535 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:43,546 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:43,546 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:43,546 WARN L322 ript$VariableManager]: TermVariable LBE444 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:43,546 WARN L322 ript$VariableManager]: TermVariable LBE520 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:43,547 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:43,547 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:43,547 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:43,547 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:43,547 WARN L322 ript$VariableManager]: TermVariable LBE192 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:44,721 WARN L322 ript$VariableManager]: TermVariable LBE534 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:44,721 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:44,721 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:44,721 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:44,721 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:44,721 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:44,721 WARN L322 ript$VariableManager]: TermVariable LBE535 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:44,721 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:44,721 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:44,721 WARN L322 ript$VariableManager]: TermVariable LBE444 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:44,722 WARN L322 ript$VariableManager]: TermVariable LBE520 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:44,722 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:44,722 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:44,722 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:44,722 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:44,722 WARN L322 ript$VariableManager]: TermVariable LBE192 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:45,861 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] L61-4-->L74-4: Formula: (let ((.cse2 (select |v_#memory_int_375| v_~A~0.base_222)) (.cse4 (select |v_#memory_int_375| v_~B~0.base_214))) (let ((.cse7 (select .cse4 v_~B~0.offset_216)) (.cse8 (select .cse2 v_~A~0.offset_224))) (let ((.cse1 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_94| |v_thread3Thread1of1ForFork1_plus_~b#1_94|)) (.cse0 (+ .cse7 .cse8 v_~res1~0_206)) (.cse6 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_80| |v_thread1Thread1of1ForFork2_plus_~b#1_80|))) (and (= |v_thread2Thread1of1ForFork0_#res#1.base_51| 0) (= (+ |v_thread3Thread1of1ForFork1_~i~2#1_192| 1) |v_thread3Thread1of1ForFork1_~i~2#1_191|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_82| 2147483648)) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_120| 2147483648)) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#in~a#1_80|) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_80| 2147483648)) (= .cse1 |v_thread3Thread1of1ForFork1_plus_#res#1_94|) (= (let ((.cse3 (* |v_thread3Thread1of1ForFork1_~i~2#1_192| 4))) (+ (select .cse2 (+ .cse3 v_~A~0.offset_224)) (select .cse4 (+ v_~B~0.offset_216 .cse3)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_94|) (= (let ((.cse5 (* |v_thread1Thread1of1ForFork2_~i~0#1_107| 4))) (+ (select .cse4 (+ .cse5 v_~B~0.offset_216 (- 4))) (select .cse2 (+ .cse5 v_~A~0.offset_224 (- 4))))) |v_thread1Thread1of1ForFork2_plus_#in~b#1_80|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_94| 0) (<= .cse1 2147483647)) 1 0)) (= (ite (or (<= .cse6 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_80| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_80|) (<= 0 (+ .cse7 .cse8 v_~res1~0_206 2147483648)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_80| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_80|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_94| v_~res2~0_241) (<= (+ .cse7 .cse8) 2147483647) (< |v_thread1Thread1of1ForFork2_~i~0#1_107| (+ v_~N~0_226 1)) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_94| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_82| v_~res1~0_205) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_80| 2147483647) (<= .cse0 2147483647) (= |v_thread2Thread1of1ForFork0_#res#1.offset_51| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_107| 2) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_128| v_~M~0_160)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_82| |v_thread1Thread1of1ForFork2_plus_#res#1_80|) (= .cse6 |v_thread1Thread1of1ForFork2_plus_#res#1_80|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_94| |v_thread3Thread1of1ForFork1_~tmp~2#1_120|) (< |v_thread3Thread1of1ForFork1_~i~2#1_192| v_~N~0_226) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_82| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_94| |v_thread3Thread1of1ForFork1_plus_~a#1_94|) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_94| |v_thread3Thread1of1ForFork1_plus_~b#1_94|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_94| 2147483647) (= |v_thread1Thread1of1ForFork2_plus_~b#1_80| |v_thread1Thread1of1ForFork2_plus_#in~b#1_80|) (= |v_thread1Thread1of1ForFork2_plus_~a#1_80| |v_thread1Thread1of1ForFork2_plus_#in~a#1_80|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_120| 2147483647) (= v_~res2~0_240 |v_thread3Thread1of1ForFork1_~tmp~2#1_120|) (<= 0 (+ .cse7 .cse8 2147483648)))))) InVars {~res1~0=v_~res1~0_206, ~A~0.base=v_~A~0.base_222, ~B~0.base=v_~B~0.base_214, ~A~0.offset=v_~A~0.offset_224, ~M~0=v_~M~0_160, #memory_int=|v_#memory_int_375|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_128|, ~N~0=v_~N~0_226, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_192|, ~B~0.offset=v_~B~0.offset_216, ~res2~0=v_~res2~0_241} OutVars{~res1~0=v_~res1~0_205, ~A~0.base=v_~A~0.base_222, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_80|, ~B~0.base=v_~B~0.base_214, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_80|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_51|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_80|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_94|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_128|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_80|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_191|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_94|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_80|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_120|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_94|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_80|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_80|, ~B~0.offset=v_~B~0.offset_216, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_94|, ~res2~0=v_~res2~0_240, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_80|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_94|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_82|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_94|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_80|, ~N~0=v_~N~0_226, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_94|, ~A~0.offset=v_~A~0.offset_224, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_51|, ~M~0=v_~M~0_160, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_107|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_80|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_80|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_75|, #memory_int=|v_#memory_int_375|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_94|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_94|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_80|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_#t~ret14#1, thread1Thread1of1ForFork2_#t~post1#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread3Thread1of1ForFork1_#t~mem12#1, ~res2~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~tmp~0#1, thread3Thread1of1ForFork1_#t~mem13#1, thread1Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork2_plus_#res#1] and [958] L48-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_In_3| v_~N~0_In_12)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0)) InVars {thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, ~N~0=v_~N~0_In_12} OutVars{thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, ~N~0=v_~N~0_In_12, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_In_3|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base] [2022-12-06 07:40:46,636 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1019] L61-4-->L74-4: Formula: (let ((.cse2 (select |v_#memory_int_375| v_~A~0.base_222)) (.cse4 (select |v_#memory_int_375| v_~B~0.base_214))) (let ((.cse7 (select .cse4 v_~B~0.offset_216)) (.cse8 (select .cse2 v_~A~0.offset_224))) (let ((.cse1 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_94| |v_thread3Thread1of1ForFork1_plus_~b#1_94|)) (.cse0 (+ .cse7 .cse8 v_~res1~0_206)) (.cse6 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_80| |v_thread1Thread1of1ForFork2_plus_~b#1_80|))) (and (= |v_thread2Thread1of1ForFork0_#res#1.base_51| 0) (= (+ |v_thread3Thread1of1ForFork1_~i~2#1_192| 1) |v_thread3Thread1of1ForFork1_~i~2#1_191|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_82| 2147483648)) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_120| 2147483648)) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#in~a#1_80|) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_80| 2147483648)) (= .cse1 |v_thread3Thread1of1ForFork1_plus_#res#1_94|) (= (let ((.cse3 (* |v_thread3Thread1of1ForFork1_~i~2#1_192| 4))) (+ (select .cse2 (+ .cse3 v_~A~0.offset_224)) (select .cse4 (+ v_~B~0.offset_216 .cse3)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_94|) (= (let ((.cse5 (* |v_thread1Thread1of1ForFork2_~i~0#1_107| 4))) (+ (select .cse4 (+ .cse5 v_~B~0.offset_216 (- 4))) (select .cse2 (+ .cse5 v_~A~0.offset_224 (- 4))))) |v_thread1Thread1of1ForFork2_plus_#in~b#1_80|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_94| 0) (<= .cse1 2147483647)) 1 0)) (= (ite (or (<= .cse6 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_80| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_80|) (<= 0 (+ .cse7 .cse8 v_~res1~0_206 2147483648)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_80| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_80|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_94| v_~res2~0_241) (<= (+ .cse7 .cse8) 2147483647) (< |v_thread1Thread1of1ForFork2_~i~0#1_107| (+ v_~N~0_226 1)) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_94| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_82| v_~res1~0_205) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_80| 2147483647) (<= .cse0 2147483647) (= |v_thread2Thread1of1ForFork0_#res#1.offset_51| 0) (= |v_thread1Thread1of1ForFork2_~i~0#1_107| 2) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_128| v_~M~0_160)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_82| |v_thread1Thread1of1ForFork2_plus_#res#1_80|) (= .cse6 |v_thread1Thread1of1ForFork2_plus_#res#1_80|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_94| |v_thread3Thread1of1ForFork1_~tmp~2#1_120|) (< |v_thread3Thread1of1ForFork1_~i~2#1_192| v_~N~0_226) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_82| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_94| |v_thread3Thread1of1ForFork1_plus_~a#1_94|) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_94| |v_thread3Thread1of1ForFork1_plus_~b#1_94|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_94| 2147483647) (= |v_thread1Thread1of1ForFork2_plus_~b#1_80| |v_thread1Thread1of1ForFork2_plus_#in~b#1_80|) (= |v_thread1Thread1of1ForFork2_plus_~a#1_80| |v_thread1Thread1of1ForFork2_plus_#in~a#1_80|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_120| 2147483647) (= v_~res2~0_240 |v_thread3Thread1of1ForFork1_~tmp~2#1_120|) (<= 0 (+ .cse7 .cse8 2147483648)))))) InVars {~res1~0=v_~res1~0_206, ~A~0.base=v_~A~0.base_222, ~B~0.base=v_~B~0.base_214, ~A~0.offset=v_~A~0.offset_224, ~M~0=v_~M~0_160, #memory_int=|v_#memory_int_375|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_128|, ~N~0=v_~N~0_226, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_192|, ~B~0.offset=v_~B~0.offset_216, ~res2~0=v_~res2~0_241} OutVars{~res1~0=v_~res1~0_205, ~A~0.base=v_~A~0.base_222, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_80|, ~B~0.base=v_~B~0.base_214, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_80|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_51|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_80|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_94|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_128|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_80|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_191|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_94|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_80|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_120|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_94|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_80|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_80|, ~B~0.offset=v_~B~0.offset_216, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_94|, ~res2~0=v_~res2~0_240, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_80|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_94|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_94|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_94|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_82|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_94|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_80|, ~N~0=v_~N~0_226, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_94|, ~A~0.offset=v_~A~0.offset_224, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_51|, ~M~0=v_~M~0_160, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_107|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_80|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_80|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_75|, #memory_int=|v_#memory_int_375|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_94|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_94|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_80|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_#t~ret14#1, thread1Thread1of1ForFork2_#t~post1#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread3Thread1of1ForFork1_#t~mem12#1, ~res2~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~tmp~0#1, thread3Thread1of1ForFork1_#t~mem13#1, thread1Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork2_plus_#res#1] and [828] L100-4-->L101-1: Formula: (= |v_ULTIMATE.start_main_#t~mem26#1_10| (select (select |v_#memory_int_76| |v_ULTIMATE.start_main_~#t1~0#1.base_13|) |v_ULTIMATE.start_main_~#t1~0#1.offset_13|)) InVars {#memory_int=|v_#memory_int_76|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_13|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_13|} OutVars{ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_10|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_9|, #memory_int=|v_#memory_int_76|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_13|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem26#1, ULTIMATE.start_main_#t~pre24#1, ULTIMATE.start_main_#t~nondet25#1] [2022-12-06 07:40:47,176 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:40:47,177 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7704 [2022-12-06 07:40:47,177 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 126 transitions, 2186 flow [2022-12-06 07:40:47,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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 07:40:47,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:40:47,177 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:40:47,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 07:40:47,384 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,SelfDestructingSolverStorable26 [2022-12-06 07:40:47,384 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:40:47,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:40:47,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2128222533, now seen corresponding path program 1 times [2022-12-06 07:40:47,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:40:47,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014183370] [2022-12-06 07:40:47,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:40:47,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:40:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:40:48,258 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 07:40:48,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:40:48,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014183370] [2022-12-06 07:40:48,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014183370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:40:48,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:40:48,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 07:40:48,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755463767] [2022-12-06 07:40:48,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:40:48,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:40:48,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:40:48,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:40:48,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:40:48,259 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-06 07:40:48,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 126 transitions, 2186 flow. Second operand has 11 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 07:40:48,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:40:48,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-06 07:40:48,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:40:49,585 INFO L130 PetriNetUnfolder]: 3269/4818 cut-off events. [2022-12-06 07:40:49,585 INFO L131 PetriNetUnfolder]: For 91428/91428 co-relation queries the response was YES. [2022-12-06 07:40:49,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40482 conditions, 4818 events. 3269/4818 cut-off events. For 91428/91428 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 23358 event pairs, 1064 based on Foata normal form. 1/4819 useless extension candidates. Maximal degree in co-relation 40413. Up to 3785 conditions per place. [2022-12-06 07:40:49,622 INFO L137 encePairwiseOnDemand]: 20/44 looper letters, 125 selfloop transitions, 98 changer transitions 6/229 dead transitions. [2022-12-06 07:40:49,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 229 transitions, 3912 flow [2022-12-06 07:40:49,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:40:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:40:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2022-12-06 07:40:49,623 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3159090909090909 [2022-12-06 07:40:49,623 INFO L175 Difference]: Start difference. First operand has 102 places, 126 transitions, 2186 flow. Second operand 10 states and 139 transitions. [2022-12-06 07:40:49,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 229 transitions, 3912 flow [2022-12-06 07:40:49,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 229 transitions, 3554 flow, removed 83 selfloop flow, removed 15 redundant places. [2022-12-06 07:40:49,749 INFO L231 Difference]: Finished difference. Result has 101 places, 169 transitions, 3181 flow [2022-12-06 07:40:49,749 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1969, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3181, PETRI_PLACES=101, PETRI_TRANSITIONS=169} [2022-12-06 07:40:49,749 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 68 predicate places. [2022-12-06 07:40:49,749 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:40:49,750 INFO L89 Accepts]: Start accepts. Operand has 101 places, 169 transitions, 3181 flow [2022-12-06 07:40:49,750 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:40:49,750 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:40:49,750 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 169 transitions, 3181 flow [2022-12-06 07:40:49,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 169 transitions, 3181 flow [2022-12-06 07:40:49,903 INFO L130 PetriNetUnfolder]: 937/1758 cut-off events. [2022-12-06 07:40:49,904 INFO L131 PetriNetUnfolder]: For 21395/22092 co-relation queries the response was YES. [2022-12-06 07:40:49,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14319 conditions, 1758 events. 937/1758 cut-off events. For 21395/22092 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 10647 event pairs, 143 based on Foata normal form. 67/1631 useless extension candidates. Maximal degree in co-relation 10252. Up to 770 conditions per place. [2022-12-06 07:40:49,922 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 169 transitions, 3181 flow [2022-12-06 07:40:49,922 INFO L188 LiptonReduction]: Number of co-enabled transitions 916 [2022-12-06 07:40:49,923 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] $Ultimate##0-->L74-4: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_1| v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2#1] and [988] L61-4-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_52| |v_thread1Thread1of1ForFork2_plus_~b#1_52|))) (and (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_52| (+ (select (select |v_#memory_int_284| v_~B~0.base_146) v_~B~0.offset_148) (select (select |v_#memory_int_284| v_~A~0.base_152) v_~A~0.offset_154))) (< 0 v_~N~0_160) (= |v_thread1Thread1of1ForFork2_plus_~b#1_52| |v_thread1Thread1of1ForFork2_plus_#in~b#1_52|) (= v_~res1~0_146 |v_thread1Thread1of1ForFork2_plus_#in~a#1_52|) (= |v_thread1Thread1of1ForFork2_~i~0#1_79| 1) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_54| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_54| |v_thread1Thread1of1ForFork2_plus_#res#1_52|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_52| 2147483647) (= |v_thread2Thread1of1ForFork0_#res#1.offset_17| 0) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_54| v_~res1~0_145) (= |v_thread1Thread1of1ForFork2_plus_~a#1_52| |v_thread1Thread1of1ForFork2_plus_#in~a#1_52|) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_69| v_~M~0_105)) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_54| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_52| 2147483648)) (= |v_thread2Thread1of1ForFork0_#res#1.base_17| 0) (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_52| 0) (<= .cse0 2147483647)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_52|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_52| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_52|) (= |v_thread1Thread1of1ForFork2_plus_#res#1_52| .cse0))) InVars {~res1~0=v_~res1~0_146, ~A~0.base=v_~A~0.base_152, ~B~0.base=v_~B~0.base_146, ~A~0.offset=v_~A~0.offset_154, ~M~0=v_~M~0_105, #memory_int=|v_#memory_int_284|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_69|, ~N~0=v_~N~0_160, ~B~0.offset=v_~B~0.offset_148} OutVars{~res1~0=v_~res1~0_145, ~A~0.base=v_~A~0.base_152, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_52|, ~B~0.base=v_~B~0.base_146, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_52|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_17|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_52|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_69|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_52|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_52|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_52|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_52|, ~B~0.offset=v_~B~0.offset_148, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_52|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_54|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_52|, ~N~0=v_~N~0_160, ~A~0.offset=v_~A~0.offset_154, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_17|, ~M~0=v_~M~0_105, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_79|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_52|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_52|, #memory_int=|v_#memory_int_284|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_52|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_#t~post1#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:40:50,074 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] $Ultimate##0-->L74-4: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_1| v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2#1] and [966] $Ultimate##0-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_~b#1_21|))) (and (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_21| 0) (<= .cse0 2147483647)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (< 0 v_~N~0_113) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| |v_thread1Thread1of1ForFork2_plus_#res#1_21|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483647) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_21| 2147483648)) (= (+ (select (select |v_#memory_int_218| v_~B~0.base_102) v_~B~0.offset_102) (select (select |v_#memory_int_218| v_~A~0.base_106) v_~A~0.offset_106)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (= |v_thread1Thread1of1ForFork2_~i~0#1_44| 1) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|) (= v_~res1~0_85 |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= |v_thread1Thread1of1ForFork2_plus_~b#1_21| |v_thread1Thread1of1ForFork2_plus_#in~b#1_21|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_23| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_23| v_~res1~0_84) (= |v_thread1Thread1of1ForFork2_plus_~a#1_21| |v_thread1Thread1of1ForFork2_plus_#in~a#1_21|) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_21|))) InVars {~res1~0=v_~res1~0_85, ~A~0.base=v_~A~0.base_106, ~B~0.base=v_~B~0.base_102, ~A~0.offset=v_~A~0.offset_106, #memory_int=|v_#memory_int_218|, ~N~0=v_~N~0_113, ~B~0.offset=v_~B~0.offset_102} OutVars{~res1~0=v_~res1~0_84, ~A~0.base=v_~A~0.base_106, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_21|, ~B~0.base=v_~B~0.base_102, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_21|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_23|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_21|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_21|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_21|, ~N~0=v_~N~0_113, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_21|, ~A~0.offset=v_~A~0.offset_106, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_44|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_21|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_21|, #memory_int=|v_#memory_int_218|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_21|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_21|, ~B~0.offset=v_~B~0.offset_102, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_21|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_21|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:40:50,190 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] $Ultimate##0-->L74-4: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_1| v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2#1] and [931] L64-->L61-4: Formula: (and (= v_~res2~0_86 |v_thread2Thread1of1ForFork0_~tmp~1#1_23|) (= (+ |v_thread2Thread1of1ForFork0_~i~1#1_30| 1) |v_thread2Thread1of1ForFork0_~i~1#1_29|)) InVars {thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_23|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_30|} OutVars{thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_23|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_29|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_19|, ~res2~0=v_~res2~0_86} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post6#1, ~res2~0] [2022-12-06 07:40:50,204 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] $Ultimate##0-->L74-4: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_1| v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2#1] and [1047] L61-4-->L77: Formula: (let ((.cse8 (select |v_#memory_int_494| v_~B~0.base_309)) (.cse6 (select |v_#memory_int_494| v_~A~0.base_319))) (let ((.cse11 (* |v_thread3Thread1of1ForFork1_~i~2#1_370| 4)) (.cse2 (select .cse6 v_~A~0.offset_321)) (.cse3 (select .cse8 v_~B~0.offset_311))) (let ((.cse0 (+ .cse2 v_~res1~0_296 .cse3)) (.cse4 (select .cse6 (+ v_~A~0.offset_321 .cse11))) (.cse5 (select .cse8 (+ v_~B~0.offset_311 .cse11))) (.cse1 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_120| |v_thread1Thread1of1ForFork2_plus_~b#1_120|)) (.cse9 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_148| |v_thread3Thread1of1ForFork1_plus_~b#1_148|))) (and (= |v_thread1Thread1of1ForFork2_~tmp~0#1_122| v_~res1~0_295) (<= .cse0 2147483647) (= |v_thread2Thread1of1ForFork0_#res#1.offset_73| 0) (= |v_thread3Thread1of1ForFork1_plus_~a#1_148| |v_thread3Thread1of1ForFork1_plus_#in~a#1_148|) (= |v_thread1Thread1of1ForFork2_plus_#res#1_120| .cse1) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_148| v_~res2~0_395) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_120| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_120|) (= (+ |v_thread3Thread1of1ForFork1_~i~2#1_370| 1) |v_thread3Thread1of1ForFork1_~i~2#1_369|) (<= 0 (+ .cse2 v_~res1~0_296 .cse3 2147483648)) (< |v_thread3Thread1of1ForFork1_~i~2#1_369| v_~N~0_303) (<= 0 (+ v_~res2~0_395 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_122| |v_thread1Thread1of1ForFork2_plus_#res#1_120|) (< |v_thread1Thread1of1ForFork2_~i~0#1_149| (+ v_~N~0_303 1)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_148|) (= |v_thread1Thread1of1ForFork2_~i~0#1_149| 2) (<= (+ .cse4 .cse5) 2147483647) (= (let ((.cse7 (* |v_thread1Thread1of1ForFork2_~i~0#1_149| 4))) (+ (select .cse6 (+ .cse7 v_~A~0.offset_321 (- 4))) (select .cse8 (+ .cse7 v_~B~0.offset_311 (- 4))))) |v_thread1Thread1of1ForFork2_plus_#in~b#1_120|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_212| 2147483647) (<= v_~res2~0_395 2147483647) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_206| v_~M~0_235)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_148| |v_thread3Thread1of1ForFork1_~tmp~2#1_212|) (<= (+ .cse2 .cse3) 2147483647) (= |v_thread3Thread1of1ForFork1_plus_~b#1_148| |v_thread3Thread1of1ForFork1_plus_#in~b#1_148|) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_120| |v_thread1Thread1of1ForFork2_plus_~b#1_120|) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_122| 2147483647) (= (+ .cse4 v_~res2~0_396 .cse5) v_~res2~0_395) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_120| .cse0) (= (ite (or (<= .cse9 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_148| 0)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_120| 2147483647) (<= 0 (+ .cse2 .cse3 2147483648)) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_120| 2147483648)) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_212| 2147483648)) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_148| 2147483648)) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_122| 2147483648)) (= |v_thread2Thread1of1ForFork0_#res#1.base_73| 0) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_120| |v_thread1Thread1of1ForFork2_plus_~a#1_120|) (<= 0 (+ .cse4 2147483648 .cse5)) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_148| 2147483647) (= (let ((.cse10 (* |v_thread3Thread1of1ForFork1_~i~2#1_369| 4))) (+ (select .cse6 (+ .cse10 v_~A~0.offset_321)) (select .cse8 (+ v_~B~0.offset_311 .cse10)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_148|) (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_120| 0) (<= .cse1 2147483647)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_120|) (= .cse9 |v_thread3Thread1of1ForFork1_plus_#res#1_148|))))) InVars {~res1~0=v_~res1~0_296, ~A~0.base=v_~A~0.base_319, ~B~0.base=v_~B~0.base_309, ~A~0.offset=v_~A~0.offset_321, ~M~0=v_~M~0_235, #memory_int=|v_#memory_int_494|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_206|, ~N~0=v_~N~0_303, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_370|, ~B~0.offset=v_~B~0.offset_311, ~res2~0=v_~res2~0_396} OutVars{~res1~0=v_~res1~0_295, ~A~0.base=v_~A~0.base_319, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_120|, ~B~0.base=v_~B~0.base_309, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_120|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_73|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_120|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_148|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_206|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_120|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_148|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_369|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_120|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_212|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_148|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_120|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_148|, ~B~0.offset=v_~B~0.offset_311, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_120|, ~res2~0=v_~res2~0_395, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_120|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_148|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_148|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_122|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_148|, ~N~0=v_~N~0_303, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_120|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_148|, ~A~0.offset=v_~A~0.offset_321, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_73|, ~M~0=v_~M~0_235, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_149|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_120|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_120|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_148|, #memory_int=|v_#memory_int_494|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_145|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_148|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_120|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_~i~2#1, thread1Thread1of1ForFork2_#t~post1#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork1_#t~mem12#1, thread1Thread1of1ForFork2_#t~mem3#1, ~res2~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~tmp~0#1, thread3Thread1of1ForFork1_#t~mem13#1, thread1Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:40:50,887 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] $Ultimate##0-->L74-4: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_1| v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2#1] and [992] L61-4-->L74-4: Formula: (let ((.cse1 (select |v_#memory_int_292| v_~B~0.base_154)) (.cse3 (select |v_#memory_int_292| v_~A~0.base_160)) (.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_56| |v_thread1Thread1of1ForFork2_plus_~b#1_56|)) (.cse4 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_47| |v_thread3Thread1of1ForFork1_plus_~b#1_47|))) (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_25| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_56| (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_56| 0)) 1 0)) (= |v_thread3Thread1of1ForFork1_~i~2#1_101| (+ |v_thread3Thread1of1ForFork1_~i~2#1_102| 1)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_47| (let ((.cse2 (* |v_thread3Thread1of1ForFork1_~i~2#1_102| 4))) (+ (select .cse1 (+ v_~B~0.offset_156 .cse2)) (select .cse3 (+ .cse2 v_~A~0.offset_162))))) (= |v_thread2Thread1of1ForFork0_#res#1.base_25| 0) (= v_~res2~0_159 |v_thread3Thread1of1ForFork1_~tmp~2#1_61|) (< 0 v_~N~0_168) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_47| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_47| |v_thread3Thread1of1ForFork1_plus_~b#1_47|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_47| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#res#1_47| |v_thread3Thread1of1ForFork1_~tmp~2#1_61|) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_56| 2147483648)) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_58| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_47| |v_thread3Thread1of1ForFork1_plus_~a#1_47|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_61| 2147483648)) (= (+ (select .cse1 v_~B~0.offset_156) (select .cse3 v_~A~0.offset_162)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_56|) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_58| v_~res1~0_153) (= .cse4 |v_thread3Thread1of1ForFork1_plus_#res#1_47|) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_58| 2147483647) (= |v_thread1Thread1of1ForFork2_plus_~b#1_56| |v_thread1Thread1of1ForFork2_plus_#in~b#1_56|) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_56|) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_77| v_~M~0_113)) (= |v_thread1Thread1of1ForFork2_plus_~a#1_56| |v_thread1Thread1of1ForFork2_plus_#in~a#1_56|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_56| 2147483647) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_58| |v_thread1Thread1of1ForFork2_plus_#res#1_56|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_61| 2147483647) (= |v_thread1Thread1of1ForFork2_~i~0#1_83| 1) (= v_~res1~0_154 |v_thread1Thread1of1ForFork2_plus_#in~a#1_56|) (< |v_thread3Thread1of1ForFork1_~i~2#1_102| v_~N~0_168) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_56| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_56|) (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_47| 0) (<= .cse4 2147483647)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_47| v_~res2~0_160))) InVars {~res1~0=v_~res1~0_154, ~A~0.base=v_~A~0.base_160, ~B~0.base=v_~B~0.base_154, ~A~0.offset=v_~A~0.offset_162, ~M~0=v_~M~0_113, #memory_int=|v_#memory_int_292|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_77|, ~N~0=v_~N~0_168, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_102|, ~B~0.offset=v_~B~0.offset_156, ~res2~0=v_~res2~0_160} OutVars{~res1~0=v_~res1~0_153, ~A~0.base=v_~A~0.base_160, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_56|, ~B~0.base=v_~B~0.base_154, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_56|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_25|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_56|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_47|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_77|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_56|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_101|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_47|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_56|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_61|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_47|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_56|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_56|, ~B~0.offset=v_~B~0.offset_156, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_47|, ~res2~0=v_~res2~0_159, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_56|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_47|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_58|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_47|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_56|, ~N~0=v_~N~0_168, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_47|, ~A~0.offset=v_~A~0.offset_162, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_25|, ~M~0=v_~M~0_113, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_83|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_56|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_56|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_36|, #memory_int=|v_#memory_int_292|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_47|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_47|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_56|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_#t~ret14#1, thread1Thread1of1ForFork2_#t~post1#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread3Thread1of1ForFork1_#t~mem12#1, ~res2~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~tmp~0#1, thread3Thread1of1ForFork1_#t~mem13#1, thread1Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:40:51,269 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] $Ultimate##0-->L74-4: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_1| v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2#1] and [1048] L61-4-->thread1EXIT: Formula: (let ((.cse4 (select |v_#memory_int_496| v_~B~0.base_311)) (.cse2 (select |v_#memory_int_496| v_~A~0.base_321))) (let ((.cse6 (select .cse2 v_~A~0.offset_323)) (.cse7 (select .cse4 v_~B~0.offset_313))) (let ((.cse0 (+ .cse6 .cse7 v_~res1~0_300)) (.cse1 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_152| |v_thread3Thread1of1ForFork1_plus_~b#1_152|)) (.cse5 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_122| |v_thread1Thread1of1ForFork2_plus_~b#1_122|))) (and (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_216| 2147483648)) (<= .cse0 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_124| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_124| v_~res1~0_299) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_152| 2147483647) (= |v_thread2Thread1of1ForFork0_#res#1.offset_75| 0) (< |v_thread3Thread1of1ForFork1_~i~2#1_374| v_~N~0_305) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_124| |v_thread1Thread1of1ForFork2_plus_#res#1_122|) (= |v_thread3Thread1of1ForFork1_~i~2#1_373| (+ |v_thread3Thread1of1ForFork1_~i~2#1_374| 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_152| .cse1) (= |v_thread1Thread1of1ForFork2_#res#1.offset_29| 0) (= (let ((.cse3 (* |v_thread1Thread1of1ForFork2_~i~0#1_151| 4))) (+ (select .cse2 (+ .cse3 v_~A~0.offset_323 (- 4))) (select .cse4 (+ .cse3 v_~B~0.offset_313 (- 4))))) |v_thread1Thread1of1ForFork2_plus_#in~b#1_122|) (= |v_thread3Thread1of1ForFork1_plus_~b#1_152| |v_thread3Thread1of1ForFork1_plus_#in~b#1_152|) (= .cse5 |v_thread1Thread1of1ForFork2_plus_#res#1_122|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_152| |v_thread3Thread1of1ForFork1_~tmp~2#1_216|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_152| 2147483648)) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_122| |v_thread1Thread1of1ForFork2_plus_~a#1_122|) (= |v_thread3Thread1of1ForFork1_plus_~a#1_152| |v_thread3Thread1of1ForFork1_plus_#in~a#1_152|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_152|) (<= 0 (+ .cse6 .cse7 v_~res1~0_300 2147483648)) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_122| |v_thread1Thread1of1ForFork2_plus_~b#1_122|) (<= 0 (+ .cse6 .cse7 2147483648)) (= |v_thread1Thread1of1ForFork2_~i~0#1_151| 2) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_208| v_~M~0_237)) (< |v_thread1Thread1of1ForFork2_~i~0#1_151| (+ v_~N~0_305 1)) (<= (+ .cse6 .cse7) 2147483647) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_124| 2147483647) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_122| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_122|) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#in~a#1_122|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_216| 2147483647) (not (< |v_thread1Thread1of1ForFork2_~i~0#1_151| v_~N~0_305)) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_122| 2147483648)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_152| 0) (<= .cse1 2147483647)) 1 0)) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_122| 2147483647) (= v_~res2~0_399 |v_thread3Thread1of1ForFork1_~tmp~2#1_216|) (= |v_thread1Thread1of1ForFork2_#res#1.base_29| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_122| (ite (or (<= .cse5 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_122| 0)) 1 0)) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_152| v_~res2~0_400) (= |v_thread2Thread1of1ForFork0_#res#1.base_75| 0) (= (let ((.cse8 (* |v_thread3Thread1of1ForFork1_~i~2#1_374| 4))) (+ (select .cse2 (+ .cse8 v_~A~0.offset_323)) (select .cse4 (+ v_~B~0.offset_313 .cse8)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_152|))))) InVars {~res1~0=v_~res1~0_300, ~A~0.base=v_~A~0.base_321, ~B~0.base=v_~B~0.base_311, ~A~0.offset=v_~A~0.offset_323, ~M~0=v_~M~0_237, #memory_int=|v_#memory_int_496|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_208|, ~N~0=v_~N~0_305, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_374|, ~B~0.offset=v_~B~0.offset_313, ~res2~0=v_~res2~0_400} OutVars{~res1~0=v_~res1~0_299, ~A~0.base=v_~A~0.base_321, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_122|, ~B~0.base=v_~B~0.base_311, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_122|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_75|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_122|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_152|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_208|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_122|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_373|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_152|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_122|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_216|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_152|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_29|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_122|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_29|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_122|, ~B~0.offset=v_~B~0.offset_313, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_152|, ~res2~0=v_~res2~0_399, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_122|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_152|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_152|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_124|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_152|, ~N~0=v_~N~0_305, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_122|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_152|, ~A~0.offset=v_~A~0.offset_323, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_75|, ~M~0=v_~M~0_237, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_151|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_122|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_122|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_147|, #memory_int=|v_#memory_int_496|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_152|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_152|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_122|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_#t~ret14#1, thread1Thread1of1ForFork2_#t~post1#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_#t~mem3#1, thread3Thread1of1ForFork1_#t~mem12#1, ~res2~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~tmp~0#1, thread3Thread1of1ForFork1_#t~mem13#1, thread1Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:40:51,881 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] $Ultimate##0-->L74-4: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_1| v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2#1] and [1045] L61-4-->L48-4: Formula: (let ((.cse1 (select |v_#memory_int_492| v_~B~0.base_307)) (.cse3 (select |v_#memory_int_492| v_~A~0.base_317))) (let ((.cse4 (select .cse3 v_~A~0.offset_319)) (.cse5 (select .cse1 v_~B~0.offset_309))) (let ((.cse7 (* |v_thread1Thread1of1ForFork2_~i~0#1_145| 4)) (.cse6 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_146| |v_thread3Thread1of1ForFork1_plus_~b#1_146|)) (.cse8 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_116| |v_thread1Thread1of1ForFork2_plus_~b#1_116|)) (.cse0 (+ .cse4 v_~res1~0_291 .cse5)) (.cse9 (+ |v_thread1Thread1of1ForFork2_plus_#in~a#1_116| 2147483648))) (and (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_118| 2147483648)) (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_146| 2147483647) (= (let ((.cse2 (* |v_thread3Thread1of1ForFork1_~i~2#1_366| 4))) (+ (select .cse1 (+ v_~B~0.offset_309 .cse2)) (select .cse3 (+ v_~A~0.offset_319 .cse2)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_146|) (<= 0 (+ .cse4 v_~res1~0_291 .cse5 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_146| |v_thread3Thread1of1ForFork1_~tmp~2#1_210|) (= .cse6 |v_thread3Thread1of1ForFork1_plus_#res#1_146|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_146| v_~res2~0_392) (= (+ |v_thread3Thread1of1ForFork1_~i~2#1_366| 1) |v_thread3Thread1of1ForFork1_~i~2#1_365|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_146| 2147483648)) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_116| (+ .cse4 (select .cse1 (+ v_~B~0.offset_309 .cse7 (- 8))) v_~res1~0_291 .cse5 (select .cse3 (+ v_~A~0.offset_319 .cse7 (- 8))))) (<= |v_thread1Thread1of1ForFork2_plus_#in~a#1_116| 2147483647) (= (+ (select .cse3 (+ v_~A~0.offset_319 .cse7 (- 4))) (select .cse1 (+ v_~B~0.offset_309 .cse7 (- 4)))) |v_thread1Thread1of1ForFork2_plus_#in~b#1_116|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_116| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_116|) (< |v_thread1Thread1of1ForFork2_~i~0#1_145| (+ v_~N~0_301 1)) (< |v_thread3Thread1of1ForFork1_~i~2#1_366| v_~N~0_301) (= |v_thread2Thread1of1ForFork0_#res#1.offset_71| 0) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_210| 2147483647) (= |v_thread2Thread1of1ForFork0_#res#1.base_71| 0) (= v_~res2~0_391 |v_thread3Thread1of1ForFork1_~tmp~2#1_210|) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_116| 2147483648)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_146| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_146|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_116| 2147483647) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_118| v_~res1~0_289) (= .cse8 |v_thread1Thread1of1ForFork2_plus_#res#1_116|) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_204| v_~M~0_233)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_146| (ite (or (<= .cse6 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_146| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_210| 2147483648)) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_116| |v_thread1Thread1of1ForFork2_plus_~a#1_116|) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_118| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_~b#1_146| |v_thread3Thread1of1ForFork1_plus_#in~b#1_146|) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_116| |v_thread1Thread1of1ForFork2_plus_~b#1_116|) (= |v_thread1Thread1of1ForFork2_~i~0#1_145| 3) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_118| |v_thread1Thread1of1ForFork2_plus_#res#1_116|) (<= 0 .cse9) (<= |v_thread1Thread1of1ForFork2_plus_#in~a#1_116| (+ .cse4 2147483647 v_~res1~0_291 .cse5)) (= |v_thread3Thread1of1ForFork1_plus_~a#1_146| |v_thread3Thread1of1ForFork1_plus_#in~a#1_146|) (= (ite (or (<= .cse8 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_116| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_116|) (<= .cse0 .cse9) (<= (+ .cse4 .cse5) 2147483647) (<= 0 (+ .cse4 .cse5 2147483648)))))) InVars {~res1~0=v_~res1~0_291, ~A~0.base=v_~A~0.base_317, ~B~0.base=v_~B~0.base_307, ~A~0.offset=v_~A~0.offset_319, ~M~0=v_~M~0_233, #memory_int=|v_#memory_int_492|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_204|, ~N~0=v_~N~0_301, ~B~0.offset=v_~B~0.offset_309, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_366|, ~res2~0=v_~res2~0_392} OutVars{~res1~0=v_~res1~0_289, ~A~0.base=v_~A~0.base_317, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_116|, ~B~0.base=v_~B~0.base_307, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_116|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_71|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_116|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_146|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_204|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_116|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_365|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_146|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_116|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_210|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_146|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_116|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_116|, ~B~0.offset=v_~B~0.offset_309, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_146|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_116|, ~res2~0=v_~res2~0_391, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_146|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_146|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_146|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_118|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_146|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_116|, ~N~0=v_~N~0_301, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_146|, ~A~0.offset=v_~A~0.offset_319, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_71|, ~M~0=v_~M~0_233, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_145|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_116|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_116|, #memory_int=|v_#memory_int_492|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_143|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_146|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_146|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_116|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_#t~ret14#1, thread1Thread1of1ForFork2_#t~post1#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread3Thread1of1ForFork1_#t~mem12#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~res2~0, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~tmp~0#1, thread3Thread1of1ForFork1_#t~mem13#1, thread1Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:40:52,571 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] $Ultimate##0-->L74-4: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_1| v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2#1] and [1049] L61-4-->L101-1: Formula: (let ((.cse5 (select |v_#memory_int_498| v_~A~0.base_323)) (.cse3 (select |v_#memory_int_498| v_~B~0.base_313))) (let ((.cse0 (select .cse3 v_~B~0.offset_315)) (.cse1 (select .cse5 v_~A~0.offset_325))) (let ((.cse8 (+ v_~res1~0_304 .cse0 .cse1)) (.cse6 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_124| |v_thread1Thread1of1ForFork2_plus_~b#1_124|)) (.cse2 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_154| |v_thread3Thread1of1ForFork1_plus_~b#1_154|))) (and (= |v_thread1Thread1of1ForFork2_~tmp~0#1_126| |v_thread1Thread1of1ForFork2_plus_#res#1_124|) (<= (+ .cse0 .cse1) 2147483647) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_126| v_~res1~0_303) (= |v_thread2Thread1of1ForFork0_#res#1.base_77| 0) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_124| |v_thread1Thread1of1ForFork2_plus_~b#1_124|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_154| 2147483648)) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_124| |v_thread1Thread1of1ForFork2_plus_~a#1_124|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_154| .cse2) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_124| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_124|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_154| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_154|) (= |v_thread1Thread1of1ForFork2_~i~0#1_153| 2) (= (let ((.cse4 (* |v_thread1Thread1of1ForFork2_~i~0#1_153| 4))) (+ (select .cse3 (+ v_~B~0.offset_315 (- 4) .cse4)) (select .cse5 (+ v_~A~0.offset_325 (- 4) .cse4)))) |v_thread1Thread1of1ForFork2_plus_#in~b#1_124|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_154| |v_thread3Thread1of1ForFork1_~tmp~2#1_218|) (<= 0 (+ v_~res1~0_304 .cse0 2147483648 .cse1)) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_210| v_~M~0_239)) (= .cse6 |v_thread1Thread1of1ForFork2_plus_#res#1_124|) (= |v_thread3Thread1of1ForFork1_plus_~b#1_154| |v_thread3Thread1of1ForFork1_plus_#in~b#1_154|) (= |v_thread3Thread1of1ForFork1_~i~2#1_377| (+ |v_thread3Thread1of1ForFork1_~i~2#1_378| 1)) (= (let ((.cse7 (* |v_thread3Thread1of1ForFork1_~i~2#1_378| 4))) (+ (select .cse3 (+ v_~B~0.offset_315 .cse7)) (select .cse5 (+ v_~A~0.offset_325 .cse7)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_154|) (= |v_thread3Thread1of1ForFork1_plus_~a#1_154| |v_thread3Thread1of1ForFork1_plus_#in~a#1_154|) (< |v_thread3Thread1of1ForFork1_~i~2#1_378| v_~N~0_307) (= |v_thread2Thread1of1ForFork0_#res#1.offset_77| 0) (= .cse8 |v_thread1Thread1of1ForFork2_plus_#in~a#1_124|) (<= .cse8 2147483647) (= |v_ULTIMATE.start_main_#t~mem26#1_54| (select (select |v_#memory_int_498| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) |v_ULTIMATE.start_main_~#t1~0#1.offset_57|)) (= v_~res2~0_403 |v_thread3Thread1of1ForFork1_~tmp~2#1_218|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_218| 2147483648)) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_124| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_124| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_154| v_~res2~0_404) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_126| 2147483648)) (= (ite (or (<= .cse6 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_124| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_124|) (< |v_thread1Thread1of1ForFork2_~i~0#1_153| (+ v_~N~0_307 1)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_154| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_154| 0) (<= .cse2 2147483647)) 1 0)) (<= 0 (+ .cse0 2147483648 .cse1)) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_218| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_154| 2147483647) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_126| 2147483647))))) InVars {~res1~0=v_~res1~0_304, ~A~0.base=v_~A~0.base_323, ~B~0.base=v_~B~0.base_313, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_210|, ~N~0=v_~N~0_307, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_57|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_378|, ~A~0.offset=v_~A~0.offset_325, ~M~0=v_~M~0_239, #memory_int=|v_#memory_int_498|, ~B~0.offset=v_~B~0.offset_315, ~res2~0=v_~res2~0_404} OutVars{~res1~0=v_~res1~0_303, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_54|, ~A~0.base=v_~A~0.base_323, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_124|, ~B~0.base=v_~B~0.base_313, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_124|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_77|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_41|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_124|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_154|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_210|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_124|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_57|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_377|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_154|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_124|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_218|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_154|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_124|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_124|, ~B~0.offset=v_~B~0.offset_315, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_154|, ~res2~0=v_~res2~0_403, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_124|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_154|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_154|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_154|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_74|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_126|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_154|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_124|, ~N~0=v_~N~0_307, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_154|, ~A~0.offset=v_~A~0.offset_325, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_77|, ~M~0=v_~M~0_239, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_153|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_124|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_124|, #memory_int=|v_#memory_int_498|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_149|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_154|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_154|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_124|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_main_#t~mem26#1, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork0_#res#1.offset, ULTIMATE.start_main_#t~nondet25#1, thread1Thread1of1ForFork2_#t~mem2#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_#t~ret14#1, thread1Thread1of1ForFork2_#t~post1#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread3Thread1of1ForFork1_#t~mem12#1, ~res2~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~pre24#1, thread1Thread1of1ForFork2_~tmp~0#1, thread3Thread1of1ForFork1_#t~mem13#1, thread1Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:40:53,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] $Ultimate##0-->L74-4: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_1| v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2#1] and [990] L61-4-->L74-4: Formula: (let ((.cse1 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_43| |v_thread3Thread1of1ForFork1_plus_~b#1_43|))) (and (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_43| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_43| (let ((.cse0 (* |v_thread3Thread1of1ForFork1_~i~2#1_96| 4))) (+ (select (select |v_#memory_int_288| v_~A~0.base_156) (+ v_~A~0.offset_158 .cse0)) (select (select |v_#memory_int_288| v_~B~0.base_150) (+ v_~B~0.offset_152 .cse0))))) (= |v_thread3Thread1of1ForFork1_plus_#res#1_43| |v_thread3Thread1of1ForFork1_~tmp~2#1_57|) (= |v_thread2Thread1of1ForFork0_#res#1.base_21| 0) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_43|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_57| 2147483648)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43| (ite (or (<= .cse1 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_43| 0)) 1 0)) (= .cse1 |v_thread3Thread1of1ForFork1_plus_#res#1_43|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_43| v_~res2~0_154) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_43| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_43| |v_thread3Thread1of1ForFork1_plus_~b#1_43|) (= v_~res2~0_153 |v_thread3Thread1of1ForFork1_~tmp~2#1_57|) (< |v_thread3Thread1of1ForFork1_~i~2#1_96| v_~N~0_164) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_43| |v_thread3Thread1of1ForFork1_plus_~a#1_43|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_57| 2147483647) (= |v_thread2Thread1of1ForFork0_#res#1.offset_21| 0) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_73| v_~M~0_109)) (= |v_thread3Thread1of1ForFork1_~i~2#1_95| (+ |v_thread3Thread1of1ForFork1_~i~2#1_96| 1)))) InVars {~A~0.base=v_~A~0.base_156, ~B~0.base=v_~B~0.base_150, ~A~0.offset=v_~A~0.offset_158, ~M~0=v_~M~0_109, #memory_int=|v_#memory_int_288|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_73|, ~N~0=v_~N~0_164, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_96|, ~B~0.offset=v_~B~0.offset_152, ~res2~0=v_~res2~0_154} OutVars{~A~0.base=v_~A~0.base_156, ~B~0.base=v_~B~0.base_150, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_21|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_43|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_73|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_95|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_43|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_57|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_43|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_43|, ~B~0.offset=v_~B~0.offset_152, ~res2~0=v_~res2~0_153, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_43|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_43|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_43|, ~N~0=v_~N~0_164, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_43|, ~A~0.offset=v_~A~0.offset_158, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_21|, ~M~0=v_~M~0_109, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_34|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_43|, #memory_int=|v_#memory_int_288|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_43|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread2Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1, ~res2~0] [2022-12-06 07:40:54,125 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1053] $Ultimate##0-->L77: Formula: (let ((.cse3 (select |v_#memory_int_504| v_~A~0.base_329)) (.cse1 (select |v_#memory_int_504| v_~B~0.base_319))) (let ((.cse11 (* v_~M~0_247 4)) (.cse6 (select .cse1 v_~B~0.offset_321)) (.cse7 (select .cse3 v_~A~0.offset_331))) (let ((.cse4 (+ v_~res1~0_316 .cse6 .cse7)) (.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_156| |v_thread3Thread1of1ForFork1_plus_~b#1_156|)) (.cse8 (select .cse3 (+ v_~A~0.offset_331 .cse11))) (.cse9 (select .cse1 (+ v_~B~0.offset_321 .cse11))) (.cse5 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_130| |v_thread1Thread1of1ForFork2_plus_~b#1_130|))) (and (<= v_~res2~0_409 2147483647) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_132| v_~res1~0_315) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_132| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_156| v_~res2~0_409) (= |v_thread3Thread1of1ForFork1_plus_#res#1_156| .cse0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_130| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_130|) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_130| |v_thread1Thread1of1ForFork2_plus_~b#1_130|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_130| |v_thread1Thread1of1ForFork2_plus_~a#1_130|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_130| 2147483647) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_132| |v_thread1Thread1of1ForFork2_plus_#res#1_130|) (= |v_thread2Thread1of1ForFork0_#res#1.base_81| 0) (< |v_thread3Thread1of1ForFork1_~i~2#1_387| v_~N~0_313) (= |v_thread1Thread1of1ForFork2_~i~0#1_159| 2) (= (let ((.cse2 (* |v_thread1Thread1of1ForFork2_~i~0#1_159| 4))) (+ (select .cse1 (+ .cse2 v_~B~0.offset_321 (- 4))) (select .cse3 (+ .cse2 v_~A~0.offset_331 (- 4))))) |v_thread1Thread1of1ForFork2_plus_#in~b#1_130|) (<= .cse4 2147483647) (= |v_thread3Thread1of1ForFork1_plus_~a#1_156| |v_thread3Thread1of1ForFork1_plus_#in~a#1_156|) (= .cse4 |v_thread1Thread1of1ForFork2_plus_#in~a#1_130|) (< |v_thread1Thread1of1ForFork2_~i~0#1_159| (+ v_~N~0_313 1)) (= |v_thread1Thread1of1ForFork2_plus_#res#1_130| .cse5) (= |v_thread2Thread1of1ForFork0_#res#1.offset_81| 0) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_220| 2147483648)) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_156| 2147483647) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_156| 2147483648)) (<= (+ .cse6 .cse7) 2147483647) (<= 0 (+ .cse8 2147483648 .cse9)) (= v_~res2~0_409 (+ .cse8 v_~res2~0_410 .cse9)) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_220| 2147483647) (= (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_156| 0)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_132| 2147483648)) (= (let ((.cse10 (* |v_thread3Thread1of1ForFork1_~i~2#1_387| 4))) (+ (select .cse1 (+ v_~B~0.offset_321 .cse10)) (select .cse3 (+ .cse10 v_~A~0.offset_331)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_156|) (<= (+ .cse8 .cse9) 2147483647) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_130| (ite (or (<= .cse5 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_130| 0)) 1 0)) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_130| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_156| |v_thread3Thread1of1ForFork1_~tmp~2#1_220|) (= |v_thread3Thread1of1ForFork1_plus_~b#1_156| |v_thread3Thread1of1ForFork1_plus_#in~b#1_156|) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_218| v_~M~0_247)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_156|) (<= 0 (+ v_~res1~0_316 .cse6 .cse7 2147483648)) (<= 0 (+ v_~res2~0_409 2147483648)) (= (+ v_~M~0_247 1) |v_thread3Thread1of1ForFork1_~i~2#1_387|) (<= 0 (+ .cse6 .cse7 2147483648)))))) InVars {~res1~0=v_~res1~0_316, ~A~0.base=v_~A~0.base_329, ~B~0.base=v_~B~0.base_319, ~A~0.offset=v_~A~0.offset_331, ~M~0=v_~M~0_247, #memory_int=|v_#memory_int_504|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_218|, ~N~0=v_~N~0_313, ~B~0.offset=v_~B~0.offset_321, ~res2~0=v_~res2~0_410} OutVars{~res1~0=v_~res1~0_315, ~A~0.base=v_~A~0.base_329, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_130|, ~B~0.base=v_~B~0.base_319, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_130|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_81|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_130|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_156|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_218|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_130|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_156|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_387|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_130|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_220|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_156|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_130|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_156|, ~B~0.offset=v_~B~0.offset_321, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_130|, ~res2~0=v_~res2~0_409, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_130|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_156|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_156|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_132|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_156|, ~N~0=v_~N~0_313, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_130|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_156|, ~A~0.offset=v_~A~0.offset_331, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_81|, ~M~0=v_~M~0_247, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_159|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_130|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_130|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_156|, #memory_int=|v_#memory_int_504|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_151|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_156|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_130|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_~i~2#1, thread1Thread1of1ForFork2_#t~post1#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork1_#t~mem12#1, thread1Thread1of1ForFork2_#t~mem3#1, ~res2~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~tmp~0#1, thread3Thread1of1ForFork1_#t~mem13#1, thread1Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork2_plus_#res#1] and [946] L48-4-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_17| |v_thread1Thread1of1ForFork2_plus_~b#1_17|))) (and (= |v_thread1Thread1of1ForFork2_plus_#res#1_17| .cse0) (= v_~res1~0_74 |v_thread1Thread1of1ForFork2_plus_#in~a#1_17|) (< |v_thread1Thread1of1ForFork2_~i~0#1_38| v_~N~0_96) (= (let ((.cse1 (* |v_thread1Thread1of1ForFork2_~i~0#1_38| 4))) (+ (select (select |v_#memory_int_182| v_~A~0.base_84) (+ v_~A~0.offset_84 .cse1)) (select (select |v_#memory_int_182| v_~B~0.base_82) (+ v_~B~0.offset_82 .cse1)))) |v_thread1Thread1of1ForFork2_plus_#in~b#1_17|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_17| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_17| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_19| 2147483648)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_17| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_17| 2147483648)) (= |v_thread1Thread1of1ForFork2_plus_~a#1_17| |v_thread1Thread1of1ForFork2_plus_#in~a#1_17|) (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_38| 1) |v_thread1Thread1of1ForFork2_~i~0#1_37|) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_19| |v_thread1Thread1of1ForFork2_plus_#res#1_17|) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_19| v_~res1~0_73) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_19| 2147483647) (= |v_thread1Thread1of1ForFork2_plus_~b#1_17| |v_thread1Thread1of1ForFork2_plus_#in~b#1_17|))) InVars {~res1~0=v_~res1~0_74, ~A~0.base=v_~A~0.base_84, ~B~0.base=v_~B~0.base_82, ~A~0.offset=v_~A~0.offset_84, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_38|, #memory_int=|v_#memory_int_182|, ~N~0=v_~N~0_96, ~B~0.offset=v_~B~0.offset_82} OutVars{~res1~0=v_~res1~0_73, ~A~0.base=v_~A~0.base_84, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_17|, ~B~0.base=v_~B~0.base_82, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_17|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_19|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_17|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_17|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_17|, ~N~0=v_~N~0_96, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0.offset=v_~A~0.offset_84, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_37|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_17|, #memory_int=|v_#memory_int_182|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_17|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_17|, ~B~0.offset=v_~B~0.offset_82, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_17|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:40:55,767 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1056] $Ultimate##0-->L48-4: Formula: (let ((.cse2 (select |v_#memory_int_510| v_~B~0.base_325)) (.cse0 (select |v_#memory_int_510| v_~A~0.base_335))) (let ((.cse3 (select .cse0 v_~A~0.offset_337)) (.cse4 (select .cse2 v_~B~0.offset_327))) (let ((.cse1 (* |v_thread1Thread1of1ForFork2_~i~0#1_165| 4)) (.cse6 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_162| |v_thread3Thread1of1ForFork1_plus_~b#1_162|)) (.cse7 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_136| |v_thread1Thread1of1ForFork2_plus_~b#1_136|)) (.cse9 (+ v_~res1~0_328 .cse3 .cse4)) (.cse5 (+ |v_thread1Thread1of1ForFork2_plus_#in~a#1_136| 2147483648))) (and (= (+ (select .cse0 (+ .cse1 v_~A~0.offset_337 (- 8))) (select .cse2 (+ .cse1 v_~B~0.offset_327 (- 8))) v_~res1~0_328 .cse3 .cse4) |v_thread1Thread1of1ForFork2_plus_#in~a#1_136|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_162| 2147483648)) (<= 0 (+ v_~res1~0_328 .cse3 2147483648 .cse4)) (= (+ v_~M~0_253 1) |v_thread3Thread1of1ForFork1_~i~2#1_399|) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_138| |v_thread1Thread1of1ForFork2_plus_#res#1_136|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_162| v_~res2~0_422) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_224| v_~M~0_253)) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_136| |v_thread1Thread1of1ForFork2_plus_~a#1_136|) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_138| v_~res1~0_327) (< v_~M~0_253 v_~N~0_319) (= |v_thread2Thread1of1ForFork0_#res#1.base_87| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_87| 0) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_136| 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_#in~a#1_136| (+ 2147483647 v_~res1~0_328 .cse3 .cse4)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_162| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_162|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_226| 2147483648)) (<= 0 .cse5) (<= (+ .cse3 .cse4) 2147483647) (= v_~res2~0_421 |v_thread3Thread1of1ForFork1_~tmp~2#1_226|) (= (+ (select .cse2 (+ .cse1 v_~B~0.offset_327 (- 4))) (select .cse0 (+ .cse1 v_~A~0.offset_337 (- 4)))) |v_thread1Thread1of1ForFork2_plus_#in~b#1_136|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_162| .cse6) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_136| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_136|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_226| 2147483647) (= .cse7 |v_thread1Thread1of1ForFork2_plus_#res#1_136|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_162| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#res#1_162| |v_thread3Thread1of1ForFork1_~tmp~2#1_226|) (= (let ((.cse8 (* v_~M~0_253 4))) (+ (select .cse2 (+ .cse8 v_~B~0.offset_327)) (select .cse0 (+ .cse8 v_~A~0.offset_337)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_162|) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_136| |v_thread1Thread1of1ForFork2_plus_~b#1_136|) (< |v_thread1Thread1of1ForFork2_~i~0#1_165| (+ v_~N~0_319 1)) (= |v_thread3Thread1of1ForFork1_plus_~a#1_162| |v_thread3Thread1of1ForFork1_plus_#in~a#1_162|) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_136| 2147483648)) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_138| 2147483648)) (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_162| 0) (<= .cse6 2147483647)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_162|) (= |v_thread3Thread1of1ForFork1_plus_~b#1_162| |v_thread3Thread1of1ForFork1_plus_#in~b#1_162|) (<= .cse9 2147483647) (= |v_thread1Thread1of1ForFork2_~i~0#1_165| 3) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_138| 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_#in~a#1_136| 2147483647) (<= 0 (+ .cse3 2147483648 .cse4)) (= (ite (or (<= .cse7 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_136| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_136|) (<= .cse9 .cse5))))) InVars {~res1~0=v_~res1~0_328, ~A~0.base=v_~A~0.base_335, ~B~0.base=v_~B~0.base_325, ~A~0.offset=v_~A~0.offset_337, ~M~0=v_~M~0_253, #memory_int=|v_#memory_int_510|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_224|, ~N~0=v_~N~0_319, ~B~0.offset=v_~B~0.offset_327, ~res2~0=v_~res2~0_422} OutVars{~res1~0=v_~res1~0_327, ~A~0.base=v_~A~0.base_335, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_136|, ~B~0.base=v_~B~0.base_325, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_136|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_87|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_136|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_162|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_224|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_136|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_399|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_162|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_136|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_226|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_162|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_136|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_136|, ~B~0.offset=v_~B~0.offset_327, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_162|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_136|, ~res2~0=v_~res2~0_421, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_162|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_162|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_162|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_138|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_162|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_136|, ~N~0=v_~N~0_319, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_162|, ~A~0.offset=v_~A~0.offset_337, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_87|, ~M~0=v_~M~0_253, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_165|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_136|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_136|, #memory_int=|v_#memory_int_510|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_157|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_162|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_162|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_136|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_#t~ret14#1, thread1Thread1of1ForFork2_#t~post1#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread3Thread1of1ForFork1_#t~mem12#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~res2~0, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~tmp~0#1, thread3Thread1of1ForFork1_#t~mem13#1, thread1Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork2_plus_#res#1] and [847] L74-4-->L77: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|))) (and (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_5| 0)) 1 0)) (= v_~res2~0_47 |v_thread3Thread1of1ForFork1_plus_#in~a#1_5|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483647) (= (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_17| 4))) (+ (select (select |v_#memory_int_88| v_~B~0.base_42) (+ .cse1 v_~B~0.offset_42)) (select (select |v_#memory_int_88| v_~A~0.base_44) (+ .cse1 v_~A~0.offset_44)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_5|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_5|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_5| |v_thread3Thread1of1ForFork1_plus_~a#1_5|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_7| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_5| |v_thread3Thread1of1ForFork1_~tmp~2#1_7|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|) (< |v_thread3Thread1of1ForFork1_~i~2#1_17| v_~N~0_20))) InVars {~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, ~A~0.offset=v_~A~0.offset_44, #memory_int=|v_#memory_int_88|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~A~0.base=v_~A~0.base_44, ~B~0.base=v_~B~0.base_42, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_5|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_5|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_5|, ~N~0=v_~N~0_20, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_17|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_5|, ~A~0.offset=v_~A~0.offset_44, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_7|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_5|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_5|, #memory_int=|v_#memory_int_88|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_5|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_5|, ~B~0.offset=v_~B~0.offset_42, ~res2~0=v_~res2~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem12#1, thread3Thread1of1ForFork1_plus_~b#1] [2022-12-06 07:40:58,122 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1061] $Ultimate##0-->L77: Formula: (let ((.cse9 (select |v_#memory_int_520| v_~B~0.base_335)) (.cse7 (select |v_#memory_int_520| v_~A~0.base_345))) (let ((.cse4 (select .cse7 v_~A~0.offset_347)) (.cse5 (select .cse9 v_~B~0.offset_337)) (.cse12 (* v_~M~0_263 4))) (let ((.cse0 (select .cse7 (+ v_~A~0.offset_347 .cse12))) (.cse1 (select .cse9 (+ v_~B~0.offset_337 .cse12))) (.cse2 (+ .cse4 v_~res1~0_346 .cse5)) (.cse10 (* |v_thread1Thread1of1ForFork2_~i~0#1_175| 4)) (.cse11 (+ |v_thread1Thread1of1ForFork2_plus_#in~a#1_146| 2147483648)) (.cse6 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_172| |v_thread3Thread1of1ForFork1_plus_~b#1_172|)) (.cse3 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_146| |v_thread1Thread1of1ForFork2_plus_~b#1_146|))) (and (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_172| v_~res2~0_443) (< |v_thread3Thread1of1ForFork1_~i~2#1_417| v_~N~0_329) (<= (+ .cse0 .cse1) 2147483647) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_148| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#res#1_172| |v_thread3Thread1of1ForFork1_~tmp~2#1_236|) (= |v_thread2Thread1of1ForFork0_#res#1.base_97| 0) (<= .cse2 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_146| 2147483648)) (= |v_thread1Thread1of1ForFork2_~i~0#1_175| 3) (= |v_thread1Thread1of1ForFork2_plus_#res#1_146| .cse3) (= (+ .cse0 .cse1 v_~res2~0_444) v_~res2~0_443) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_172| 2147483648)) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_236| 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_#in~a#1_146| (+ 2147483647 .cse4 v_~res1~0_346 .cse5)) (= .cse6 |v_thread3Thread1of1ForFork1_plus_#res#1_172|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_172| 2147483647) (<= 0 (+ v_~res2~0_443 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_~a#1_172| |v_thread3Thread1of1ForFork1_plus_#in~a#1_172|) (<= |v_thread1Thread1of1ForFork2_plus_#in~a#1_146| 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_146| 2147483647) (<= 0 (+ .cse0 .cse1 2147483648)) (= (let ((.cse8 (* |v_thread3Thread1of1ForFork1_~i~2#1_417| 4))) (+ (select .cse7 (+ .cse8 v_~A~0.offset_347)) (select .cse9 (+ v_~B~0.offset_337 .cse8)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_172|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_146| |v_thread1Thread1of1ForFork2_plus_~a#1_146|) (<= 0 (+ .cse4 .cse5 2147483648)) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_146| |v_thread1Thread1of1ForFork2_plus_~b#1_146|) (<= 0 (+ .cse4 v_~res1~0_346 .cse5 2147483648)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_172|) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_236| 2147483648)) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_148| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_148| v_~res1~0_345) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_146| (+ .cse4 v_~res1~0_346 (select .cse7 (+ v_~A~0.offset_347 .cse10 (- 8))) .cse5 (select .cse9 (+ v_~B~0.offset_337 .cse10 (- 8))))) (= (+ v_~M~0_263 1) |v_thread3Thread1of1ForFork1_~i~2#1_417|) (= |v_thread3Thread1of1ForFork1_plus_~b#1_172| |v_thread3Thread1of1ForFork1_plus_#in~b#1_172|) (<= .cse2 .cse11) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_234| v_~M~0_263)) (< |v_thread1Thread1of1ForFork2_~i~0#1_175| (+ v_~N~0_329 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_146| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_146|) (= (+ (select .cse7 (+ v_~A~0.offset_347 (- 4) .cse10)) (select .cse9 (+ v_~B~0.offset_337 (- 4) .cse10))) |v_thread1Thread1of1ForFork2_plus_#in~b#1_146|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_97| 0) (<= 0 .cse11) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_148| |v_thread1Thread1of1ForFork2_plus_#res#1_146|) (<= (+ .cse4 .cse5) 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_172| 0) (<= .cse6 2147483647)) 1 0)) (<= v_~res2~0_443 2147483647) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_146| (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_146| 0) (<= .cse3 2147483647)) 1 0)))))) InVars {~res1~0=v_~res1~0_346, ~A~0.base=v_~A~0.base_345, ~B~0.base=v_~B~0.base_335, ~A~0.offset=v_~A~0.offset_347, ~M~0=v_~M~0_263, #memory_int=|v_#memory_int_520|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_234|, ~N~0=v_~N~0_329, ~B~0.offset=v_~B~0.offset_337, ~res2~0=v_~res2~0_444} OutVars{~res1~0=v_~res1~0_345, ~A~0.base=v_~A~0.base_345, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_146|, ~B~0.base=v_~B~0.base_335, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_146|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_97|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_146|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_172|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_234|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_146|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_172|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_417|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_146|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_236|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_172|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_146|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_172|, ~B~0.offset=v_~B~0.offset_337, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_146|, ~res2~0=v_~res2~0_443, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_146|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_172|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_172|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_172|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_148|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_172|, ~N~0=v_~N~0_329, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_146|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_172|, ~A~0.offset=v_~A~0.offset_347, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_97|, ~M~0=v_~M~0_263, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_175|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_146|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_146|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_172|, #memory_int=|v_#memory_int_520|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_169|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_172|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_146|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork2_#t~mem2#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_~i~2#1, thread1Thread1of1ForFork2_#t~post1#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork1_#t~mem12#1, thread1Thread1of1ForFork2_#t~mem3#1, ~res2~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~tmp~0#1, thread3Thread1of1ForFork1_#t~mem13#1, thread1Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread3Thread1of1ForFork1_#t~ret15#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork2_plus_#res#1] and [946] L48-4-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_17| |v_thread1Thread1of1ForFork2_plus_~b#1_17|))) (and (= |v_thread1Thread1of1ForFork2_plus_#res#1_17| .cse0) (= v_~res1~0_74 |v_thread1Thread1of1ForFork2_plus_#in~a#1_17|) (< |v_thread1Thread1of1ForFork2_~i~0#1_38| v_~N~0_96) (= (let ((.cse1 (* |v_thread1Thread1of1ForFork2_~i~0#1_38| 4))) (+ (select (select |v_#memory_int_182| v_~A~0.base_84) (+ v_~A~0.offset_84 .cse1)) (select (select |v_#memory_int_182| v_~B~0.base_82) (+ v_~B~0.offset_82 .cse1)))) |v_thread1Thread1of1ForFork2_plus_#in~b#1_17|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_17| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_17| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_19| 2147483648)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_17| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_17| 2147483648)) (= |v_thread1Thread1of1ForFork2_plus_~a#1_17| |v_thread1Thread1of1ForFork2_plus_#in~a#1_17|) (= (+ |v_thread1Thread1of1ForFork2_~i~0#1_38| 1) |v_thread1Thread1of1ForFork2_~i~0#1_37|) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_19| |v_thread1Thread1of1ForFork2_plus_#res#1_17|) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_19| v_~res1~0_73) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_19| 2147483647) (= |v_thread1Thread1of1ForFork2_plus_~b#1_17| |v_thread1Thread1of1ForFork2_plus_#in~b#1_17|))) InVars {~res1~0=v_~res1~0_74, ~A~0.base=v_~A~0.base_84, ~B~0.base=v_~B~0.base_82, ~A~0.offset=v_~A~0.offset_84, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_38|, #memory_int=|v_#memory_int_182|, ~N~0=v_~N~0_96, ~B~0.offset=v_~B~0.offset_82} OutVars{~res1~0=v_~res1~0_73, ~A~0.base=v_~A~0.base_84, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_17|, ~B~0.base=v_~B~0.base_82, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_17|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_19|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_17|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_17|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_17|, ~N~0=v_~N~0_96, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_15|, ~A~0.offset=v_~A~0.offset_84, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_37|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_17|, #memory_int=|v_#memory_int_182|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_17|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_17|, ~B~0.offset=v_~B~0.offset_82, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_17|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_#t~mem2#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_#t~post1#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 07:40:58,122 WARN L322 ript$VariableManager]: TermVariable LBE534 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:58,122 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:58,122 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:58,122 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:58,122 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:58,122 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:58,122 WARN L322 ript$VariableManager]: TermVariable LBE535 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:58,122 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:58,123 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:58,123 WARN L322 ript$VariableManager]: TermVariable LBE444 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:58,123 WARN L322 ript$VariableManager]: TermVariable LBE520 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:58,123 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:58,123 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:58,123 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:58,123 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:58,123 WARN L322 ript$VariableManager]: TermVariable LBE192 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:40:59,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 07:40:59,958 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IndexOutOfBoundsException: Index 18 out of bounds for length 18 at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70) at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:248) at java.base/java.util.Objects.checkIndex(Objects.java:372) at java.base/java.util.ArrayList.get(ArrayList.java:459) at de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetRun.getTransition(PetriNetRun.java:125) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.adaptRun(ChoiceRule.java:163) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.applyInternal(ChoiceRule.java:115) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.choiceRuleWrapper(LiptonReduction.java:239) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:200) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 07:40:59,976 INFO L158 Benchmark]: Toolchain (without parser) took 123213.36ms. Allocated memory was 221.2MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 197.3MB in the beginning and 696.0MB in the end (delta: -498.7MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-06 07:40:59,976 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 221.2MB. Free memory was 197.7MB in the beginning and 197.6MB in the end (delta: 100.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:40:59,976 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.63ms. Allocated memory is still 221.2MB. Free memory was 196.8MB in the beginning and 183.7MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 07:40:59,976 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.06ms. Allocated memory is still 221.2MB. Free memory was 183.7MB in the beginning and 181.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:40:59,976 INFO L158 Benchmark]: Boogie Preprocessor took 41.41ms. Allocated memory is still 221.2MB. Free memory was 181.1MB in the beginning and 179.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:40:59,976 INFO L158 Benchmark]: RCFGBuilder took 686.62ms. Allocated memory is still 221.2MB. Free memory was 179.0MB in the beginning and 121.3MB in the end (delta: 57.7MB). Peak memory consumption was 57.7MB. Max. memory is 8.0GB. [2022-12-06 07:40:59,977 INFO L158 Benchmark]: TraceAbstraction took 122165.62ms. Allocated memory was 221.2MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 120.8MB in the beginning and 696.0MB in the end (delta: -575.3MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-06 07:40:59,978 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 221.2MB. Free memory was 197.7MB in the beginning and 197.6MB in the end (delta: 100.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 254.63ms. Allocated memory is still 221.2MB. Free memory was 196.8MB in the beginning and 183.7MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.06ms. Allocated memory is still 221.2MB. Free memory was 183.7MB in the beginning and 181.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.41ms. Allocated memory is still 221.2MB. Free memory was 181.1MB in the beginning and 179.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 686.62ms. Allocated memory is still 221.2MB. Free memory was 179.0MB in the beginning and 121.3MB in the end (delta: 57.7MB). Peak memory consumption was 57.7MB. Max. memory is 8.0GB. * TraceAbstraction took 122165.62ms. Allocated memory was 221.2MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 120.8MB in the beginning and 696.0MB in the end (delta: -575.3MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 160 PlacesBefore, 33 PlacesAfterwards, 166 TransitionsBefore, 28 TransitionsAfterwards, 1518 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 96 TrivialYvCompositions, 31 ConcurrentYvCompositions, 11 ChoiceCompositions, 138 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 838, independent: 820, independent conditional: 820, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 838, independent: 820, independent conditional: 0, independent unconditional: 820, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 838, independent: 820, independent conditional: 0, independent unconditional: 820, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 838, independent: 820, independent conditional: 0, independent unconditional: 820, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 791, independent: 779, independent conditional: 0, independent unconditional: 779, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 791, independent: 779, independent conditional: 0, independent unconditional: 779, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 838, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 791, unknown conditional: 0, unknown unconditional: 791] , Statistics on independence cache: Total cache size (in pairs): 1262, Positive cache size: 1250, Positive conditional cache size: 0, Positive unconditional cache size: 1250, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, 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, 30 PlacesBefore, 30 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 3, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 12, Positive conditional cache size: 2, Positive unconditional cache size: 10, Negative cache size: 2, Negative conditional cache size: 1, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 2, independent unconditional: 9, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, independent: 11, independent conditional: 2, independent unconditional: 9, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 2, independent unconditional: 9, dependent: 2, dependent conditional: 1, dependent unconditional: 1, 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: 13, independent: 11, independent conditional: 2, independent unconditional: 9, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 12, Positive conditional cache size: 2, Positive unconditional cache size: 10, Negative cache size: 2, Negative conditional cache size: 1, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 42 PlacesBefore, 40 PlacesAfterwards, 43 TransitionsBefore, 41 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 14, Positive cache size: 12, Positive conditional cache size: 2, Positive unconditional cache size: 10, Negative cache size: 2, Negative conditional cache size: 1, 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.3s, 41 PlacesBefore, 40 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 50, 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: 50, independent: 50, independent conditional: 50, 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: 50, independent: 50, independent conditional: 28, independent unconditional: 22, 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: 50, independent: 50, independent conditional: 28, independent unconditional: 22, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 8, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 33, independent conditional: 20, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 17, unknown conditional: 8, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 35, Positive cache size: 33, Positive conditional cache size: 10, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 80 PlacesBefore, 72 PlacesAfterwards, 128 TransitionsBefore, 120 TransitionsAfterwards, 822 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 53, Positive conditional cache size: 25, Positive unconditional cache size: 28, Negative cache size: 5, Negative conditional cache size: 4, 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: 4.0s, 89 PlacesBefore, 88 PlacesAfterwards, 235 TransitionsBefore, 234 TransitionsAfterwards, 1992 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 58, Positive cache size: 53, Positive conditional cache size: 25, Positive unconditional cache size: 28, Negative cache size: 5, Negative conditional cache size: 4, 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.0s, 97 PlacesBefore, 97 PlacesAfterwards, 254 TransitionsBefore, 254 TransitionsAfterwards, 2148 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): 58, Positive cache size: 53, Positive conditional cache size: 25, Positive unconditional cache size: 28, Negative cache size: 5, Negative conditional cache size: 4, 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: 2.0s, 114 PlacesBefore, 113 PlacesAfterwards, 290 TransitionsBefore, 289 TransitionsAfterwards, 2316 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 65, Positive conditional cache size: 36, Positive unconditional cache size: 29, Negative cache size: 8, Negative conditional cache size: 7, 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: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 123 PlacesBefore, 123 PlacesAfterwards, 312 TransitionsBefore, 312 TransitionsAfterwards, 2448 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 66, Positive conditional cache size: 37, Positive unconditional cache size: 29, Negative cache size: 8, Negative conditional cache size: 7, 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: 1.3s, 129 PlacesBefore, 128 PlacesAfterwards, 319 TransitionsBefore, 318 TransitionsAfterwards, 2482 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 73, Positive conditional cache size: 44, Positive unconditional cache size: 29, Negative cache size: 8, Negative conditional cache size: 7, 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.0s, 129 PlacesBefore, 129 PlacesAfterwards, 265 TransitionsBefore, 265 TransitionsAfterwards, 2110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 73, Positive conditional cache size: 44, Positive unconditional cache size: 29, Negative cache size: 8, Negative conditional cache size: 7, 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.0s, 130 PlacesBefore, 130 PlacesAfterwards, 263 TransitionsBefore, 263 TransitionsAfterwards, 2106 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 74, Positive conditional cache size: 45, Positive unconditional cache size: 29, Negative cache size: 8, Negative conditional cache size: 7, 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.0s, 133 PlacesBefore, 133 PlacesAfterwards, 262 TransitionsBefore, 262 TransitionsAfterwards, 2110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 74, Positive conditional cache size: 45, Positive unconditional cache size: 29, Negative cache size: 8, Negative conditional cache size: 7, 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: 2.0s, 149 PlacesBefore, 148 PlacesAfterwards, 285 TransitionsBefore, 284 TransitionsAfterwards, 2216 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 83, Positive conditional cache size: 54, Positive unconditional cache size: 29, Negative cache size: 9, Negative conditional cache size: 8, 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: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 153 PlacesBefore, 152 PlacesAfterwards, 301 TransitionsBefore, 300 TransitionsAfterwards, 2322 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 84, Positive conditional cache size: 55, Positive unconditional cache size: 29, Negative cache size: 10, Negative conditional cache size: 9, 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: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 153 PlacesBefore, 152 PlacesAfterwards, 283 TransitionsBefore, 282 TransitionsAfterwards, 2222 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 90, Positive conditional cache size: 61, Positive unconditional cache size: 29, Negative cache size: 19, Negative conditional cache size: 18, 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: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 141 PlacesBefore, 141 PlacesAfterwards, 243 TransitionsBefore, 243 TransitionsAfterwards, 1872 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 26, dependent conditional: 26, 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: 38, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 93, Positive conditional cache size: 64, Positive unconditional cache size: 29, Negative cache size: 19, Negative conditional cache size: 18, 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: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 140 PlacesBefore, 138 PlacesAfterwards, 191 TransitionsBefore, 189 TransitionsAfterwards, 1394 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 98, Positive conditional cache size: 69, Positive unconditional cache size: 29, Negative cache size: 20, Negative conditional cache size: 19, 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: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 142 PlacesBefore, 142 PlacesAfterwards, 192 TransitionsBefore, 192 TransitionsAfterwards, 1416 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, 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: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 99, Positive conditional cache size: 70, Positive unconditional cache size: 29, Negative cache size: 21, Negative conditional cache size: 20, 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: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 152 PlacesBefore, 152 PlacesAfterwards, 220 TransitionsBefore, 220 TransitionsAfterwards, 1674 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, 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: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 99, Positive conditional cache size: 70, Positive unconditional cache size: 29, Negative cache size: 22, Negative conditional cache size: 21, 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: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 114 PlacesBefore, 114 PlacesAfterwards, 119 TransitionsBefore, 119 TransitionsAfterwards, 818 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 0, independent unconditional: 7, 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: 0, independent unconditional: 7, 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: 0, independent unconditional: 7, 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: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 103, Positive conditional cache size: 70, Positive unconditional cache size: 33, Negative cache size: 22, Negative conditional cache size: 21, 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.0s, 98 PlacesBefore, 98 PlacesAfterwards, 123 TransitionsBefore, 123 TransitionsAfterwards, 818 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): 125, Positive cache size: 103, Positive conditional cache size: 70, Positive unconditional cache size: 33, Negative cache size: 22, Negative conditional cache size: 21, 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.1s, 114 PlacesBefore, 114 PlacesAfterwards, 139 TransitionsBefore, 139 TransitionsAfterwards, 906 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 111, Positive conditional cache size: 78, Positive unconditional cache size: 33, Negative cache size: 22, Negative conditional cache size: 21, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 120 PlacesBefore, 120 PlacesAfterwards, 138 TransitionsBefore, 138 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 9, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 16, independent conditional: 9, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 9, independent unconditional: 7, 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: 16, independent: 16, independent conditional: 9, independent unconditional: 7, 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: 16, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 16, unknown conditional: 9, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 127, Positive conditional cache size: 87, Positive unconditional cache size: 40, Negative cache size: 22, Negative conditional cache size: 21, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 119 PlacesBefore, 119 PlacesAfterwards, 132 TransitionsBefore, 132 TransitionsAfterwards, 874 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): 149, Positive cache size: 127, Positive conditional cache size: 87, Positive unconditional cache size: 40, Negative cache size: 22, Negative conditional cache size: 21, 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: 2.5s, 118 PlacesBefore, 118 PlacesAfterwards, 128 TransitionsBefore, 128 TransitionsAfterwards, 836 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): 149, Positive cache size: 127, Positive conditional cache size: 87, Positive unconditional cache size: 40, Negative cache size: 22, Negative conditional cache size: 21, 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: 7.5s, 105 PlacesBefore, 102 PlacesAfterwards, 129 TransitionsBefore, 126 TransitionsAfterwards, 760 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 127, Positive conditional cache size: 87, Positive unconditional cache size: 40, Negative cache size: 22, Negative conditional cache size: 21, 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: 0 - ExceptionOrErrorResult: IndexOutOfBoundsException: Index 18 out of bounds for length 18 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IndexOutOfBoundsException: Index 18 out of bounds for length 18: java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 07:41:00,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...