/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:13:51,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:13:51,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:13:51,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:13:51,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:13:51,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:13:51,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:13:51,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:13:51,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:13:51,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:13:51,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:13:51,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:13:51,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:13:51,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:13:51,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:13:51,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:13:51,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:13:51,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:13:51,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:13:51,176 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:13:51,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:13:51,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:13:51,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:13:51,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:13:51,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:13:51,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:13:51,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:13:51,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:13:51,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:13:51,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:13:51,191 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:13:51,192 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:13:51,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:13:51,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:13:51,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:13:51,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:13:51,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:13:51,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:13:51,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:13:51,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:13:51,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:13:51,201 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 00:13:51,227 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:13:51,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:13:51,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:13:51,229 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:13:51,229 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:13:51,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:13:51,230 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:13:51,230 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:13:51,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:13:51,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:13:51,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:13:51,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:13:51,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:13:51,231 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:13:51,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:13:51,231 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:13:51,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:13:51,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:13:51,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:13:51,232 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:13:51,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:13:51,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:13:51,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:13:51,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:13:51,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:13:51,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:13:51,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:13:51,233 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:13:51,233 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 00:13:51,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:13:51,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:13:51,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:13:51,561 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:13:51,562 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:13:51,562 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 00:13:52,551 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:13:52,764 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:13:52,765 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2022-12-06 00:13:52,772 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3760c39f/756e51dce33546048945694ec45e4087/FLAG6bd94c98d [2022-12-06 00:13:52,782 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3760c39f/756e51dce33546048945694ec45e4087 [2022-12-06 00:13:52,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:13:52,785 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:13:52,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:13:52,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:13:52,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:13:52,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:13:52" (1/1) ... [2022-12-06 00:13:52,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f8cc7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:52, skipping insertion in model container [2022-12-06 00:13:52,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:13:52" (1/1) ... [2022-12-06 00:13:52,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:13:52,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:13:52,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:52,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:52,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:52,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:52,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:52,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:52,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:52,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:52,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:52,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:52,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:52,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:52,946 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 00:13:52,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:13:52,958 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:13:52,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:52,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:52,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:52,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:52,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:52,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:52,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:52,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:52,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:52,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:52,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:52,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:52,973 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 00:13:52,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:13:52,985 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:13:52,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:52 WrapperNode [2022-12-06 00:13:52,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:13:52,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:13:52,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:13:52,986 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:13:52,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:52" (1/1) ... [2022-12-06 00:13:52,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:52" (1/1) ... [2022-12-06 00:13:53,016 INFO L138 Inliner]: procedures = 25, calls = 58, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 280 [2022-12-06 00:13:53,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:13:53,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:13:53,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:13:53,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:13:53,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:52" (1/1) ... [2022-12-06 00:13:53,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:52" (1/1) ... [2022-12-06 00:13:53,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:52" (1/1) ... [2022-12-06 00:13:53,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:52" (1/1) ... [2022-12-06 00:13:53,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:52" (1/1) ... [2022-12-06 00:13:53,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:52" (1/1) ... [2022-12-06 00:13:53,045 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:52" (1/1) ... [2022-12-06 00:13:53,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:52" (1/1) ... [2022-12-06 00:13:53,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:13:53,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:13:53,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:13:53,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:13:53,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:52" (1/1) ... [2022-12-06 00:13:53,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:13:53,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:13:53,113 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 00:13:53,159 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 00:13:53,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:13:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:13:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:13:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:13:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:13:53,189 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:13:53,189 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:13:53,189 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:13:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 00:13:53,190 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 00:13:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:13:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:13:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:13:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:13:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:13:53,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:13:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:13:53,192 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 00:13:53,297 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:13:53,299 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:13:53,642 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:13:53,870 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:13:53,870 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-06 00:13:53,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:13:53 BoogieIcfgContainer [2022-12-06 00:13:53,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:13:53,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:13:53,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:13:53,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:13:53,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:13:52" (1/3) ... [2022-12-06 00:13:53,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c911091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:13:53, skipping insertion in model container [2022-12-06 00:13:53,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:52" (2/3) ... [2022-12-06 00:13:53,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c911091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:13:53, skipping insertion in model container [2022-12-06 00:13:53,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:13:53" (3/3) ... [2022-12-06 00:13:53,880 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2022-12-06 00:13:53,892 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:13:53,892 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:13:53,893 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:13:53,956 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 00:13:53,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 179 transitions, 382 flow [2022-12-06 00:13:54,060 INFO L130 PetriNetUnfolder]: 16/176 cut-off events. [2022-12-06 00:13:54,060 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:13:54,066 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 00:13:54,066 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 179 transitions, 382 flow [2022-12-06 00:13:54,073 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 166 transitions, 350 flow [2022-12-06 00:13:54,074 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:54,093 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 166 transitions, 350 flow [2022-12-06 00:13:54,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 166 transitions, 350 flow [2022-12-06 00:13:54,126 INFO L130 PetriNetUnfolder]: 16/166 cut-off events. [2022-12-06 00:13:54,126 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:13:54,129 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 00:13:54,131 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 166 transitions, 350 flow [2022-12-06 00:13:54,131 INFO L188 LiptonReduction]: Number of co-enabled transitions 1518 [2022-12-06 00:13:59,602 INFO L203 LiptonReduction]: Total number of compositions: 138 [2022-12-06 00:13:59,613 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:13:59,617 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;@6a108b9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:13:59,618 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 00:13:59,622 INFO L130 PetriNetUnfolder]: 5/27 cut-off events. [2022-12-06 00:13:59,622 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:13:59,622 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:59,623 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 00:13:59,623 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 00:13:59,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:59,627 INFO L85 PathProgramCache]: Analyzing trace with hash 597230375, now seen corresponding path program 1 times [2022-12-06 00:13:59,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:59,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32258083] [2022-12-06 00:13:59,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:59,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:00,044 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 00:14:00,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:00,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32258083] [2022-12-06 00:14:00,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32258083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:00,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:00,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 00:14:00,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377909741] [2022-12-06 00:14:00,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:00,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:14:00,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:00,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:14:00,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:14:00,071 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 00:14:00,072 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 00:14:00,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:00,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 00:14:00,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:00,234 INFO L130 PetriNetUnfolder]: 620/871 cut-off events. [2022-12-06 00:14:00,234 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-06 00:14:00,239 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 00:14:00,245 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 38 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2022-12-06 00:14:00,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 211 flow [2022-12-06 00:14:00,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:14:00,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:14:00,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 00:14:00,255 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2022-12-06 00:14:00,256 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 74 flow. Second operand 3 states and 53 transitions. [2022-12-06 00:14:00,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 46 transitions, 211 flow [2022-12-06 00:14:00,261 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 00:14:00,262 INFO L231 Difference]: Finished difference. Result has 30 places, 31 transitions, 88 flow [2022-12-06 00:14:00,264 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 00:14:00,267 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, -3 predicate places. [2022-12-06 00:14:00,267 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:00,268 INFO L89 Accepts]: Start accepts. Operand has 30 places, 31 transitions, 88 flow [2022-12-06 00:14:00,270 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:00,271 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:00,271 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 31 transitions, 88 flow [2022-12-06 00:14:00,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 31 transitions, 88 flow [2022-12-06 00:14:00,291 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 00:14:00,291 INFO L382 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-06 00:14:00,291 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 00:14:00,291 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 00:14:00,291 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 00:14:00,291 INFO L130 PetriNetUnfolder]: 24/74 cut-off events. [2022-12-06 00:14:00,291 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:14:00,292 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 00:14:00,293 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 31 transitions, 88 flow [2022-12-06 00:14:00,293 INFO L188 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-06 00:14:00,301 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:14:00,303 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 00:14:00,303 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 31 transitions, 88 flow [2022-12-06 00:14:00,303 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 00:14:00,303 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:00,304 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 00:14:00,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:14:00,307 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 00:14:00,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:00,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1243665619, now seen corresponding path program 1 times [2022-12-06 00:14:00,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:00,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286775478] [2022-12-06 00:14:00,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:00,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:00,486 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 00:14:00,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:00,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286775478] [2022-12-06 00:14:00,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286775478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:00,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:00,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:14:00,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075887236] [2022-12-06 00:14:00,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:00,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:14:00,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:00,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:14:00,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:14:00,490 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 00:14:00,490 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 00:14:00,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:00,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 00:14:00,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:00,631 INFO L130 PetriNetUnfolder]: 619/901 cut-off events. [2022-12-06 00:14:00,631 INFO L131 PetriNetUnfolder]: For 140/140 co-relation queries the response was YES. [2022-12-06 00:14:00,632 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 00:14:00,635 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 27 selfloop transitions, 4 changer transitions 1/34 dead transitions. [2022-12-06 00:14:00,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 158 flow [2022-12-06 00:14:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:14:00,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:14:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 00:14:00,638 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-06 00:14:00,638 INFO L175 Difference]: Start difference. First operand has 30 places, 31 transitions, 88 flow. Second operand 4 states and 40 transitions. [2022-12-06 00:14:00,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 158 flow [2022-12-06 00:14:00,639 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 00:14:00,640 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 110 flow [2022-12-06 00:14:00,640 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 00:14:00,641 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2022-12-06 00:14:00,641 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:00,641 INFO L89 Accepts]: Start accepts. Operand has 34 places, 33 transitions, 110 flow [2022-12-06 00:14:00,642 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:00,642 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:00,642 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 33 transitions, 110 flow [2022-12-06 00:14:00,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 33 transitions, 110 flow [2022-12-06 00:14:00,650 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 00:14:00,651 INFO L382 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-06 00:14:00,651 INFO L385 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-06 00:14:00,652 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 00:14:00,652 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 00:14:00,652 INFO L130 PetriNetUnfolder]: 24/76 cut-off events. [2022-12-06 00:14:00,652 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:14:00,652 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 00:14:00,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 33 transitions, 110 flow [2022-12-06 00:14:00,653 INFO L188 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-06 00:14:00,655 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:14:00,656 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 00:14:00,657 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 110 flow [2022-12-06 00:14:00,657 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 00:14:00,657 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:00,657 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 00:14:00,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:14:00,657 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 00:14:00,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:00,658 INFO L85 PathProgramCache]: Analyzing trace with hash -444556866, now seen corresponding path program 1 times [2022-12-06 00:14:00,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:00,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817066350] [2022-12-06 00:14:00,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:00,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:00,813 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 00:14:00,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:00,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817066350] [2022-12-06 00:14:00,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817066350] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:14:00,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529103856] [2022-12-06 00:14:00,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:00,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:14:00,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:14:00,820 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 00:14:00,845 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 00:14:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:00,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:14:00,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:14:01,053 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 00:14:01,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:14:01,098 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 00:14:01,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529103856] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 00:14:01,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 00:14:01,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2022-12-06 00:14:01,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26309324] [2022-12-06 00:14:01,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:01,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:14:01,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:01,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:14:01,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-12-06 00:14:01,100 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-06 00:14:01,100 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 00:14:01,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:01,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-06 00:14:01,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:01,337 INFO L130 PetriNetUnfolder]: 891/1281 cut-off events. [2022-12-06 00:14:01,337 INFO L131 PetriNetUnfolder]: For 220/220 co-relation queries the response was YES. [2022-12-06 00:14:01,338 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 00:14:01,343 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 57 selfloop transitions, 19 changer transitions 0/77 dead transitions. [2022-12-06 00:14:01,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 77 transitions, 380 flow [2022-12-06 00:14:01,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:14:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:14:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 77 transitions. [2022-12-06 00:14:01,348 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-06 00:14:01,349 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 110 flow. Second operand 8 states and 77 transitions. [2022-12-06 00:14:01,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 77 transitions, 380 flow [2022-12-06 00:14:01,351 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 00:14:01,352 INFO L231 Difference]: Finished difference. Result has 42 places, 43 transitions, 211 flow [2022-12-06 00:14:01,353 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 00:14:01,353 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2022-12-06 00:14:01,354 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:01,354 INFO L89 Accepts]: Start accepts. Operand has 42 places, 43 transitions, 211 flow [2022-12-06 00:14:01,356 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:01,356 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:01,356 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 43 transitions, 211 flow [2022-12-06 00:14:01,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 43 transitions, 211 flow [2022-12-06 00:14:01,368 INFO L130 PetriNetUnfolder]: 54/139 cut-off events. [2022-12-06 00:14:01,369 INFO L131 PetriNetUnfolder]: For 49/57 co-relation queries the response was YES. [2022-12-06 00:14:01,369 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 00:14:01,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 43 transitions, 211 flow [2022-12-06 00:14:01,370 INFO L188 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-06 00:14:02,614 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:14:02,615 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1261 [2022-12-06 00:14:02,615 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 41 transitions, 201 flow [2022-12-06 00:14:02,616 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 00:14:02,616 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:02,616 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 00:14:02,627 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 00:14:02,816 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 00:14:02,817 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 00:14:02,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:02,817 INFO L85 PathProgramCache]: Analyzing trace with hash -681447277, now seen corresponding path program 1 times [2022-12-06 00:14:02,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:02,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856386123] [2022-12-06 00:14:02,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:02,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:02,952 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 00:14:02,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:02,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856386123] [2022-12-06 00:14:02,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856386123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:02,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:02,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:14:02,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597479711] [2022-12-06 00:14:02,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:02,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:14:02,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:02,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:14:02,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:14:02,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 00:14:02,954 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 00:14:02,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:02,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 00:14:02,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:03,076 INFO L130 PetriNetUnfolder]: 765/1133 cut-off events. [2022-12-06 00:14:03,076 INFO L131 PetriNetUnfolder]: For 1244/1314 co-relation queries the response was YES. [2022-12-06 00:14:03,078 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 00:14:03,083 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 55 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2022-12-06 00:14:03,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 63 transitions, 443 flow [2022-12-06 00:14:03,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:14:03,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:14:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 00:14:03,084 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41964285714285715 [2022-12-06 00:14:03,084 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 201 flow. Second operand 4 states and 47 transitions. [2022-12-06 00:14:03,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 63 transitions, 443 flow [2022-12-06 00:14:03,088 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 00:14:03,090 INFO L231 Difference]: Finished difference. Result has 41 places, 42 transitions, 207 flow [2022-12-06 00:14:03,090 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 00:14:03,090 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2022-12-06 00:14:03,091 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:03,091 INFO L89 Accepts]: Start accepts. Operand has 41 places, 42 transitions, 207 flow [2022-12-06 00:14:03,091 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:03,091 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:03,092 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 42 transitions, 207 flow [2022-12-06 00:14:03,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 42 transitions, 207 flow [2022-12-06 00:14:03,101 INFO L130 PetriNetUnfolder]: 52/128 cut-off events. [2022-12-06 00:14:03,101 INFO L131 PetriNetUnfolder]: For 72/91 co-relation queries the response was YES. [2022-12-06 00:14:03,102 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 00:14:03,103 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 42 transitions, 207 flow [2022-12-06 00:14:03,103 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-06 00:14:03,359 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:14:03,360 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 269 [2022-12-06 00:14:03,360 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 41 transitions, 204 flow [2022-12-06 00:14:03,360 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 00:14:03,360 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:03,360 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 00:14:03,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:14:03,360 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 00:14:03,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:03,361 INFO L85 PathProgramCache]: Analyzing trace with hash -137883018, now seen corresponding path program 1 times [2022-12-06 00:14:03,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:03,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552454641] [2022-12-06 00:14:03,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:03,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:04,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:14:04,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:04,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552454641] [2022-12-06 00:14:04,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552454641] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:14:04,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585397957] [2022-12-06 00:14:04,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:04,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:14:04,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:14:04,088 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 00:14:04,116 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 00:14:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:04,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-06 00:14:04,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:14:04,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 00:14:04,438 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-06 00:14:04,439 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 00:14:04,477 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 00:14:04,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:14:04,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:14:04,536 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 00:14:04,724 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 00:14:04,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585397957] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:14:04,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:14:04,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 21 [2022-12-06 00:14:04,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843841777] [2022-12-06 00:14:04,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:14:04,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 00:14:04,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:04,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 00:14:04,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2022-12-06 00:14:04,726 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 00:14:04,726 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 00:14:04,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:04,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 00:14:04,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:06,340 INFO L130 PetriNetUnfolder]: 1643/2415 cut-off events. [2022-12-06 00:14:06,340 INFO L131 PetriNetUnfolder]: For 4003/4003 co-relation queries the response was YES. [2022-12-06 00:14:06,343 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 00:14:06,352 INFO L137 encePairwiseOnDemand]: 12/29 looper letters, 153 selfloop transitions, 88 changer transitions 2/243 dead transitions. [2022-12-06 00:14:06,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 243 transitions, 1630 flow [2022-12-06 00:14:06,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 00:14:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 00:14:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 226 transitions. [2022-12-06 00:14:06,354 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.26872770511296074 [2022-12-06 00:14:06,354 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 204 flow. Second operand 29 states and 226 transitions. [2022-12-06 00:14:06,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 243 transitions, 1630 flow [2022-12-06 00:14:06,358 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 00:14:06,360 INFO L231 Difference]: Finished difference. Result has 80 places, 128 transitions, 1015 flow [2022-12-06 00:14:06,361 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 00:14:06,361 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 47 predicate places. [2022-12-06 00:14:06,361 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:06,361 INFO L89 Accepts]: Start accepts. Operand has 80 places, 128 transitions, 1015 flow [2022-12-06 00:14:06,362 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:06,363 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:06,363 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 128 transitions, 1015 flow [2022-12-06 00:14:06,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 128 transitions, 1015 flow [2022-12-06 00:14:06,391 INFO L130 PetriNetUnfolder]: 161/397 cut-off events. [2022-12-06 00:14:06,392 INFO L131 PetriNetUnfolder]: For 959/985 co-relation queries the response was YES. [2022-12-06 00:14:06,393 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 00:14:06,395 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 128 transitions, 1015 flow [2022-12-06 00:14:06,395 INFO L188 LiptonReduction]: Number of co-enabled transitions 822 [2022-12-06 00:14:06,514 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 00:14:06,627 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 00:14:07,421 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 00:14:07,734 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 00:14:07,847 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:07,848 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:07,848 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:07,848 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:07,848 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:07,848 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:07,848 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:07,848 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:08,246 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 00:14:08,516 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 00:14:08,829 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 00:14:08,969 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 00:14:09,502 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 00:14:09,629 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 00:14:09,663 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 00:14:09,840 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 00:14:10,164 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 00:14:10,649 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 00:14:11,024 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 00:14:11,024 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4663 [2022-12-06 00:14:11,024 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 120 transitions, 1049 flow [2022-12-06 00:14:11,024 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 00:14:11,025 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:11,025 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 00:14:11,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 00:14:11,225 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 00:14:11,225 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 00:14:11,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:11,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1255937729, now seen corresponding path program 1 times [2022-12-06 00:14:11,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:11,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583411964] [2022-12-06 00:14:11,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:11,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:14:11,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:11,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583411964] [2022-12-06 00:14:11,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583411964] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:14:11,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665200388] [2022-12-06 00:14:11,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:11,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:14:11,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:14:11,788 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 00:14:11,790 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 00:14:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:11,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-06 00:14:11,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:14:12,035 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 00:14:12,043 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-06 00:14:12,044 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 00:14:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:14:12,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:14:12,120 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:14:12,120 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 00:14:12,238 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 00:14:12,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665200388] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:14:12,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:14:12,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2022-12-06 00:14:12,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127908200] [2022-12-06 00:14:12,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:14:12,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 00:14:12,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:12,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 00:14:12,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-12-06 00:14:12,240 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-06 00:14:12,240 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 00:14:12,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:12,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-06 00:14:12,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:13,647 INFO L130 PetriNetUnfolder]: 3772/5521 cut-off events. [2022-12-06 00:14:13,647 INFO L131 PetriNetUnfolder]: For 23600/23737 co-relation queries the response was YES. [2022-12-06 00:14:13,659 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 00:14:13,685 INFO L137 encePairwiseOnDemand]: 20/46 looper letters, 226 selfloop transitions, 174 changer transitions 3/411 dead transitions. [2022-12-06 00:14:13,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 411 transitions, 3646 flow [2022-12-06 00:14:13,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 00:14:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 00:14:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 309 transitions. [2022-12-06 00:14:13,688 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30533596837944665 [2022-12-06 00:14:13,688 INFO L175 Difference]: Start difference. First operand has 72 places, 120 transitions, 1049 flow. Second operand 22 states and 309 transitions. [2022-12-06 00:14:13,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 411 transitions, 3646 flow [2022-12-06 00:14:13,760 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 00:14:13,764 INFO L231 Difference]: Finished difference. Result has 89 places, 235 transitions, 2396 flow [2022-12-06 00:14:13,764 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 00:14:13,764 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 56 predicate places. [2022-12-06 00:14:13,764 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:13,764 INFO L89 Accepts]: Start accepts. Operand has 89 places, 235 transitions, 2396 flow [2022-12-06 00:14:13,765 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:13,765 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:13,766 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 235 transitions, 2396 flow [2022-12-06 00:14:13,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 235 transitions, 2396 flow [2022-12-06 00:14:13,824 INFO L130 PetriNetUnfolder]: 314/789 cut-off events. [2022-12-06 00:14:13,824 INFO L131 PetriNetUnfolder]: For 1940/2017 co-relation queries the response was YES. [2022-12-06 00:14:13,826 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 00:14:13,831 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 235 transitions, 2396 flow [2022-12-06 00:14:13,831 INFO L188 LiptonReduction]: Number of co-enabled transitions 1992 [2022-12-06 00:14:17,682 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:14:17,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3919 [2022-12-06 00:14:17,683 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 234 transitions, 2394 flow [2022-12-06 00:14:17,683 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 00:14:17,683 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:17,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 00:14:17,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 00:14:17,883 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 00:14:17,884 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 00:14:17,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:17,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1243259432, now seen corresponding path program 1 times [2022-12-06 00:14:17,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:17,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010288899] [2022-12-06 00:14:17,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:17,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:18,770 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 00:14:18,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:18,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010288899] [2022-12-06 00:14:18,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010288899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:18,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:18,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:14:18,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437002692] [2022-12-06 00:14:18,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:18,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:14:18,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:18,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:14:18,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:14:18,772 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 00:14:18,772 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 00:14:18,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:18,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 00:14:18,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:19,737 INFO L130 PetriNetUnfolder]: 4120/6025 cut-off events. [2022-12-06 00:14:19,737 INFO L131 PetriNetUnfolder]: For 29991/30142 co-relation queries the response was YES. [2022-12-06 00:14:19,753 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 00:14:19,780 INFO L137 encePairwiseOnDemand]: 22/42 looper letters, 229 selfloop transitions, 65 changer transitions 4/306 dead transitions. [2022-12-06 00:14:19,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 306 transitions, 3486 flow [2022-12-06 00:14:19,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:14:19,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:14:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2022-12-06 00:14:19,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36607142857142855 [2022-12-06 00:14:19,782 INFO L175 Difference]: Start difference. First operand has 88 places, 234 transitions, 2394 flow. Second operand 8 states and 123 transitions. [2022-12-06 00:14:19,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 306 transitions, 3486 flow [2022-12-06 00:14:19,874 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 00:14:19,879 INFO L231 Difference]: Finished difference. Result has 99 places, 254 transitions, 2724 flow [2022-12-06 00:14:19,880 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 00:14:19,880 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 66 predicate places. [2022-12-06 00:14:19,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:19,880 INFO L89 Accepts]: Start accepts. Operand has 99 places, 254 transitions, 2724 flow [2022-12-06 00:14:19,881 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:19,882 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:19,882 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 254 transitions, 2724 flow [2022-12-06 00:14:19,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 254 transitions, 2724 flow [2022-12-06 00:14:19,975 INFO L130 PetriNetUnfolder]: 354/869 cut-off events. [2022-12-06 00:14:19,975 INFO L131 PetriNetUnfolder]: For 2547/2633 co-relation queries the response was YES. [2022-12-06 00:14:19,978 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 00:14:19,985 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 254 transitions, 2724 flow [2022-12-06 00:14:19,985 INFO L188 LiptonReduction]: Number of co-enabled transitions 2148 [2022-12-06 00:14:19,986 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:14:19,986 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-06 00:14:19,986 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 254 transitions, 2724 flow [2022-12-06 00:14:19,986 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 00:14:19,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:19,987 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 00:14:19,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:14:19,987 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 00:14:19,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:19,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1981175882, now seen corresponding path program 1 times [2022-12-06 00:14:19,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:19,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23946201] [2022-12-06 00:14:19,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:19,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:20,700 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 00:14:20,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:20,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23946201] [2022-12-06 00:14:20,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23946201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:20,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:20,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:14:20,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679011376] [2022-12-06 00:14:20,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:20,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:14:20,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:20,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:14:20,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:14:20,701 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:14:20,702 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 00:14:20,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:20,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:14:20,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:21,971 INFO L130 PetriNetUnfolder]: 4406/6472 cut-off events. [2022-12-06 00:14:21,972 INFO L131 PetriNetUnfolder]: For 32323/32323 co-relation queries the response was YES. [2022-12-06 00:14:21,987 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 00:14:22,010 INFO L137 encePairwiseOnDemand]: 19/41 looper letters, 191 selfloop transitions, 166 changer transitions 3/360 dead transitions. [2022-12-06 00:14:22,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 360 transitions, 4181 flow [2022-12-06 00:14:22,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:14:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:14:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 154 transitions. [2022-12-06 00:14:22,012 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28893058161350843 [2022-12-06 00:14:22,012 INFO L175 Difference]: Start difference. First operand has 97 places, 254 transitions, 2724 flow. Second operand 13 states and 154 transitions. [2022-12-06 00:14:22,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 360 transitions, 4181 flow [2022-12-06 00:14:22,138 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 00:14:22,152 INFO L231 Difference]: Finished difference. Result has 114 places, 290 transitions, 3720 flow [2022-12-06 00:14:22,153 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 00:14:22,156 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 81 predicate places. [2022-12-06 00:14:22,156 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:22,156 INFO L89 Accepts]: Start accepts. Operand has 114 places, 290 transitions, 3720 flow [2022-12-06 00:14:22,159 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:22,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:22,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 290 transitions, 3720 flow [2022-12-06 00:14:22,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 290 transitions, 3720 flow [2022-12-06 00:14:22,258 INFO L130 PetriNetUnfolder]: 384/951 cut-off events. [2022-12-06 00:14:22,258 INFO L131 PetriNetUnfolder]: For 4458/4574 co-relation queries the response was YES. [2022-12-06 00:14:22,262 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 00:14:22,269 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 290 transitions, 3720 flow [2022-12-06 00:14:22,269 INFO L188 LiptonReduction]: Number of co-enabled transitions 2316 [2022-12-06 00:14:22,270 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 00:14:22,579 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 00:14:22,779 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 00:14:22,854 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 00:14:22,994 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 00:14:23,583 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 00:14:23,640 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 00:14:23,762 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 00:14:23,875 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:14:23,877 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1721 [2022-12-06 00:14:23,877 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 289 transitions, 3820 flow [2022-12-06 00:14:23,878 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 00:14:23,878 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:23,878 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 00:14:23,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 00:14:23,878 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 00:14:23,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:23,878 INFO L85 PathProgramCache]: Analyzing trace with hash 79245884, now seen corresponding path program 1 times [2022-12-06 00:14:23,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:23,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117861201] [2022-12-06 00:14:23,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:23,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:24,572 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 00:14:24,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:24,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117861201] [2022-12-06 00:14:24,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117861201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:24,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:24,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:14:24,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023394810] [2022-12-06 00:14:24,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:24,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:14:24,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:24,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:14:24,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:14:24,574 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 51 [2022-12-06 00:14:24,574 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 00:14:24,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:24,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 51 [2022-12-06 00:14:24,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:25,780 INFO L130 PetriNetUnfolder]: 4509/6611 cut-off events. [2022-12-06 00:14:25,780 INFO L131 PetriNetUnfolder]: For 57931/58108 co-relation queries the response was YES. [2022-12-06 00:14:25,799 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 00:14:25,823 INFO L137 encePairwiseOnDemand]: 21/51 looper letters, 269 selfloop transitions, 81 changer transitions 4/363 dead transitions. [2022-12-06 00:14:25,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 363 transitions, 5116 flow [2022-12-06 00:14:25,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 00:14:25,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 00:14:25,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2022-12-06 00:14:25,825 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2784313725490196 [2022-12-06 00:14:25,825 INFO L175 Difference]: Start difference. First operand has 113 places, 289 transitions, 3820 flow. Second operand 10 states and 142 transitions. [2022-12-06 00:14:25,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 363 transitions, 5116 flow [2022-12-06 00:14:25,961 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 00:14:25,966 INFO L231 Difference]: Finished difference. Result has 124 places, 312 transitions, 4289 flow [2022-12-06 00:14:25,966 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 00:14:25,967 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 91 predicate places. [2022-12-06 00:14:25,967 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:25,967 INFO L89 Accepts]: Start accepts. Operand has 124 places, 312 transitions, 4289 flow [2022-12-06 00:14:25,970 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:25,970 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:25,970 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 312 transitions, 4289 flow [2022-12-06 00:14:25,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 312 transitions, 4289 flow [2022-12-06 00:14:26,066 INFO L130 PetriNetUnfolder]: 423/1061 cut-off events. [2022-12-06 00:14:26,066 INFO L131 PetriNetUnfolder]: For 5450/5550 co-relation queries the response was YES. [2022-12-06 00:14:26,072 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 00:14:26,080 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 312 transitions, 4289 flow [2022-12-06 00:14:26,080 INFO L188 LiptonReduction]: Number of co-enabled transitions 2448 [2022-12-06 00:14:26,081 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 00:14:26,219 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 00:14:26,219 WARN L322 ript$VariableManager]: TermVariable LBE534 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:26,219 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:26,220 WARN L322 ript$VariableManager]: TermVariable LBE444 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:26,220 WARN L322 ript$VariableManager]: TermVariable LBE520 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:26,220 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:26,220 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:26,220 WARN L322 ript$VariableManager]: TermVariable LBE192 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:26,220 WARN L322 ript$VariableManager]: TermVariable LBE535 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:26,701 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:14:26,702 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 735 [2022-12-06 00:14:26,702 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 312 transitions, 4305 flow [2022-12-06 00:14:26,702 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 00:14:26,702 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:26,702 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 00:14:26,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 00:14:26,704 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 00:14:26,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:26,704 INFO L85 PathProgramCache]: Analyzing trace with hash 360800076, now seen corresponding path program 1 times [2022-12-06 00:14:26,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:26,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444258010] [2022-12-06 00:14:26,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:26,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:27,578 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 00:14:27,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:27,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444258010] [2022-12-06 00:14:27,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444258010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:27,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:27,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:14:27,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203728358] [2022-12-06 00:14:27,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:27,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:14:27,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:27,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:14:27,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:14:27,580 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-06 00:14:27,580 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 00:14:27,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:27,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-06 00:14:27,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:28,665 INFO L130 PetriNetUnfolder]: 4492/6590 cut-off events. [2022-12-06 00:14:28,665 INFO L131 PetriNetUnfolder]: For 60711/60878 co-relation queries the response was YES. [2022-12-06 00:14:28,683 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 00:14:28,704 INFO L137 encePairwiseOnDemand]: 23/50 looper letters, 256 selfloop transitions, 85 changer transitions 3/353 dead transitions. [2022-12-06 00:14:28,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 353 transitions, 5250 flow [2022-12-06 00:14:28,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:14:28,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:14:28,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-12-06 00:14:28,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2925 [2022-12-06 00:14:28,706 INFO L175 Difference]: Start difference. First operand has 123 places, 312 transitions, 4305 flow. Second operand 8 states and 117 transitions. [2022-12-06 00:14:28,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 353 transitions, 5250 flow [2022-12-06 00:14:28,860 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 00:14:28,865 INFO L231 Difference]: Finished difference. Result has 129 places, 319 transitions, 4549 flow [2022-12-06 00:14:28,866 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 00:14:28,866 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 96 predicate places. [2022-12-06 00:14:28,866 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:28,866 INFO L89 Accepts]: Start accepts. Operand has 129 places, 319 transitions, 4549 flow [2022-12-06 00:14:28,867 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:28,868 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:28,868 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 319 transitions, 4549 flow [2022-12-06 00:14:28,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 319 transitions, 4549 flow [2022-12-06 00:14:28,962 INFO L130 PetriNetUnfolder]: 429/1070 cut-off events. [2022-12-06 00:14:28,963 INFO L131 PetriNetUnfolder]: For 5991/6099 co-relation queries the response was YES. [2022-12-06 00:14:28,967 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 00:14:28,974 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 319 transitions, 4549 flow [2022-12-06 00:14:28,975 INFO L188 LiptonReduction]: Number of co-enabled transitions 2482 [2022-12-06 00:14:28,976 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 00:14:29,259 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 00:14:29,855 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 00:14:30,073 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 00:14:30,193 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:14:30,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1328 [2022-12-06 00:14:30,194 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 318 transitions, 4573 flow [2022-12-06 00:14:30,194 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 00:14:30,194 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:30,194 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 00:14:30,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 00:14:30,194 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 00:14:30,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:30,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1591447231, now seen corresponding path program 1 times [2022-12-06 00:14:30,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:30,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892790663] [2022-12-06 00:14:30,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:30,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:30,284 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 00:14:30,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:30,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892790663] [2022-12-06 00:14:30,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892790663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:30,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:30,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:14:30,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336676068] [2022-12-06 00:14:30,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:30,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:14:30,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:30,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:14:30,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:14:30,286 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 53 [2022-12-06 00:14:30,286 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 00:14:30,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:30,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 53 [2022-12-06 00:14:30,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:31,187 INFO L130 PetriNetUnfolder]: 4298/6589 cut-off events. [2022-12-06 00:14:31,187 INFO L131 PetriNetUnfolder]: For 68480/68860 co-relation queries the response was YES. [2022-12-06 00:14:31,206 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 00:14:31,227 INFO L137 encePairwiseOnDemand]: 39/53 looper letters, 259 selfloop transitions, 33 changer transitions 2/312 dead transitions. [2022-12-06 00:14:31,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 312 transitions, 5071 flow [2022-12-06 00:14:31,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:14:31,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:14:31,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-06 00:14:31,228 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4339622641509434 [2022-12-06 00:14:31,229 INFO L175 Difference]: Start difference. First operand has 128 places, 318 transitions, 4573 flow. Second operand 4 states and 92 transitions. [2022-12-06 00:14:31,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 312 transitions, 5071 flow [2022-12-06 00:14:31,393 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 00:14:31,397 INFO L231 Difference]: Finished difference. Result has 129 places, 265 transitions, 3939 flow [2022-12-06 00:14:31,397 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 00:14:31,397 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 96 predicate places. [2022-12-06 00:14:31,397 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:31,397 INFO L89 Accepts]: Start accepts. Operand has 129 places, 265 transitions, 3939 flow [2022-12-06 00:14:31,398 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:31,398 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:31,398 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 265 transitions, 3939 flow [2022-12-06 00:14:31,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 265 transitions, 3939 flow [2022-12-06 00:14:31,486 INFO L130 PetriNetUnfolder]: 341/1004 cut-off events. [2022-12-06 00:14:31,486 INFO L131 PetriNetUnfolder]: For 6630/6747 co-relation queries the response was YES. [2022-12-06 00:14:31,491 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 00:14:31,499 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 265 transitions, 3939 flow [2022-12-06 00:14:31,499 INFO L188 LiptonReduction]: Number of co-enabled transitions 2110 [2022-12-06 00:14:31,500 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:14:31,501 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-06 00:14:31,501 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 265 transitions, 3939 flow [2022-12-06 00:14:31,501 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 00:14:31,501 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:31,501 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 00:14:31,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 00:14:31,501 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 00:14:31,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:31,502 INFO L85 PathProgramCache]: Analyzing trace with hash 153042172, now seen corresponding path program 1 times [2022-12-06 00:14:31,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:31,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567134653] [2022-12-06 00:14:31,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:31,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:31,600 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 00:14:31,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:31,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567134653] [2022-12-06 00:14:31,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567134653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:31,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:31,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:14:31,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363508801] [2022-12-06 00:14:31,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:31,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:14:31,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:31,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:14:31,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:14:31,602 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 52 [2022-12-06 00:14:31,602 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 00:14:31,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:31,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 52 [2022-12-06 00:14:31,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:32,579 INFO L130 PetriNetUnfolder]: 5859/8933 cut-off events. [2022-12-06 00:14:32,579 INFO L131 PetriNetUnfolder]: For 84154/84351 co-relation queries the response was YES. [2022-12-06 00:14:32,614 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 00:14:32,712 INFO L137 encePairwiseOnDemand]: 49/52 looper letters, 321 selfloop transitions, 1 changer transitions 0/331 dead transitions. [2022-12-06 00:14:32,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 331 transitions, 5401 flow [2022-12-06 00:14:32,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:14:32,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:14:32,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-12-06 00:14:32,713 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2022-12-06 00:14:32,713 INFO L175 Difference]: Start difference. First operand has 129 places, 265 transitions, 3939 flow. Second operand 3 states and 80 transitions. [2022-12-06 00:14:32,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 331 transitions, 5401 flow [2022-12-06 00:14:33,074 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 00:14:33,078 INFO L231 Difference]: Finished difference. Result has 130 places, 263 transitions, 3891 flow [2022-12-06 00:14:33,078 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 00:14:33,079 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 97 predicate places. [2022-12-06 00:14:33,079 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:33,079 INFO L89 Accepts]: Start accepts. Operand has 130 places, 263 transitions, 3891 flow [2022-12-06 00:14:33,081 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:33,082 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:33,082 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 263 transitions, 3891 flow [2022-12-06 00:14:33,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 263 transitions, 3891 flow [2022-12-06 00:14:33,234 INFO L130 PetriNetUnfolder]: 412/1222 cut-off events. [2022-12-06 00:14:33,234 INFO L131 PetriNetUnfolder]: For 8122/8280 co-relation queries the response was YES. [2022-12-06 00:14:33,239 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 00:14:33,249 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 263 transitions, 3891 flow [2022-12-06 00:14:33,249 INFO L188 LiptonReduction]: Number of co-enabled transitions 2106 [2022-12-06 00:14:33,266 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:14:33,267 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 00:14:33,267 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 263 transitions, 3891 flow [2022-12-06 00:14:33,267 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 00:14:33,267 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:33,267 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 00:14:33,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 00:14:33,268 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 00:14:33,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:33,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1623855692, now seen corresponding path program 1 times [2022-12-06 00:14:33,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:33,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277123310] [2022-12-06 00:14:33,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:33,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:33,437 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 00:14:33,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:33,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277123310] [2022-12-06 00:14:33,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277123310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:33,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:33,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:14:33,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601089364] [2022-12-06 00:14:33,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:33,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:14:33,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:33,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:14:33,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:14:33,440 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-06 00:14:33,440 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 00:14:33,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:33,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-06 00:14:33,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:34,638 INFO L130 PetriNetUnfolder]: 5842/8902 cut-off events. [2022-12-06 00:14:34,639 INFO L131 PetriNetUnfolder]: For 82868/83068 co-relation queries the response was YES. [2022-12-06 00:14:34,670 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 00:14:34,700 INFO L137 encePairwiseOnDemand]: 37/50 looper letters, 313 selfloop transitions, 16 changer transitions 0/338 dead transitions. [2022-12-06 00:14:34,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 338 transitions, 5418 flow [2022-12-06 00:14:34,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:14:34,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:14:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-06 00:14:34,701 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.445 [2022-12-06 00:14:34,701 INFO L175 Difference]: Start difference. First operand has 130 places, 263 transitions, 3891 flow. Second operand 4 states and 89 transitions. [2022-12-06 00:14:34,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 338 transitions, 5418 flow [2022-12-06 00:14:35,081 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 00:14:35,085 INFO L231 Difference]: Finished difference. Result has 133 places, 262 transitions, 3909 flow [2022-12-06 00:14:35,085 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 00:14:35,086 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 100 predicate places. [2022-12-06 00:14:35,086 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:35,086 INFO L89 Accepts]: Start accepts. Operand has 133 places, 262 transitions, 3909 flow [2022-12-06 00:14:35,087 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:35,087 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:35,087 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 262 transitions, 3909 flow [2022-12-06 00:14:35,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 262 transitions, 3909 flow [2022-12-06 00:14:35,237 INFO L130 PetriNetUnfolder]: 407/1205 cut-off events. [2022-12-06 00:14:35,238 INFO L131 PetriNetUnfolder]: For 8157/8308 co-relation queries the response was YES. [2022-12-06 00:14:35,243 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 00:14:35,252 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 262 transitions, 3909 flow [2022-12-06 00:14:35,253 INFO L188 LiptonReduction]: Number of co-enabled transitions 2110 [2022-12-06 00:14:35,254 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:14:35,254 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 00:14:35,254 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 262 transitions, 3909 flow [2022-12-06 00:14:35,254 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 00:14:35,254 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:35,255 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 00:14:35,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 00:14:35,255 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 00:14:35,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:35,255 INFO L85 PathProgramCache]: Analyzing trace with hash -772096631, now seen corresponding path program 1 times [2022-12-06 00:14:35,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:35,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796111912] [2022-12-06 00:14:35,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:35,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:35,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:14:35,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:35,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796111912] [2022-12-06 00:14:35,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796111912] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:14:35,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237505293] [2022-12-06 00:14:35,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:35,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:14:35,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:14:35,752 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 00:14:35,754 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 00:14:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:35,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-06 00:14:35,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:14:35,886 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 00:14:35,949 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 00:14:36,073 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 00:14:36,073 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 00:14:36,447 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 00:14:36,476 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 00:14:36,621 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 00:14:36,638 INFO L321 Elim1Store]: treesize reduction 47, result has 30.9 percent of original size [2022-12-06 00:14:36,638 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 00:14:36,648 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 00:14:36,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:14:36,895 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 00:14:36,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237505293] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:14:36,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:14:36,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 20 [2022-12-06 00:14:36,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167827110] [2022-12-06 00:14:36,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:14:36,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 00:14:36,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:36,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 00:14:36,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-12-06 00:14:36,897 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 49 [2022-12-06 00:14:36,897 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 00:14:36,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:36,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 49 [2022-12-06 00:14:36,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:38,754 INFO L130 PetriNetUnfolder]: 6017/9176 cut-off events. [2022-12-06 00:14:38,754 INFO L131 PetriNetUnfolder]: For 85534/85731 co-relation queries the response was YES. [2022-12-06 00:14:38,792 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 00:14:38,827 INFO L137 encePairwiseOnDemand]: 20/49 looper letters, 151 selfloop transitions, 176 changer transitions 4/340 dead transitions. [2022-12-06 00:14:38,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 340 transitions, 5204 flow [2022-12-06 00:14:38,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 00:14:38,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 00:14:38,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 155 transitions. [2022-12-06 00:14:38,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2259475218658892 [2022-12-06 00:14:38,828 INFO L175 Difference]: Start difference. First operand has 133 places, 262 transitions, 3909 flow. Second operand 14 states and 155 transitions. [2022-12-06 00:14:38,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 340 transitions, 5204 flow [2022-12-06 00:14:39,188 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 00:14:39,192 INFO L231 Difference]: Finished difference. Result has 149 places, 285 transitions, 4941 flow [2022-12-06 00:14:39,193 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 00:14:39,193 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 116 predicate places. [2022-12-06 00:14:39,193 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:39,193 INFO L89 Accepts]: Start accepts. Operand has 149 places, 285 transitions, 4941 flow [2022-12-06 00:14:39,194 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:39,194 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:39,194 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 285 transitions, 4941 flow [2022-12-06 00:14:39,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 285 transitions, 4941 flow [2022-12-06 00:14:39,323 INFO L130 PetriNetUnfolder]: 430/1281 cut-off events. [2022-12-06 00:14:39,323 INFO L131 PetriNetUnfolder]: For 12271/12442 co-relation queries the response was YES. [2022-12-06 00:14:39,329 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 00:14:39,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 285 transitions, 4941 flow [2022-12-06 00:14:39,340 INFO L188 LiptonReduction]: Number of co-enabled transitions 2216 [2022-12-06 00:14:39,482 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 00:14:39,630 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 00:14:39,805 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 00:14:40,400 WARN L322 ript$VariableManager]: TermVariable LBE534 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:40,400 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:40,400 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:40,400 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:40,401 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:40,401 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:40,401 WARN L322 ript$VariableManager]: TermVariable LBE535 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:40,401 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:40,401 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:40,401 WARN L322 ript$VariableManager]: TermVariable LBE444 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:40,401 WARN L322 ript$VariableManager]: TermVariable LBE520 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:40,401 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:40,401 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:40,401 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:40,401 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:40,401 WARN L322 ript$VariableManager]: TermVariable LBE192 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:14:41,553 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:14:41,554 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2361 [2022-12-06 00:14:41,554 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 284 transitions, 4975 flow [2022-12-06 00:14:41,554 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 00:14:41,554 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:41,554 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 00:14:41,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 00:14:41,760 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 00:14:41,760 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 00:14:41,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:41,760 INFO L85 PathProgramCache]: Analyzing trace with hash -216048318, now seen corresponding path program 1 times [2022-12-06 00:14:41,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:41,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235084169] [2022-12-06 00:14:41,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:41,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:42,353 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 00:14:42,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:42,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235084169] [2022-12-06 00:14:42,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235084169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:42,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:42,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 00:14:42,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411686173] [2022-12-06 00:14:42,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:42,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:14:42,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:42,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:14:42,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:14:42,355 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 52 [2022-12-06 00:14:42,355 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 00:14:42,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:42,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 52 [2022-12-06 00:14:42,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:44,099 INFO L130 PetriNetUnfolder]: 6186/9442 cut-off events. [2022-12-06 00:14:44,099 INFO L131 PetriNetUnfolder]: For 119414/119609 co-relation queries the response was YES. [2022-12-06 00:14:44,144 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 00:14:44,180 INFO L137 encePairwiseOnDemand]: 22/52 looper letters, 146 selfloop transitions, 183 changer transitions 5/343 dead transitions. [2022-12-06 00:14:44,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 343 transitions, 6224 flow [2022-12-06 00:14:44,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:14:44,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:14:44,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2022-12-06 00:14:44,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27350427350427353 [2022-12-06 00:14:44,182 INFO L175 Difference]: Start difference. First operand has 148 places, 284 transitions, 4975 flow. Second operand 9 states and 128 transitions. [2022-12-06 00:14:44,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 343 transitions, 6224 flow [2022-12-06 00:14:44,627 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 00:14:44,633 INFO L231 Difference]: Finished difference. Result has 154 places, 301 transitions, 5870 flow [2022-12-06 00:14:44,633 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 00:14:44,633 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 121 predicate places. [2022-12-06 00:14:44,634 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:44,634 INFO L89 Accepts]: Start accepts. Operand has 154 places, 301 transitions, 5870 flow [2022-12-06 00:14:44,635 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:44,635 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:44,635 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 301 transitions, 5870 flow [2022-12-06 00:14:44,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 301 transitions, 5870 flow [2022-12-06 00:14:44,802 INFO L130 PetriNetUnfolder]: 445/1328 cut-off events. [2022-12-06 00:14:44,802 INFO L131 PetriNetUnfolder]: For 15987/16161 co-relation queries the response was YES. [2022-12-06 00:14:44,809 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 00:14:44,820 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 301 transitions, 5870 flow [2022-12-06 00:14:44,820 INFO L188 LiptonReduction]: Number of co-enabled transitions 2322 [2022-12-06 00:14:44,998 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 00:14:45,285 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:14:45,286 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 652 [2022-12-06 00:14:45,286 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 300 transitions, 5866 flow [2022-12-06 00:14:45,286 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 00:14:45,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:45,286 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 00:14:45,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 00:14:45,286 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 00:14:45,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:45,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1865031330, now seen corresponding path program 1 times [2022-12-06 00:14:45,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:45,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129387302] [2022-12-06 00:14:45,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:45,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:45,418 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 00:14:45,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:45,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129387302] [2022-12-06 00:14:45,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129387302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:45,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:45,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:14:45,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016118137] [2022-12-06 00:14:45,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:45,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:14:45,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:45,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:14:45,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:14:45,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 53 [2022-12-06 00:14:45,420 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 00:14:45,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:45,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 53 [2022-12-06 00:14:45,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:46,827 INFO L130 PetriNetUnfolder]: 6038/9240 cut-off events. [2022-12-06 00:14:46,827 INFO L131 PetriNetUnfolder]: For 157044/157241 co-relation queries the response was YES. [2022-12-06 00:14:46,872 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 00:14:46,908 INFO L137 encePairwiseOnDemand]: 47/53 looper letters, 360 selfloop transitions, 8 changer transitions 2/379 dead transitions. [2022-12-06 00:14:46,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 379 transitions, 7719 flow [2022-12-06 00:14:46,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:14:46,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:14:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-06 00:14:46,909 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44339622641509435 [2022-12-06 00:14:46,909 INFO L175 Difference]: Start difference. First operand has 152 places, 300 transitions, 5866 flow. Second operand 4 states and 94 transitions. [2022-12-06 00:14:46,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 379 transitions, 7719 flow [2022-12-06 00:14:47,412 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 00:14:47,417 INFO L231 Difference]: Finished difference. Result has 153 places, 283 transitions, 5382 flow [2022-12-06 00:14:47,417 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 00:14:47,418 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 120 predicate places. [2022-12-06 00:14:47,418 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:47,418 INFO L89 Accepts]: Start accepts. Operand has 153 places, 283 transitions, 5382 flow [2022-12-06 00:14:47,419 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:47,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:47,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 283 transitions, 5382 flow [2022-12-06 00:14:47,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 283 transitions, 5382 flow [2022-12-06 00:14:47,589 INFO L130 PetriNetUnfolder]: 428/1287 cut-off events. [2022-12-06 00:14:47,589 INFO L131 PetriNetUnfolder]: For 16100/16279 co-relation queries the response was YES. [2022-12-06 00:14:47,595 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 00:14:47,609 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 283 transitions, 5382 flow [2022-12-06 00:14:47,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 2222 [2022-12-06 00:14:47,773 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 00:14:48,083 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 00:14:48,202 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:14:48,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 785 [2022-12-06 00:14:48,203 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 282 transitions, 5382 flow [2022-12-06 00:14:48,203 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 00:14:48,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:48,203 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 00:14:48,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 00:14:48,203 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 00:14:48,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash -81182574, now seen corresponding path program 1 times [2022-12-06 00:14:48,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:48,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020273044] [2022-12-06 00:14:48,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:48,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:48,343 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 00:14:48,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:48,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020273044] [2022-12-06 00:14:48,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020273044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:48,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:48,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:14:48,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735783142] [2022-12-06 00:14:48,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:48,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:14:48,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:48,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:14:48,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:14:48,345 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 55 [2022-12-06 00:14:48,345 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 00:14:48,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:48,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 55 [2022-12-06 00:14:48,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:49,338 INFO L130 PetriNetUnfolder]: 3886/5930 cut-off events. [2022-12-06 00:14:49,338 INFO L131 PetriNetUnfolder]: For 113194/113505 co-relation queries the response was YES. [2022-12-06 00:14:49,361 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 00:14:49,384 INFO L137 encePairwiseOnDemand]: 47/55 looper letters, 259 selfloop transitions, 17 changer transitions 0/292 dead transitions. [2022-12-06 00:14:49,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 292 transitions, 5836 flow [2022-12-06 00:14:49,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:14:49,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:14:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-06 00:14:49,385 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42727272727272725 [2022-12-06 00:14:49,385 INFO L175 Difference]: Start difference. First operand has 152 places, 282 transitions, 5382 flow. Second operand 4 states and 94 transitions. [2022-12-06 00:14:49,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 292 transitions, 5836 flow [2022-12-06 00:14:49,577 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 00:14:49,581 INFO L231 Difference]: Finished difference. Result has 141 places, 243 transitions, 4583 flow [2022-12-06 00:14:49,582 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 00:14:49,582 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 108 predicate places. [2022-12-06 00:14:49,582 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:49,582 INFO L89 Accepts]: Start accepts. Operand has 141 places, 243 transitions, 4583 flow [2022-12-06 00:14:49,583 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:49,583 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:49,584 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 243 transitions, 4583 flow [2022-12-06 00:14:49,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 243 transitions, 4583 flow [2022-12-06 00:14:49,728 INFO L130 PetriNetUnfolder]: 344/954 cut-off events. [2022-12-06 00:14:49,728 INFO L131 PetriNetUnfolder]: For 12022/12223 co-relation queries the response was YES. [2022-12-06 00:14:49,733 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 00:14:49,742 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 243 transitions, 4583 flow [2022-12-06 00:14:49,742 INFO L188 LiptonReduction]: Number of co-enabled transitions 1872 [2022-12-06 00:14:49,770 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 00:14:50,273 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:14:50,274 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 692 [2022-12-06 00:14:50,274 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 243 transitions, 4613 flow [2022-12-06 00:14:50,274 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 00:14:50,274 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:50,274 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 00:14:50,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 00:14:50,274 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 00:14:50,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:50,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1618178568, now seen corresponding path program 1 times [2022-12-06 00:14:50,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:50,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330003253] [2022-12-06 00:14:50,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:50,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:50,375 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 00:14:50,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:50,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330003253] [2022-12-06 00:14:50,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330003253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:50,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:50,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:14:50,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841948669] [2022-12-06 00:14:50,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:50,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:14:50,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:50,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:14:50,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:14:50,376 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 54 [2022-12-06 00:14:50,377 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 00:14:50,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:50,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 54 [2022-12-06 00:14:50,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:51,252 INFO L130 PetriNetUnfolder]: 3225/5090 cut-off events. [2022-12-06 00:14:51,252 INFO L131 PetriNetUnfolder]: For 96210/96326 co-relation queries the response was YES. [2022-12-06 00:14:51,275 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 00:14:51,293 INFO L137 encePairwiseOnDemand]: 31/54 looper letters, 192 selfloop transitions, 44 changer transitions 7/250 dead transitions. [2022-12-06 00:14:51,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 250 transitions, 4432 flow [2022-12-06 00:14:51,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:14:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:14:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2022-12-06 00:14:51,295 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.345679012345679 [2022-12-06 00:14:51,295 INFO L175 Difference]: Start difference. First operand has 141 places, 243 transitions, 4613 flow. Second operand 6 states and 112 transitions. [2022-12-06 00:14:51,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 250 transitions, 4432 flow [2022-12-06 00:14:51,592 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 00:14:51,595 INFO L231 Difference]: Finished difference. Result has 141 places, 191 transitions, 3296 flow [2022-12-06 00:14:51,595 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 00:14:51,596 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 108 predicate places. [2022-12-06 00:14:51,596 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:51,596 INFO L89 Accepts]: Start accepts. Operand has 141 places, 191 transitions, 3296 flow [2022-12-06 00:14:51,597 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:51,597 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:51,597 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 191 transitions, 3296 flow [2022-12-06 00:14:51,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 191 transitions, 3296 flow [2022-12-06 00:14:51,672 INFO L130 PetriNetUnfolder]: 262/786 cut-off events. [2022-12-06 00:14:51,672 INFO L131 PetriNetUnfolder]: For 8567/8698 co-relation queries the response was YES. [2022-12-06 00:14:51,676 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 00:14:51,681 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 191 transitions, 3296 flow [2022-12-06 00:14:51,681 INFO L188 LiptonReduction]: Number of co-enabled transitions 1394 [2022-12-06 00:14:51,795 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 00:14:52,068 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 00:14:52,230 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:14:52,233 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 637 [2022-12-06 00:14:52,233 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 189 transitions, 3300 flow [2022-12-06 00:14:52,235 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 00:14:52,235 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:52,235 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 00:14:52,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 00:14:52,235 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 00:14:52,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1054547083, now seen corresponding path program 1 times [2022-12-06 00:14:52,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:52,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810139707] [2022-12-06 00:14:52,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:52,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:52,749 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 00:14:52,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:52,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810139707] [2022-12-06 00:14:52,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810139707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:52,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:52,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:14:52,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121458537] [2022-12-06 00:14:52,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:52,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:14:52,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:52,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:14:52,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:14:52,751 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2022-12-06 00:14:52,751 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 00:14:52,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:52,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2022-12-06 00:14:52,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:53,664 INFO L130 PetriNetUnfolder]: 3238/5097 cut-off events. [2022-12-06 00:14:53,664 INFO L131 PetriNetUnfolder]: For 80284/80397 co-relation queries the response was YES. [2022-12-06 00:14:53,684 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 00:14:53,715 INFO L137 encePairwiseOnDemand]: 21/50 looper letters, 126 selfloop transitions, 94 changer transitions 9/236 dead transitions. [2022-12-06 00:14:53,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 236 transitions, 4031 flow [2022-12-06 00:14:53,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:14:53,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:14:53,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2022-12-06 00:14:53,716 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29 [2022-12-06 00:14:53,717 INFO L175 Difference]: Start difference. First operand has 138 places, 189 transitions, 3300 flow. Second operand 8 states and 116 transitions. [2022-12-06 00:14:53,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 236 transitions, 4031 flow [2022-12-06 00:14:53,927 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 00:14:53,930 INFO L231 Difference]: Finished difference. Result has 142 places, 192 transitions, 3495 flow [2022-12-06 00:14:53,931 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 00:14:53,931 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 109 predicate places. [2022-12-06 00:14:53,931 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:53,931 INFO L89 Accepts]: Start accepts. Operand has 142 places, 192 transitions, 3495 flow [2022-12-06 00:14:53,932 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:53,932 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:53,932 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 192 transitions, 3495 flow [2022-12-06 00:14:53,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 192 transitions, 3495 flow [2022-12-06 00:14:54,009 INFO L130 PetriNetUnfolder]: 260/782 cut-off events. [2022-12-06 00:14:54,010 INFO L131 PetriNetUnfolder]: For 8752/8895 co-relation queries the response was YES. [2022-12-06 00:14:54,014 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 00:14:54,020 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 192 transitions, 3495 flow [2022-12-06 00:14:54,020 INFO L188 LiptonReduction]: Number of co-enabled transitions 1416 [2022-12-06 00:14:54,024 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:14:54,025 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 00:14:54,025 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 192 transitions, 3495 flow [2022-12-06 00:14:54,025 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 00:14:54,025 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:54,025 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 00:14:54,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 00:14:54,025 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 00:14:54,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:54,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1953747205, now seen corresponding path program 1 times [2022-12-06 00:14:54,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:54,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200351320] [2022-12-06 00:14:54,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:54,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:54,096 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 00:14:54,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:54,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200351320] [2022-12-06 00:14:54,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200351320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:54,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:54,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:14:54,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244350601] [2022-12-06 00:14:54,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:54,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:14:54,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:54,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:14:54,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:14:54,097 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 00:14:54,098 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 00:14:54,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:54,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 00:14:54,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:55,149 INFO L130 PetriNetUnfolder]: 3691/5770 cut-off events. [2022-12-06 00:14:55,150 INFO L131 PetriNetUnfolder]: For 92079/92079 co-relation queries the response was YES. [2022-12-06 00:14:55,178 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 00:14:55,204 INFO L137 encePairwiseOnDemand]: 28/50 looper letters, 223 selfloop transitions, 93 changer transitions 0/316 dead transitions. [2022-12-06 00:14:55,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 316 transitions, 5465 flow [2022-12-06 00:14:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:14:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:14:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2022-12-06 00:14:55,205 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3488888888888889 [2022-12-06 00:14:55,205 INFO L175 Difference]: Start difference. First operand has 142 places, 192 transitions, 3495 flow. Second operand 9 states and 157 transitions. [2022-12-06 00:14:55,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 316 transitions, 5465 flow [2022-12-06 00:14:55,460 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 00:14:55,465 INFO L231 Difference]: Finished difference. Result has 152 places, 220 transitions, 4288 flow [2022-12-06 00:14:55,465 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 00:14:55,465 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 119 predicate places. [2022-12-06 00:14:55,465 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:55,465 INFO L89 Accepts]: Start accepts. Operand has 152 places, 220 transitions, 4288 flow [2022-12-06 00:14:55,467 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:55,467 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:55,467 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 220 transitions, 4288 flow [2022-12-06 00:14:55,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 220 transitions, 4288 flow [2022-12-06 00:14:55,610 INFO L130 PetriNetUnfolder]: 322/897 cut-off events. [2022-12-06 00:14:55,610 INFO L131 PetriNetUnfolder]: For 13002/13193 co-relation queries the response was YES. [2022-12-06 00:14:55,615 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 00:14:55,622 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 220 transitions, 4288 flow [2022-12-06 00:14:55,623 INFO L188 LiptonReduction]: Number of co-enabled transitions 1674 [2022-12-06 00:14:55,626 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:14:55,627 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-06 00:14:55,627 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 220 transitions, 4288 flow [2022-12-06 00:14:55,627 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 00:14:55,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:55,627 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 00:14:55,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 00:14:55,627 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 00:14:55,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:55,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1027887870, now seen corresponding path program 1 times [2022-12-06 00:14:55,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:55,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713737740] [2022-12-06 00:14:55,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:55,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:55,684 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 00:14:55,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:55,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713737740] [2022-12-06 00:14:55,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713737740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:55,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:55,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:14:55,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831860995] [2022-12-06 00:14:55,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:55,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:14:55,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:55,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:14:55,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:14:55,685 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 00:14:55,685 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 00:14:55,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:55,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 00:14:55,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:56,241 INFO L130 PetriNetUnfolder]: 2242/3555 cut-off events. [2022-12-06 00:14:56,241 INFO L131 PetriNetUnfolder]: For 73623/73623 co-relation queries the response was YES. [2022-12-06 00:14:56,258 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 00:14:56,272 INFO L137 encePairwiseOnDemand]: 41/49 looper letters, 137 selfloop transitions, 5 changer transitions 48/190 dead transitions. [2022-12-06 00:14:56,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 190 transitions, 3910 flow [2022-12-06 00:14:56,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:14:56,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:14:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-06 00:14:56,273 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42346938775510207 [2022-12-06 00:14:56,273 INFO L175 Difference]: Start difference. First operand has 152 places, 220 transitions, 4288 flow. Second operand 4 states and 83 transitions. [2022-12-06 00:14:56,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 190 transitions, 3910 flow [2022-12-06 00:14:56,406 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 00:14:56,408 INFO L231 Difference]: Finished difference. Result has 139 places, 119 transitions, 2093 flow [2022-12-06 00:14:56,409 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 00:14:56,409 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 106 predicate places. [2022-12-06 00:14:56,409 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:56,409 INFO L89 Accepts]: Start accepts. Operand has 139 places, 119 transitions, 2093 flow [2022-12-06 00:14:56,410 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:56,410 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:56,410 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 119 transitions, 2093 flow [2022-12-06 00:14:56,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 119 transitions, 2093 flow [2022-12-06 00:14:56,461 INFO L130 PetriNetUnfolder]: 223/488 cut-off events. [2022-12-06 00:14:56,461 INFO L131 PetriNetUnfolder]: For 6586/6752 co-relation queries the response was YES. [2022-12-06 00:14:56,464 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 00:14:56,469 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 119 transitions, 2093 flow [2022-12-06 00:14:56,469 INFO L188 LiptonReduction]: Number of co-enabled transitions 818 [2022-12-06 00:14:56,595 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:14:56,595 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:14:56,595 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 119 transitions, 2101 flow [2022-12-06 00:14:56,596 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 00:14:56,596 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:56,596 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 00:14:56,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 00:14:56,596 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 00:14:56,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:56,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1900491796, now seen corresponding path program 1 times [2022-12-06 00:14:56,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:56,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528685375] [2022-12-06 00:14:56,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:56,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:56,650 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 00:14:56,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:56,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528685375] [2022-12-06 00:14:56,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528685375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:56,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:56,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:14:56,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141777815] [2022-12-06 00:14:56,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:56,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:14:56,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:56,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:14:56,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:14:56,652 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 37 [2022-12-06 00:14:56,652 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 00:14:56,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:56,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 37 [2022-12-06 00:14:56,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:57,269 INFO L130 PetriNetUnfolder]: 2929/4323 cut-off events. [2022-12-06 00:14:57,269 INFO L131 PetriNetUnfolder]: For 105497/106046 co-relation queries the response was YES. [2022-12-06 00:14:57,287 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 00:14:57,308 INFO L137 encePairwiseOnDemand]: 30/37 looper letters, 199 selfloop transitions, 7 changer transitions 0/223 dead transitions. [2022-12-06 00:14:57,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 223 transitions, 4187 flow [2022-12-06 00:14:57,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:14:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:14:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-06 00:14:57,309 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5243243243243243 [2022-12-06 00:14:57,309 INFO L175 Difference]: Start difference. First operand has 114 places, 119 transitions, 2101 flow. Second operand 5 states and 97 transitions. [2022-12-06 00:14:57,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 223 transitions, 4187 flow [2022-12-06 00:14:57,439 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 00:14:57,442 INFO L231 Difference]: Finished difference. Result has 98 places, 123 transitions, 1729 flow [2022-12-06 00:14:57,442 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 00:14:57,442 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 65 predicate places. [2022-12-06 00:14:57,442 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:57,442 INFO L89 Accepts]: Start accepts. Operand has 98 places, 123 transitions, 1729 flow [2022-12-06 00:14:57,443 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:57,443 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:57,443 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 123 transitions, 1729 flow [2022-12-06 00:14:57,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 123 transitions, 1729 flow [2022-12-06 00:14:57,526 INFO L130 PetriNetUnfolder]: 439/928 cut-off events. [2022-12-06 00:14:57,526 INFO L131 PetriNetUnfolder]: For 8212/8523 co-relation queries the response was YES. [2022-12-06 00:14:57,530 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 00:14:57,537 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 123 transitions, 1729 flow [2022-12-06 00:14:57,538 INFO L188 LiptonReduction]: Number of co-enabled transitions 818 [2022-12-06 00:14:57,538 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:14:57,539 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-06 00:14:57,539 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 123 transitions, 1729 flow [2022-12-06 00:14:57,539 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 00:14:57,539 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:57,539 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 00:14:57,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 00:14:57,539 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 00:14:57,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:57,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1736678054, now seen corresponding path program 1 times [2022-12-06 00:14:57,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:57,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663500479] [2022-12-06 00:14:57,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:57,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:58,201 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 00:14:58,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:58,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663500479] [2022-12-06 00:14:58,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663500479] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:14:58,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638459600] [2022-12-06 00:14:58,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:58,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:14:58,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:14:58,212 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 00:14:58,244 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 00:14:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:58,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 78 conjunts are in the unsatisfiable core [2022-12-06 00:14:58,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:14:58,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:14:58,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:14:58,373 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 00:14:58,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:14:58,377 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 00:14:58,384 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 00:14:58,392 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 00:14:58,396 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 00:14:58,399 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 00:14:58,442 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 00:14:58,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:14:58,555 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 00:14:58,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:14:58,629 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 00:14:58,708 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 00:14:58,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:15:00,818 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 00:15:01,019 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 00:15:01,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638459600] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:15:01,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:15:01,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 19 [2022-12-06 00:15:01,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106584055] [2022-12-06 00:15:01,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:15:01,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 00:15:01,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:15:01,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 00:15:01,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=322, Unknown=3, NotChecked=36, Total=420 [2022-12-06 00:15:01,021 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 00:15:01,021 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 00:15:01,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:15:01,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 00:15:01,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:15:11,408 WARN L233 SmtUtils]: Spent 10.16s on a formula simplification. DAG size of input: 57 DAG size of output: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:15:12,923 INFO L130 PetriNetUnfolder]: 3586/5437 cut-off events. [2022-12-06 00:15:12,923 INFO L131 PetriNetUnfolder]: For 65886/65886 co-relation queries the response was YES. [2022-12-06 00:15:12,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37265 conditions, 5437 events. 3586/5437 cut-off events. For 65886/65886 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 28145 event pairs, 1024 based on Foata normal form. 1/5438 useless extension candidates. Maximal degree in co-relation 30523. Up to 3877 conditions per place. [2022-12-06 00:15:12,976 INFO L137 encePairwiseOnDemand]: 12/37 looper letters, 147 selfloop transitions, 81 changer transitions 11/239 dead transitions. [2022-12-06 00:15:12,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 239 transitions, 3080 flow [2022-12-06 00:15:12,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 00:15:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 00:15:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 147 transitions. [2022-12-06 00:15:12,978 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28378378378378377 [2022-12-06 00:15:12,978 INFO L175 Difference]: Start difference. First operand has 98 places, 123 transitions, 1729 flow. Second operand 14 states and 147 transitions. [2022-12-06 00:15:12,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 239 transitions, 3080 flow [2022-12-06 00:15:13,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 239 transitions, 3080 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 00:15:13,080 INFO L231 Difference]: Finished difference. Result has 119 places, 160 transitions, 2489 flow [2022-12-06 00:15:13,080 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=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2489, PETRI_PLACES=119, PETRI_TRANSITIONS=160} [2022-12-06 00:15:13,080 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 86 predicate places. [2022-12-06 00:15:13,080 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:15:13,080 INFO L89 Accepts]: Start accepts. Operand has 119 places, 160 transitions, 2489 flow [2022-12-06 00:15:13,081 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:15:13,081 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:15:13,081 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 160 transitions, 2489 flow [2022-12-06 00:15:13,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 160 transitions, 2489 flow [2022-12-06 00:15:13,253 INFO L130 PetriNetUnfolder]: 638/1408 cut-off events. [2022-12-06 00:15:13,253 INFO L131 PetriNetUnfolder]: For 16265/16496 co-relation queries the response was YES. [2022-12-06 00:15:13,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10326 conditions, 1408 events. 638/1408 cut-off events. For 16265/16496 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9150 event pairs, 49 based on Foata normal form. 60/1418 useless extension candidates. Maximal degree in co-relation 10238. Up to 576 conditions per place. [2022-12-06 00:15:13,277 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 160 transitions, 2489 flow [2022-12-06 00:15:13,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 1002 [2022-12-06 00:15:13,473 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:15:13,475 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 395 [2022-12-06 00:15:13,475 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 160 transitions, 2505 flow [2022-12-06 00:15:13,476 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 00:15:13,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:15:13,476 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 00:15:13,484 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 00:15:13,682 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 00:15:13,682 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 00:15:13,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:15:13,683 INFO L85 PathProgramCache]: Analyzing trace with hash 281261806, now seen corresponding path program 2 times [2022-12-06 00:15:13,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:15:13,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848716613] [2022-12-06 00:15:13,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:15:13,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:15:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:15:14,539 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 00:15:14,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:15:14,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848716613] [2022-12-06 00:15:14,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848716613] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:15:14,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536500720] [2022-12-06 00:15:14,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:15:14,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:15:14,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:15:14,542 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 00:15:14,544 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 00:15:14,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:15:14,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:15:14,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-06 00:15:14,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:15:14,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:14,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:14,826 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 00:15:14,826 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 00:15:14,930 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 00:15:14,950 INFO L321 Elim1Store]: treesize reduction 49, result has 27.9 percent of original size [2022-12-06 00:15:14,951 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 29 [2022-12-06 00:15:14,972 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 00:15:14,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:15:15,043 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1024 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1024)) (.cse1 (* 4 c_~M~0))) (+ (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) c_~res2~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))) c_~res1~0)) is different from false [2022-12-06 00:15:15,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:15:15,081 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 154 treesize of output 162 [2022-12-06 00:15:15,093 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:15:15,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 74 [2022-12-06 00:15:15,847 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 00:15:15,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536500720] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:15:15,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:15:15,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 17 [2022-12-06 00:15:15,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937893281] [2022-12-06 00:15:15,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:15:15,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 00:15:15,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:15:15,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 00:15:15,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=253, Unknown=1, NotChecked=32, Total=342 [2022-12-06 00:15:15,849 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 00:15:15,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 160 transitions, 2505 flow. Second operand has 19 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 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 00:15:15,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:15:15,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 00:15:15,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:15:19,503 INFO L130 PetriNetUnfolder]: 3690/5677 cut-off events. [2022-12-06 00:15:19,503 INFO L131 PetriNetUnfolder]: For 83539/83539 co-relation queries the response was YES. [2022-12-06 00:15:19,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42677 conditions, 5677 events. 3690/5677 cut-off events. For 83539/83539 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 30151 event pairs, 1281 based on Foata normal form. 2/5679 useless extension candidates. Maximal degree in co-relation 42286. Up to 4001 conditions per place. [2022-12-06 00:15:19,567 INFO L137 encePairwiseOnDemand]: 14/38 looper letters, 140 selfloop transitions, 76 changer transitions 15/231 dead transitions. [2022-12-06 00:15:19,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 231 transitions, 3459 flow [2022-12-06 00:15:19,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 00:15:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 00:15:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2022-12-06 00:15:19,568 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31842105263157894 [2022-12-06 00:15:19,568 INFO L175 Difference]: Start difference. First operand has 119 places, 160 transitions, 2505 flow. Second operand 10 states and 121 transitions. [2022-12-06 00:15:19,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 231 transitions, 3459 flow [2022-12-06 00:15:19,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 231 transitions, 3338 flow, removed 59 selfloop flow, removed 1 redundant places. [2022-12-06 00:15:19,759 INFO L231 Difference]: Finished difference. Result has 132 places, 167 transitions, 2755 flow [2022-12-06 00:15:19,759 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=2392, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2755, PETRI_PLACES=132, PETRI_TRANSITIONS=167} [2022-12-06 00:15:19,760 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 99 predicate places. [2022-12-06 00:15:19,760 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:15:19,760 INFO L89 Accepts]: Start accepts. Operand has 132 places, 167 transitions, 2755 flow [2022-12-06 00:15:19,761 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:15:19,761 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:15:19,761 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 167 transitions, 2755 flow [2022-12-06 00:15:19,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 167 transitions, 2755 flow [2022-12-06 00:15:19,921 INFO L130 PetriNetUnfolder]: 712/1600 cut-off events. [2022-12-06 00:15:19,921 INFO L131 PetriNetUnfolder]: For 20570/20927 co-relation queries the response was YES. [2022-12-06 00:15:19,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11797 conditions, 1600 events. 712/1600 cut-off events. For 20570/20927 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 10860 event pairs, 76 based on Foata normal form. 45/1558 useless extension candidates. Maximal degree in co-relation 11714. Up to 577 conditions per place. [2022-12-06 00:15:19,944 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 167 transitions, 2755 flow [2022-12-06 00:15:19,944 INFO L188 LiptonReduction]: Number of co-enabled transitions 1020 [2022-12-06 00:15:19,945 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:15:19,946 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 186 [2022-12-06 00:15:19,946 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 167 transitions, 2755 flow [2022-12-06 00:15:19,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 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 00:15:19,946 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:15:19,946 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 00:15:19,955 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 00:15:20,152 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 00:15:20,152 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 00:15:20,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:15:20,153 INFO L85 PathProgramCache]: Analyzing trace with hash 903911368, now seen corresponding path program 3 times [2022-12-06 00:15:20,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:15:20,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181753131] [2022-12-06 00:15:20,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:15:20,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:15:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:15:20,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:15:20,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:15:20,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181753131] [2022-12-06 00:15:20,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181753131] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:15:20,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266759201] [2022-12-06 00:15:20,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 00:15:20,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:15:20,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:15:20,824 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 00:15:20,827 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 00:15:20,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 00:15:20,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:15:21,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 78 conjunts are in the unsatisfiable core [2022-12-06 00:15:21,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:15:21,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:21,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:21,032 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 00:15:21,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:21,038 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 00:15:21,044 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 00:15:21,048 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 00:15:21,052 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 00:15:21,055 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 00:15:21,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:21,130 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 00:15:21,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:21,180 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 00:15:21,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:15:21,236 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 00:15:21,280 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 00:15:21,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:15:23,380 WARN L837 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1113 (Array Int Int))) (or (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1113)) (.cse1 (* ~M~0 4))) (+ 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) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-12-06 00:15:25,416 WARN L837 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1113 (Array Int Int)) (v_ArrVal_1112 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= c_~res1~0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1112) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1113)) (.cse1 (* ~M~0 4))) (+ (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) c_~res2~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-12-06 00:15:25,482 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 00:15:25,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266759201] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:15:25,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:15:25,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 18 [2022-12-06 00:15:25,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721381719] [2022-12-06 00:15:25,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:15:25,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 00:15:25,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:15:25,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 00:15:25,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=239, Unknown=2, NotChecked=66, Total=380 [2022-12-06 00:15:25,483 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 00:15:25,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 167 transitions, 2755 flow. Second operand has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:15:25,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:15:25,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 00:15:25,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:15:27,002 INFO L130 PetriNetUnfolder]: 3743/5795 cut-off events. [2022-12-06 00:15:27,003 INFO L131 PetriNetUnfolder]: For 95840/95840 co-relation queries the response was YES. [2022-12-06 00:15:27,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44238 conditions, 5795 events. 3743/5795 cut-off events. For 95840/95840 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 31458 event pairs, 874 based on Foata normal form. 2/5797 useless extension candidates. Maximal degree in co-relation 44126. Up to 3487 conditions per place. [2022-12-06 00:15:27,065 INFO L137 encePairwiseOnDemand]: 17/37 looper letters, 153 selfloop transitions, 90 changer transitions 20/263 dead transitions. [2022-12-06 00:15:27,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 263 transitions, 3880 flow [2022-12-06 00:15:27,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:15:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:15:27,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 146 transitions. [2022-12-06 00:15:27,066 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30353430353430355 [2022-12-06 00:15:27,066 INFO L175 Difference]: Start difference. First operand has 129 places, 167 transitions, 2755 flow. Second operand 13 states and 146 transitions. [2022-12-06 00:15:27,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 263 transitions, 3880 flow [2022-12-06 00:15:27,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 263 transitions, 3780 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-12-06 00:15:27,243 INFO L231 Difference]: Finished difference. Result has 138 places, 175 transitions, 3021 flow [2022-12-06 00:15:27,243 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2669, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3021, PETRI_PLACES=138, PETRI_TRANSITIONS=175} [2022-12-06 00:15:27,243 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 105 predicate places. [2022-12-06 00:15:27,243 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:15:27,243 INFO L89 Accepts]: Start accepts. Operand has 138 places, 175 transitions, 3021 flow [2022-12-06 00:15:27,244 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:15:27,244 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:15:27,245 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 175 transitions, 3021 flow [2022-12-06 00:15:27,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 175 transitions, 3021 flow [2022-12-06 00:15:27,422 INFO L130 PetriNetUnfolder]: 715/1690 cut-off events. [2022-12-06 00:15:27,422 INFO L131 PetriNetUnfolder]: For 24322/24679 co-relation queries the response was YES. [2022-12-06 00:15:27,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12707 conditions, 1690 events. 715/1690 cut-off events. For 24322/24679 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12018 event pairs, 78 based on Foata normal form. 44/1649 useless extension candidates. Maximal degree in co-relation 12627. Up to 584 conditions per place. [2022-12-06 00:15:27,446 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 175 transitions, 3021 flow [2022-12-06 00:15:27,446 INFO L188 LiptonReduction]: Number of co-enabled transitions 1078 [2022-12-06 00:15:27,457 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] 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 00:15:27,652 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] 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 00:15:27,776 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] 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 00:15:27,923 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:15:27,924 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 681 [2022-12-06 00:15:27,924 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 175 transitions, 3063 flow [2022-12-06 00:15:27,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:15:27,924 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:15:27,924 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 00:15:27,933 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 00:15:28,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:15:28,125 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 00:15:28,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:15:28,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1266405021, now seen corresponding path program 1 times [2022-12-06 00:15:28,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:15:28,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422372125] [2022-12-06 00:15:28,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:15:28,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:15:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:15:29,751 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 00:15:29,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:15:29,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422372125] [2022-12-06 00:15:29,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422372125] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:15:29,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649526464] [2022-12-06 00:15:29,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:15:29,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:15:29,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:15:29,753 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 00:15:29,763 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 00:15:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:15:29,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-06 00:15:29,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:15:29,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:29,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:29,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:29,940 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 00:15:29,964 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 00:15:29,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:29,972 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 00:15:30,125 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 00:15:30,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:30,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:30,344 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 00:15:30,346 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 00:15:30,535 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 00:15:30,564 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-12-06 00:15:30,565 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 00:15:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:15:30,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:15:30,776 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1200 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~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_1200)) (.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)))))) is different from false [2022-12-06 00:15:30,787 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1200 (Array Int Int)) (v_ArrVal_1199 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1199))) (= (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1200)) (.cse1 (* 4 c_~M~0))) (+ (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) c_~res2~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))) (+ (select (select .cse2 c_~A~0.base) c_~A~0.offset) c_~res1~0 (select (select .cse2 c_~B~0.base) c_~B~0.offset))))) is different from false [2022-12-06 00:15:30,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:15:30,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649526464] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:15:30,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:15:30,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 23 [2022-12-06 00:15:30,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280584437] [2022-12-06 00:15:30,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:15:30,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 00:15:30,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:15:30,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 00:15:30,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=433, Unknown=14, NotChecked=86, Total=600 [2022-12-06 00:15:30,796 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 00:15:30,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 175 transitions, 3063 flow. Second operand has 25 states, 24 states have (on average 2.375) internal successors, (57), 24 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 00:15:30,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:15:30,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 00:15:30,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:15:33,148 INFO L130 PetriNetUnfolder]: 3853/5999 cut-off events. [2022-12-06 00:15:33,148 INFO L131 PetriNetUnfolder]: For 111195/111195 co-relation queries the response was YES. [2022-12-06 00:15:33,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48161 conditions, 5999 events. 3853/5999 cut-off events. For 111195/111195 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 32635 event pairs, 1260 based on Foata normal form. 2/6001 useless extension candidates. Maximal degree in co-relation 48070. Up to 4124 conditions per place. [2022-12-06 00:15:33,212 INFO L137 encePairwiseOnDemand]: 14/40 looper letters, 105 selfloop transitions, 76 changer transitions 100/281 dead transitions. [2022-12-06 00:15:33,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 281 transitions, 4402 flow [2022-12-06 00:15:33,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 00:15:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 00:15:33,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 160 transitions. [2022-12-06 00:15:33,213 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23529411764705882 [2022-12-06 00:15:33,213 INFO L175 Difference]: Start difference. First operand has 136 places, 175 transitions, 3063 flow. Second operand 17 states and 160 transitions. [2022-12-06 00:15:33,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 281 transitions, 4402 flow [2022-12-06 00:15:33,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 281 transitions, 4224 flow, removed 44 selfloop flow, removed 7 redundant places. [2022-12-06 00:15:33,451 INFO L231 Difference]: Finished difference. Result has 151 places, 151 transitions, 2800 flow [2022-12-06 00:15:33,451 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2922, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2800, PETRI_PLACES=151, PETRI_TRANSITIONS=151} [2022-12-06 00:15:33,452 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 118 predicate places. [2022-12-06 00:15:33,452 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:15:33,452 INFO L89 Accepts]: Start accepts. Operand has 151 places, 151 transitions, 2800 flow [2022-12-06 00:15:33,453 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:15:33,453 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:15:33,453 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 151 transitions, 2800 flow [2022-12-06 00:15:33,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 151 transitions, 2800 flow [2022-12-06 00:15:33,620 INFO L130 PetriNetUnfolder]: 678/1543 cut-off events. [2022-12-06 00:15:33,620 INFO L131 PetriNetUnfolder]: For 24618/24971 co-relation queries the response was YES. [2022-12-06 00:15:33,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12419 conditions, 1543 events. 678/1543 cut-off events. For 24618/24971 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 10559 event pairs, 74 based on Foata normal form. 42/1501 useless extension candidates. Maximal degree in co-relation 12356. Up to 560 conditions per place. [2022-12-06 00:15:33,645 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 151 transitions, 2800 flow [2022-12-06 00:15:33,646 INFO L188 LiptonReduction]: Number of co-enabled transitions 946 [2022-12-06 00:15:33,647 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 00:15:33,648 WARN L322 ript$VariableManager]: TermVariable LBE534 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:15:33,648 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:15:33,648 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:15:33,648 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:15:33,648 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:15:33,648 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:15:33,648 WARN L322 ript$VariableManager]: TermVariable LBE535 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:15:33,648 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:15:33,648 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:15:33,648 WARN L322 ript$VariableManager]: TermVariable LBE444 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:15:33,648 WARN L322 ript$VariableManager]: TermVariable LBE520 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:15:33,648 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:15:33,649 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:15:33,649 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:15:33,649 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:15:33,649 WARN L322 ript$VariableManager]: TermVariable LBE192 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:15:35,030 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [837] L98-3-->L99-3: Formula: (and (= |v_#pthreadsForks_31| |v_ULTIMATE.start_main_#t~pre22#1_15|) (= |v_#pthreadsForks_30| (+ |v_#pthreadsForks_31| 1)) (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_13| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_13|) |v_ULTIMATE.start_main_~#t2~0#1.offset_13| |v_ULTIMATE.start_main_#t~pre22#1_15|)) |v_#memory_int_80|)) InVars {#pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_13|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_13|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_11|, #pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_7|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_13|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet21#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-06 00:15:35,272 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 [837] L98-3-->L99-3: Formula: (and (= |v_#pthreadsForks_31| |v_ULTIMATE.start_main_#t~pre22#1_15|) (= |v_#pthreadsForks_30| (+ |v_#pthreadsForks_31| 1)) (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_13| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_13|) |v_ULTIMATE.start_main_~#t2~0#1.offset_13| |v_ULTIMATE.start_main_#t~pre22#1_15|)) |v_#memory_int_80|)) InVars {#pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_13|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_13|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_11|, #pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_7|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_13|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet21#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-06 00:15:38,986 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:15:38,986 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5534 [2022-12-06 00:15:38,986 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 149 transitions, 2851 flow [2022-12-06 00:15:38,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.375) internal successors, (57), 24 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 00:15:38,987 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:15:38,987 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 00:15:38,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-06 00:15:39,187 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,SelfDestructingSolverStorable25 [2022-12-06 00:15:39,187 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 00:15:39,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:15:39,188 INFO L85 PathProgramCache]: Analyzing trace with hash 657772312, now seen corresponding path program 1 times [2022-12-06 00:15:39,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:15:39,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017437292] [2022-12-06 00:15:39,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:15:39,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:15:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:15:40,319 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 00:15:40,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:15:40,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017437292] [2022-12-06 00:15:40,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017437292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:15:40,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:15:40,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:15:40,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879038820] [2022-12-06 00:15:40,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:15:40,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:15:40,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:15:40,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:15:40,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:15:40,320 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 00:15:40,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 149 transitions, 2851 flow. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:15:40,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:15:40,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 00:15:40,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:15:41,533 INFO L130 PetriNetUnfolder]: 3471/5299 cut-off events. [2022-12-06 00:15:41,533 INFO L131 PetriNetUnfolder]: For 108232/108232 co-relation queries the response was YES. [2022-12-06 00:15:41,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44464 conditions, 5299 events. 3471/5299 cut-off events. For 108232/108232 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 27732 event pairs, 1038 based on Foata normal form. 2/5300 useless extension candidates. Maximal degree in co-relation 44364. Up to 3915 conditions per place. [2022-12-06 00:15:41,589 INFO L137 encePairwiseOnDemand]: 20/43 looper letters, 125 selfloop transitions, 71 changer transitions 12/208 dead transitions. [2022-12-06 00:15:41,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 208 transitions, 3559 flow [2022-12-06 00:15:41,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:15:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:15:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-12-06 00:15:41,592 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3313953488372093 [2022-12-06 00:15:41,597 INFO L175 Difference]: Start difference. First operand has 131 places, 149 transitions, 2851 flow. Second operand 8 states and 114 transitions. [2022-12-06 00:15:41,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 208 transitions, 3559 flow [2022-12-06 00:15:41,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 208 transitions, 3266 flow, removed 53 selfloop flow, removed 14 redundant places. [2022-12-06 00:15:41,776 INFO L231 Difference]: Finished difference. Result has 127 places, 149 transitions, 2797 flow [2022-12-06 00:15:41,776 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2592, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2797, PETRI_PLACES=127, PETRI_TRANSITIONS=149} [2022-12-06 00:15:41,778 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 94 predicate places. [2022-12-06 00:15:41,778 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:15:41,778 INFO L89 Accepts]: Start accepts. Operand has 127 places, 149 transitions, 2797 flow [2022-12-06 00:15:41,779 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:15:41,779 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:15:41,779 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 149 transitions, 2797 flow [2022-12-06 00:15:41,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 149 transitions, 2797 flow [2022-12-06 00:15:41,928 INFO L130 PetriNetUnfolder]: 673/1528 cut-off events. [2022-12-06 00:15:41,928 INFO L131 PetriNetUnfolder]: For 25575/25934 co-relation queries the response was YES. [2022-12-06 00:15:41,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12355 conditions, 1528 events. 673/1528 cut-off events. For 25575/25934 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10476 event pairs, 73 based on Foata normal form. 44/1486 useless extension candidates. Maximal degree in co-relation 11217. Up to 557 conditions per place. [2022-12-06 00:15:41,948 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 149 transitions, 2797 flow [2022-12-06 00:15:41,948 INFO L188 LiptonReduction]: Number of co-enabled transitions 950 [2022-12-06 00:15:45,497 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:15:45,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3720 [2022-12-06 00:15:45,498 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 148 transitions, 2797 flow [2022-12-06 00:15:45,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:15:45,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:15:45,499 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 00:15:45,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 00:15:45,499 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 00:15:45,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:15:45,499 INFO L85 PathProgramCache]: Analyzing trace with hash -368023695, now seen corresponding path program 1 times [2022-12-06 00:15:45,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:15:45,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164188181] [2022-12-06 00:15:45,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:15:45,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:15:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:15:46,284 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 00:15:46,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:15:46,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164188181] [2022-12-06 00:15:46,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164188181] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:15:46,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707149485] [2022-12-06 00:15:46,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:15:46,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:15:46,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:15:46,296 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:15:46,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 00:15:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:15:46,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 85 conjunts are in the unsatisfiable core [2022-12-06 00:15:46,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:15:46,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:46,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:46,523 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 00:15:46,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:46,529 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 00:15:46,537 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 00:15:46,543 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 00:15:46,548 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 00:15:46,553 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 00:15:46,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:46,637 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 00:15:46,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:46,701 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 00:15:46,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 00:15:46,891 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 11 [2022-12-06 00:15:46,907 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 00:15:46,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:15:46,972 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1328)) (.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 00:15:46,984 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1327 (Array Int Int))) (= (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1327) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1328)) (.cse1 (* 4 c_~M~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_~res2~0)) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset) c_~res1~0))) is different from false [2022-12-06 00:15:46,990 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 00:15:46,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707149485] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:15:46,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:15:46,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2022-12-06 00:15:46,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715246514] [2022-12-06 00:15:46,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:15:46,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 00:15:46,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:15:46,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 00:15:46,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=228, Unknown=2, NotChecked=62, Total=342 [2022-12-06 00:15:46,991 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 44 [2022-12-06 00:15:46,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 148 transitions, 2797 flow. Second operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 00:15:46,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:15:46,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 44 [2022-12-06 00:15:46,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:15:48,586 INFO L130 PetriNetUnfolder]: 3709/5629 cut-off events. [2022-12-06 00:15:48,586 INFO L131 PetriNetUnfolder]: For 113466/113566 co-relation queries the response was YES. [2022-12-06 00:15:48,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48433 conditions, 5629 events. 3709/5629 cut-off events. For 113466/113566 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 29976 event pairs, 725 based on Foata normal form. 68/5686 useless extension candidates. Maximal degree in co-relation 44762. Up to 3993 conditions per place. [2022-12-06 00:15:48,643 INFO L137 encePairwiseOnDemand]: 20/44 looper letters, 113 selfloop transitions, 125 changer transitions 52/297 dead transitions. [2022-12-06 00:15:48,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 297 transitions, 5329 flow [2022-12-06 00:15:48,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 00:15:48,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 00:15:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 170 transitions. [2022-12-06 00:15:48,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.275974025974026 [2022-12-06 00:15:48,645 INFO L175 Difference]: Start difference. First operand has 126 places, 148 transitions, 2797 flow. Second operand 14 states and 170 transitions. [2022-12-06 00:15:48,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 297 transitions, 5329 flow [2022-12-06 00:15:48,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 297 transitions, 5120 flow, removed 13 selfloop flow, removed 8 redundant places. [2022-12-06 00:15:48,841 INFO L231 Difference]: Finished difference. Result has 133 places, 193 transitions, 4108 flow [2022-12-06 00:15:48,841 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2660, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4108, PETRI_PLACES=133, PETRI_TRANSITIONS=193} [2022-12-06 00:15:48,841 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 100 predicate places. [2022-12-06 00:15:48,841 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:15:48,841 INFO L89 Accepts]: Start accepts. Operand has 133 places, 193 transitions, 4108 flow [2022-12-06 00:15:48,842 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:15:48,843 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:15:48,843 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 193 transitions, 4108 flow [2022-12-06 00:15:48,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 193 transitions, 4108 flow [2022-12-06 00:15:49,012 INFO L130 PetriNetUnfolder]: 722/1538 cut-off events. [2022-12-06 00:15:49,012 INFO L131 PetriNetUnfolder]: For 27702/28004 co-relation queries the response was YES. [2022-12-06 00:15:49,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13430 conditions, 1538 events. 722/1538 cut-off events. For 27702/28004 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10049 event pairs, 55 based on Foata normal form. 43/1522 useless extension candidates. Maximal degree in co-relation 13361. Up to 627 conditions per place. [2022-12-06 00:15:49,035 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 193 transitions, 4108 flow [2022-12-06 00:15:49,035 INFO L188 LiptonReduction]: Number of co-enabled transitions 1048 [2022-12-06 00:15:49,037 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 00:15:49,081 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:15:49,082 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 241 [2022-12-06 00:15:49,082 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 193 transitions, 4129 flow [2022-12-06 00:15:49,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 00:15:49,082 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:15:49,082 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 00:15:49,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 00:15:49,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-06 00:15:49,289 INFO L420 AbstractCegarLoop]: === Iteration 29 === 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 00:15:49,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:15:49,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1571092775, now seen corresponding path program 1 times [2022-12-06 00:15:49,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:15:49,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038654013] [2022-12-06 00:15:49,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:15:49,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:15:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:15:49,319 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 00:15:49,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:15:49,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038654013] [2022-12-06 00:15:49,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038654013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:15:49,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:15:49,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:15:49,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127430375] [2022-12-06 00:15:49,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:15:49,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:15:49,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:15:49,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:15:49,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:15:49,321 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 39 [2022-12-06 00:15:49,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 193 transitions, 4129 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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 00:15:49,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:15:49,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 39 [2022-12-06 00:15:49,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:15:50,090 INFO L130 PetriNetUnfolder]: 3432/5150 cut-off events. [2022-12-06 00:15:50,090 INFO L131 PetriNetUnfolder]: For 140519/140815 co-relation queries the response was YES. [2022-12-06 00:15:50,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47102 conditions, 5150 events. 3432/5150 cut-off events. For 140519/140815 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 26984 event pairs, 1267 based on Foata normal form. 169/5195 useless extension candidates. Maximal degree in co-relation 47020. Up to 2721 conditions per place. [2022-12-06 00:15:50,134 INFO L137 encePairwiseOnDemand]: 36/39 looper letters, 286 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2022-12-06 00:15:50,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 301 transitions, 6880 flow [2022-12-06 00:15:50,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:15:50,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:15:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-06 00:15:50,135 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2022-12-06 00:15:50,135 INFO L175 Difference]: Start difference. First operand has 111 places, 193 transitions, 4129 flow. Second operand 3 states and 72 transitions. [2022-12-06 00:15:50,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 301 transitions, 6880 flow [2022-12-06 00:15:50,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 301 transitions, 6275 flow, removed 68 selfloop flow, removed 14 redundant places. [2022-12-06 00:15:50,335 INFO L231 Difference]: Finished difference. Result has 100 places, 192 transitions, 3675 flow [2022-12-06 00:15:50,335 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3667, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3675, PETRI_PLACES=100, PETRI_TRANSITIONS=192} [2022-12-06 00:15:50,337 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 67 predicate places. [2022-12-06 00:15:50,337 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:15:50,337 INFO L89 Accepts]: Start accepts. Operand has 100 places, 192 transitions, 3675 flow [2022-12-06 00:15:50,338 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:15:50,338 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:15:50,338 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 192 transitions, 3675 flow [2022-12-06 00:15:50,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 192 transitions, 3675 flow [2022-12-06 00:15:50,482 INFO L130 PetriNetUnfolder]: 729/1536 cut-off events. [2022-12-06 00:15:50,482 INFO L131 PetriNetUnfolder]: For 22634/22953 co-relation queries the response was YES. [2022-12-06 00:15:50,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12515 conditions, 1536 events. 729/1536 cut-off events. For 22634/22953 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9941 event pairs, 58 based on Foata normal form. 53/1513 useless extension candidates. Maximal degree in co-relation 11539. Up to 598 conditions per place. [2022-12-06 00:15:50,501 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 192 transitions, 3675 flow [2022-12-06 00:15:50,501 INFO L188 LiptonReduction]: Number of co-enabled transitions 1046 [2022-12-06 00:15:50,505 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:15:50,506 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-06 00:15:50,506 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 192 transitions, 3675 flow [2022-12-06 00:15:50,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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 00:15:50,507 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:15:50,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] [2022-12-06 00:15:50,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 00:15:50,507 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:15:50,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:15:50,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1748533034, now seen corresponding path program 1 times [2022-12-06 00:15:50,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:15:50,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826568109] [2022-12-06 00:15:50,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:15:50,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:15:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:15:51,547 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 00:15:51,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:15:51,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826568109] [2022-12-06 00:15:51,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826568109] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:15:51,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086079886] [2022-12-06 00:15:51,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:15:51,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:15:51,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:15:51,549 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:15:51,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 00:15:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:15:51,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 84 conjunts are in the unsatisfiable core [2022-12-06 00:15:51,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:15:51,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:51,733 INFO L321 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2022-12-06 00:15:51,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 110 [2022-12-06 00:15:51,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:51,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 17 [2022-12-06 00:15:51,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:51,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 27 [2022-12-06 00:15:51,770 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:15:51,770 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 139 [2022-12-06 00:15:51,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:51,787 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 28 [2022-12-06 00:15:51,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:51,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-12-06 00:15:51,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:51,951 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-06 00:15:51,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 181 treesize of output 175 [2022-12-06 00:15:51,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:51,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2022-12-06 00:15:52,042 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 00:15:52,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:15:52,196 INFO L321 Elim1Store]: treesize reduction 84, result has 52.5 percent of original size [2022-12-06 00:15:52,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 59 treesize of output 107 [2022-12-06 00:15:52,353 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 00:15:52,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:15:52,565 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 4)) (.cse3 (+ 4 c_~B~0.offset))) (and (forall ((v_ArrVal_1468 (Array Int Int)) (~M~0 Int)) (or (< |c_thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ 3 ~M~0) c_~N~0) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1468))) (let ((.cse0 (select .cse5 c_~B~0.base)) (.cse1 (select .cse5 c_~A~0.base))) (<= (+ (select .cse0 c_~B~0.offset) (select .cse1 .cse2) (select .cse0 .cse3) c_~res1~0 (select .cse1 c_~A~0.offset)) (let ((.cse4 (* ~M~0 4))) (+ (select .cse1 (+ c_~A~0.offset .cse4)) (select .cse0 (+ .cse4 4 c_~B~0.offset)) c_~res2~0 (select .cse0 (+ .cse4 c_~B~0.offset)) (select .cse1 (+ c_~A~0.offset .cse4 4))))))))) (forall ((v_ArrVal_1468 (Array Int Int)) (~M~0 Int)) (or (< |c_thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ 3 ~M~0) c_~N~0) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1468))) (let ((.cse8 (select .cse9 c_~B~0.base)) (.cse6 (select .cse9 c_~A~0.base))) (< (let ((.cse7 (* ~M~0 4))) (+ (select .cse6 (+ c_~A~0.offset .cse7)) (select .cse8 (+ .cse7 4 c_~B~0.offset)) c_~res2~0 (select .cse8 (+ .cse7 c_~B~0.offset)) (select .cse6 (+ c_~A~0.offset .cse7 4)))) (+ (select .cse8 c_~B~0.offset) (select .cse6 .cse2) (select .cse8 .cse3) c_~res1~0 (select .cse6 c_~A~0.offset) 1)))))))) is different from false [2022-12-06 00:15:52,890 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 00:15:52,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086079886] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:15:52,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:15:52,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2022-12-06 00:15:52,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293859233] [2022-12-06 00:15:52,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:15:52,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-06 00:15:52,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:15:52,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-06 00:15:52,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=473, Unknown=14, NotChecked=46, Total=650 [2022-12-06 00:15:52,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:15:52,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 192 transitions, 3675 flow. Second operand has 26 states, 25 states have (on average 1.88) internal successors, (47), 25 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 00:15:52,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:15:52,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:15:52,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:15:57,852 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 4 c_~B~0.offset)) (.cse4 (+ c_~A~0.offset 4))) (and (or (= c_~res2~0 c_~res1~0) (<= (+ |c_thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0)) (forall ((v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1467 (Array Int Int)) (~M~0 Int)) (or (<= (+ 3 ~M~0) c_~N~0) (< 0 ~M~0) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1467) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1468))) (let ((.cse2 (select .cse5 c_~B~0.base)) (.cse0 (select .cse5 c_~A~0.base))) (< (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1 4)) c_~res2~0 (select .cse2 (+ .cse1 c_~B~0.offset)) (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse2 (+ .cse1 4 c_~B~0.offset)))) (+ (select .cse2 .cse3) c_~res1~0 (select .cse0 .cse4) (select .cse2 c_~B~0.offset) 1 (select .cse0 c_~A~0.offset))))))) (forall ((v_ArrVal_1468 (Array Int Int)) (~M~0 Int)) (or (<= (+ 3 ~M~0) c_~N~0) (< 0 ~M~0) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1468))) (let ((.cse8 (select .cse9 c_~B~0.base)) (.cse6 (select .cse9 c_~A~0.base))) (< (let ((.cse7 (* ~M~0 4))) (+ (select .cse6 (+ c_~A~0.offset .cse7)) (select .cse8 (+ .cse7 4 c_~B~0.offset)) c_~res2~0 (select .cse8 (+ .cse7 c_~B~0.offset)) (select .cse6 (+ c_~A~0.offset .cse7 4)))) (+ (select .cse8 c_~B~0.offset) (select .cse6 .cse4) (select .cse8 .cse3) c_~res1~0 (select .cse6 c_~A~0.offset) 1)))))) (forall ((v_ArrVal_1468 (Array Int Int)) (~M~0 Int)) (or (<= (+ 3 ~M~0) c_~N~0) (< 0 ~M~0) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1468))) (let ((.cse10 (select .cse13 c_~B~0.base)) (.cse11 (select .cse13 c_~A~0.base))) (<= (+ (select .cse10 c_~B~0.offset) (select .cse11 .cse4) (select .cse10 .cse3) c_~res1~0 (select .cse11 c_~A~0.offset)) (let ((.cse12 (* ~M~0 4))) (+ (select .cse11 (+ c_~A~0.offset .cse12)) (select .cse10 (+ .cse12 4 c_~B~0.offset)) c_~res2~0 (select .cse10 (+ .cse12 c_~B~0.offset)) (select .cse11 (+ c_~A~0.offset .cse12 4))))))))) (forall ((v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1467 (Array Int Int)) (~M~0 Int)) (or (<= (+ 3 ~M~0) c_~N~0) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1467) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1468))) (let ((.cse15 (select .cse17 c_~A~0.base)) (.cse14 (select .cse17 c_~B~0.base))) (<= (+ (select .cse14 .cse3) c_~res1~0 (select .cse15 .cse4) (select .cse14 c_~B~0.offset) (select .cse15 c_~A~0.offset)) (let ((.cse16 (* ~M~0 4))) (+ (select .cse15 (+ c_~A~0.offset .cse16 4)) c_~res2~0 (select .cse14 (+ .cse16 c_~B~0.offset)) (select .cse15 (+ c_~A~0.offset .cse16)) (select .cse14 (+ .cse16 4 c_~B~0.offset))))))) (< 0 ~M~0))))) is different from false [2022-12-06 00:15:59,713 INFO L130 PetriNetUnfolder]: 4783/7185 cut-off events. [2022-12-06 00:15:59,713 INFO L131 PetriNetUnfolder]: For 142695/142695 co-relation queries the response was YES. [2022-12-06 00:15:59,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62299 conditions, 7185 events. 4783/7185 cut-off events. For 142695/142695 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 38909 event pairs, 868 based on Foata normal form. 4/7189 useless extension candidates. Maximal degree in co-relation 56254. Up to 4941 conditions per place. [2022-12-06 00:15:59,816 INFO L137 encePairwiseOnDemand]: 3/39 looper letters, 202 selfloop transitions, 333 changer transitions 12/547 dead transitions. [2022-12-06 00:15:59,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 547 transitions, 9885 flow [2022-12-06 00:15:59,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 00:15:59,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 00:15:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 274 transitions. [2022-12-06 00:15:59,818 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2341880341880342 [2022-12-06 00:15:59,818 INFO L175 Difference]: Start difference. First operand has 100 places, 192 transitions, 3675 flow. Second operand 30 states and 274 transitions. [2022-12-06 00:15:59,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 547 transitions, 9885 flow [2022-12-06 00:16:00,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 547 transitions, 9882 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:16:00,065 INFO L231 Difference]: Finished difference. Result has 145 places, 438 transitions, 9678 flow [2022-12-06 00:16:00,065 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3673, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=9678, PETRI_PLACES=145, PETRI_TRANSITIONS=438} [2022-12-06 00:16:00,065 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 112 predicate places. [2022-12-06 00:16:00,065 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:16:00,066 INFO L89 Accepts]: Start accepts. Operand has 145 places, 438 transitions, 9678 flow [2022-12-06 00:16:00,067 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:16:00,067 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:16:00,068 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 438 transitions, 9678 flow [2022-12-06 00:16:00,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 438 transitions, 9678 flow [2022-12-06 00:16:00,397 INFO L130 PetriNetUnfolder]: 1292/2570 cut-off events. [2022-12-06 00:16:00,397 INFO L131 PetriNetUnfolder]: For 47037/47220 co-relation queries the response was YES. [2022-12-06 00:16:00,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24069 conditions, 2570 events. 1292/2570 cut-off events. For 47037/47220 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 17269 event pairs, 90 based on Foata normal form. 26/2514 useless extension candidates. Maximal degree in co-relation 23910. Up to 1056 conditions per place. [2022-12-06 00:16:00,437 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 438 transitions, 9678 flow [2022-12-06 00:16:00,438 INFO L188 LiptonReduction]: Number of co-enabled transitions 1598 [2022-12-06 00:16:00,571 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [945] L99-4-->L100-3: Formula: (and (= |v_#pthreadsForks_69| |v_ULTIMATE.start_main_#t~pre24#1_31|) (= |v_#memory_int_174| (store |v_#memory_int_175| |v_ULTIMATE.start_main_~#t3~0#1.base_39| (store (select |v_#memory_int_175| |v_ULTIMATE.start_main_~#t3~0#1.base_39|) |v_ULTIMATE.start_main_~#t3~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre24#1_31|))) (= |v_#pthreadsForks_68| (+ |v_#pthreadsForks_69| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_69|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_39|, #memory_int=|v_#memory_int_175|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_21|, #pthreadsForks=|v_#pthreadsForks_68|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_39|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_31|, #memory_int=|v_#memory_int_174|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_39|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_33|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23#1, #pthreadsForks, ULTIMATE.start_main_#t~pre24#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-06 00:16:00,624 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] 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 00:16:00,760 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 [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 00:16:01,213 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 [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 00:16:01,566 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1050] $Ultimate##0-->L64: Formula: (let ((.cse1 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_76| |v_thread2Thread1of1ForFork0_plus_~b#1_76|))) (and (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#in~b#1_76| 2147483648)) (<= |v_thread2Thread1of1ForFork0_plus_#res#1_76| 2147483647) (= |v_thread2Thread1of1ForFork0_~tmp~1#1_105| |v_thread2Thread1of1ForFork0_plus_#res#1_76|) (< |v_thread2Thread1of1ForFork0_~i~1#1_210| v_~M~0_231) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_76| (let ((.cse0 (* |v_thread2Thread1of1ForFork0_~i~1#1_210| 4))) (+ (select (select |v_#memory_int_532| v_~B~0.base_315) (+ v_~B~0.offset_317 .cse0)) (select (select |v_#memory_int_532| v_~A~0.base_325) (+ v_~A~0.offset_327 .cse0))))) (= |v_thread2Thread1of1ForFork0_plus_~a#1_76| |v_thread2Thread1of1ForFork0_plus_#in~a#1_76|) (= |v_thread2Thread1of1ForFork0_plus_~b#1_76| |v_thread2Thread1of1ForFork0_plus_#in~b#1_76|) (<= |v_thread2Thread1of1ForFork0_plus_#in~b#1_76| 2147483647) (= |v_thread2Thread1of1ForFork0_~i~1#1_210| 0) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_76| v_~res2~0_394) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_76| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76|) (= (ite (or (<= .cse1 2147483647) (<= |v_thread2Thread1of1ForFork0_plus_~b#1_76| 0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76|) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_76| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#res#1_76| .cse1))) InVars {~A~0.base=v_~A~0.base_325, ~B~0.base=v_~B~0.base_315, ~A~0.offset=v_~A~0.offset_327, ~M~0=v_~M~0_231, #memory_int=|v_#memory_int_532|, ~B~0.offset=v_~B~0.offset_317, ~res2~0=v_~res2~0_394} OutVars{~A~0.base=v_~A~0.base_325, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_76|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_76|, ~B~0.base=v_~B~0.base_315, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_76|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_210|, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_76|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_76|, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_76|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_76|, ~A~0.offset=v_~A~0.offset_327, ~M~0=v_~M~0_231, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_76|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_76|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_105|, #memory_int=|v_#memory_int_532|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_76|, ~B~0.offset=v_~B~0.offset_317, ~res2~0=v_~res2~0_394} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_#t~mem7#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 00:16:01,938 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1050] $Ultimate##0-->L64: Formula: (let ((.cse1 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_76| |v_thread2Thread1of1ForFork0_plus_~b#1_76|))) (and (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#in~b#1_76| 2147483648)) (<= |v_thread2Thread1of1ForFork0_plus_#res#1_76| 2147483647) (= |v_thread2Thread1of1ForFork0_~tmp~1#1_105| |v_thread2Thread1of1ForFork0_plus_#res#1_76|) (< |v_thread2Thread1of1ForFork0_~i~1#1_210| v_~M~0_231) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_76| (let ((.cse0 (* |v_thread2Thread1of1ForFork0_~i~1#1_210| 4))) (+ (select (select |v_#memory_int_532| v_~B~0.base_315) (+ v_~B~0.offset_317 .cse0)) (select (select |v_#memory_int_532| v_~A~0.base_325) (+ v_~A~0.offset_327 .cse0))))) (= |v_thread2Thread1of1ForFork0_plus_~a#1_76| |v_thread2Thread1of1ForFork0_plus_#in~a#1_76|) (= |v_thread2Thread1of1ForFork0_plus_~b#1_76| |v_thread2Thread1of1ForFork0_plus_#in~b#1_76|) (<= |v_thread2Thread1of1ForFork0_plus_#in~b#1_76| 2147483647) (= |v_thread2Thread1of1ForFork0_~i~1#1_210| 0) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_76| v_~res2~0_394) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_76| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76|) (= (ite (or (<= .cse1 2147483647) (<= |v_thread2Thread1of1ForFork0_plus_~b#1_76| 0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76|) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_76| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#res#1_76| .cse1))) InVars {~A~0.base=v_~A~0.base_325, ~B~0.base=v_~B~0.base_315, ~A~0.offset=v_~A~0.offset_327, ~M~0=v_~M~0_231, #memory_int=|v_#memory_int_532|, ~B~0.offset=v_~B~0.offset_317, ~res2~0=v_~res2~0_394} OutVars{~A~0.base=v_~A~0.base_325, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_76|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_76|, ~B~0.base=v_~B~0.base_315, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_76|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_76|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_210|, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_76|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_76|, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_76|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_76|, ~A~0.offset=v_~A~0.offset_327, ~M~0=v_~M~0_231, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_76|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_76|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_105|, #memory_int=|v_#memory_int_532|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_76|, ~B~0.offset=v_~B~0.offset_317, ~res2~0=v_~res2~0_394} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_#t~mem7#1] and [945] L99-4-->L100-3: Formula: (and (= |v_#pthreadsForks_69| |v_ULTIMATE.start_main_#t~pre24#1_31|) (= |v_#memory_int_174| (store |v_#memory_int_175| |v_ULTIMATE.start_main_~#t3~0#1.base_39| (store (select |v_#memory_int_175| |v_ULTIMATE.start_main_~#t3~0#1.base_39|) |v_ULTIMATE.start_main_~#t3~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre24#1_31|))) (= |v_#pthreadsForks_68| (+ |v_#pthreadsForks_69| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_69|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_39|, #memory_int=|v_#memory_int_175|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_21|, #pthreadsForks=|v_#pthreadsForks_68|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_39|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_31|, #memory_int=|v_#memory_int_174|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_39|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_33|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23#1, #pthreadsForks, ULTIMATE.start_main_#t~pre24#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-06 00:16:02,124 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 [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 00:16:02,352 WARN L322 ript$VariableManager]: TermVariable LBE534 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:02,352 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:02,353 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:02,353 WARN L322 ript$VariableManager]: TermVariable LBE444 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:02,353 WARN L322 ript$VariableManager]: TermVariable LBE520 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:02,353 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:02,353 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:02,353 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:02,353 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:02,353 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:02,353 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:02,353 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:02,353 WARN L322 ript$VariableManager]: TermVariable LBE535 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:02,353 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:02,353 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:02,353 WARN L322 ript$VariableManager]: TermVariable LBE192 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:02,917 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1056] L74-4-->L48-4: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_151| |v_thread3Thread1of1ForFork1_plus_~b#1_151|)) (.cse3 (select |v_#memory_int_544| v_~B~0.base_323)) (.cse1 (select |v_#memory_int_544| v_~A~0.base_333)) (.cse4 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_122| |v_thread1Thread1of1ForFork2_plus_~b#1_122|))) (and (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_124| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_124| |v_thread1Thread1of1ForFork2_plus_#res#1_122|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_151| .cse0) (< |v_thread1Thread1of1ForFork2_~i~0#1_156| v_~N~0_317) (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_151| 0) (<= .cse0 2147483647)) 1 0) |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_151|) (= |v_thread1Thread1of1ForFork2_~i~0#1_155| (+ |v_thread1Thread1of1ForFork2_~i~0#1_156| 1)) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_122| v_~res1~0_302) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_151| v_~res2~0_402) (< |v_thread3Thread1of1ForFork1_~i~2#1_374| v_~N~0_317) (= (let ((.cse2 (* |v_thread1Thread1of1ForFork2_~i~0#1_156| 4))) (+ (select .cse1 (+ v_~A~0.offset_335 .cse2)) (select .cse3 (+ v_~B~0.offset_325 .cse2)))) |v_thread1Thread1of1ForFork2_plus_#in~b#1_122|) (= |v_thread3Thread1of1ForFork1_plus_~a#1_151| |v_thread3Thread1of1ForFork1_plus_#in~a#1_151|) (= .cse4 |v_thread1Thread1of1ForFork2_plus_#res#1_122|) (= |v_thread3Thread1of1ForFork1_plus_~b#1_151| |v_thread3Thread1of1ForFork1_plus_#in~b#1_151|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_122| |v_thread1Thread1of1ForFork2_plus_~a#1_122|) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_151| (let ((.cse5 (* |v_thread3Thread1of1ForFork1_~i~2#1_374| 4))) (+ (select .cse3 (+ v_~B~0.offset_325 .cse5)) (select .cse1 (+ .cse5 v_~A~0.offset_335))))) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_122| |v_thread1Thread1of1ForFork2_plus_~b#1_122|) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_151| 2147483647) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_151| 2147483648)) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_124| 2147483647) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_124| v_~res1~0_301) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_122| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_122|) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_122| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_151| |v_thread3Thread1of1ForFork1_~tmp~2#1_215|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_122| 2147483647) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_122| (ite (or (<= .cse4 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_122| 0)) 1 0)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_151| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_215| 2147483647) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_215| 2147483648)))) InVars {~res1~0=v_~res1~0_302, ~A~0.base=v_~A~0.base_333, ~B~0.base=v_~B~0.base_323, ~A~0.offset=v_~A~0.offset_335, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_156|, #memory_int=|v_#memory_int_544|, ~N~0=v_~N~0_317, ~B~0.offset=v_~B~0.offset_325, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_374|, ~res2~0=v_~res2~0_402} OutVars{~res1~0=v_~res1~0_301, ~A~0.base=v_~A~0.base_333, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_122|, ~B~0.base=v_~B~0.base_323, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_122|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_122|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_151|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_122|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_151|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_374|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_122|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_215|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_151|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_122|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_122|, ~B~0.offset=v_~B~0.offset_325, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_151|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_122|, ~res2~0=v_~res2~0_402, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_151|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_151|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_151|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_124|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_151|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_122|, ~N~0=v_~N~0_317, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_151|, ~A~0.offset=v_~A~0.offset_335, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_155|, 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|, #memory_int=|v_#memory_int_544|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_151|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_151|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_122|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, 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, 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 00:16:03,148 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:03,148 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:03,148 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:03,148 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:03,148 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:03,148 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:03,149 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:03,149 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:04,439 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 00:16:04,571 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 00:16:04,723 WARN L322 ript$VariableManager]: TermVariable LBE534 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:04,723 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:04,723 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:04,723 WARN L322 ript$VariableManager]: TermVariable LBE444 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:04,723 WARN L322 ript$VariableManager]: TermVariable LBE520 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:04,723 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:04,723 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:04,724 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:04,724 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:04,724 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:04,724 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:04,724 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:04,724 WARN L322 ript$VariableManager]: TermVariable LBE535 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:04,724 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:04,724 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:04,724 WARN L322 ript$VariableManager]: TermVariable LBE192 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:05,376 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] 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 00:16:05,376 WARN L322 ript$VariableManager]: TermVariable LBE534 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:05,376 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:05,376 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:05,376 WARN L322 ript$VariableManager]: TermVariable LBE444 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:05,376 WARN L322 ript$VariableManager]: TermVariable LBE520 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:05,376 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:05,376 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:05,376 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:05,377 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:05,377 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:05,377 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:05,377 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:05,377 WARN L322 ript$VariableManager]: TermVariable LBE535 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:05,377 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:05,377 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:05,377 WARN L322 ript$VariableManager]: TermVariable LBE192 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:06,051 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-06 00:16:06,052 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5987 [2022-12-06 00:16:06,052 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 433 transitions, 9851 flow [2022-12-06 00:16:06,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 25 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 00:16:06,052 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:16:06,052 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 00:16:06,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 00:16:06,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:16:06,257 INFO L420 AbstractCegarLoop]: === Iteration 31 === 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 00:16:06,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:16:06,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1795171035, now seen corresponding path program 1 times [2022-12-06 00:16:06,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:16:06,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113345968] [2022-12-06 00:16:06,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:16:06,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:16:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:16:07,129 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 00:16:07,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:16:07,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113345968] [2022-12-06 00:16:07,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113345968] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:16:07,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571431842] [2022-12-06 00:16:07,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:16:07,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:16:07,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:16:07,133 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:16:07,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 00:16:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:16:07,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-06 00:16:07,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:16:07,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:16:07,316 INFO L321 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2022-12-06 00:16:07,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 110 [2022-12-06 00:16:07,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:16:07,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 17 [2022-12-06 00:16:07,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:16:07,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 27 [2022-12-06 00:16:07,354 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:16:07,354 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 114 [2022-12-06 00:16:07,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:16:07,371 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-06 00:16:07,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 33 [2022-12-06 00:16:07,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:16:07,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-12-06 00:16:07,439 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 00:16:07,471 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 00:16:07,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:16:07,663 INFO L321 Elim1Store]: treesize reduction 84, result has 52.5 percent of original size [2022-12-06 00:16:07,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 59 treesize of output 107 [2022-12-06 00:16:07,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:16:07,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:16:08,326 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 00:16:08,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571431842] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:16:08,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:16:08,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2022-12-06 00:16:08,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262872490] [2022-12-06 00:16:08,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:16:08,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 00:16:08,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:16:08,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 00:16:08,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=492, Unknown=11, NotChecked=0, Total=600 [2022-12-06 00:16:08,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-06 00:16:08,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 433 transitions, 9851 flow. Second operand has 25 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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 00:16:08,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:16:08,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-06 00:16:08,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:16:12,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:16:19,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:16:22,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:16:24,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:16:29,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:16:31,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:16:36,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:16:38,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:16:44,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:16:47,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:16:49,750 INFO L130 PetriNetUnfolder]: 5308/8018 cut-off events. [2022-12-06 00:16:49,750 INFO L131 PetriNetUnfolder]: For 201858/201858 co-relation queries the response was YES. [2022-12-06 00:16:49,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79783 conditions, 8018 events. 5308/8018 cut-off events. For 201858/201858 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 44920 event pairs, 913 based on Foata normal form. 5/8023 useless extension candidates. Maximal degree in co-relation 79492. Up to 5242 conditions per place. [2022-12-06 00:16:49,841 INFO L137 encePairwiseOnDemand]: 13/57 looper letters, 222 selfloop transitions, 408 changer transitions 20/650 dead transitions. [2022-12-06 00:16:49,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 650 transitions, 14040 flow [2022-12-06 00:16:49,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-06 00:16:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-12-06 00:16:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 329 transitions. [2022-12-06 00:16:49,844 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.13118022328548645 [2022-12-06 00:16:49,844 INFO L175 Difference]: Start difference. First operand has 140 places, 433 transitions, 9851 flow. Second operand 44 states and 329 transitions. [2022-12-06 00:16:49,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 650 transitions, 14040 flow [2022-12-06 00:16:50,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 650 transitions, 13583 flow, removed 207 selfloop flow, removed 4 redundant places. [2022-12-06 00:16:50,437 INFO L231 Difference]: Finished difference. Result has 191 places, 530 transitions, 12640 flow [2022-12-06 00:16:50,438 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=9449, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=317, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=12640, PETRI_PLACES=191, PETRI_TRANSITIONS=530} [2022-12-06 00:16:50,438 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 158 predicate places. [2022-12-06 00:16:50,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:16:50,438 INFO L89 Accepts]: Start accepts. Operand has 191 places, 530 transitions, 12640 flow [2022-12-06 00:16:50,440 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:16:50,440 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:16:50,440 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 530 transitions, 12640 flow [2022-12-06 00:16:50,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 530 transitions, 12640 flow [2022-12-06 00:16:50,879 INFO L130 PetriNetUnfolder]: 1376/2857 cut-off events. [2022-12-06 00:16:50,879 INFO L131 PetriNetUnfolder]: For 56860/57133 co-relation queries the response was YES. [2022-12-06 00:16:50,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27979 conditions, 2857 events. 1376/2857 cut-off events. For 56860/57133 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 20449 event pairs, 109 based on Foata normal form. 25/2793 useless extension candidates. Maximal degree in co-relation 27857. Up to 1144 conditions per place. [2022-12-06 00:16:51,153 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 530 transitions, 12640 flow [2022-12-06 00:16:51,153 INFO L188 LiptonReduction]: Number of co-enabled transitions 1996 [2022-12-06 00:16:51,155 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [837] L98-3-->L99-3: Formula: (and (= |v_#pthreadsForks_31| |v_ULTIMATE.start_main_#t~pre22#1_15|) (= |v_#pthreadsForks_30| (+ |v_#pthreadsForks_31| 1)) (= (store |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_13| (store (select |v_#memory_int_81| |v_ULTIMATE.start_main_~#t2~0#1.base_13|) |v_ULTIMATE.start_main_~#t2~0#1.offset_13| |v_ULTIMATE.start_main_#t~pre22#1_15|)) |v_#memory_int_80|)) InVars {#pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_13|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_13|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_11|, #pthreadsForks=|v_#pthreadsForks_30|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_7|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_13|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet21#1, #memory_int, ULTIMATE.start_main_#t~pre22#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 00:16:51,284 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 [987] L61-4-->L74-4: Formula: (and (= v_~res2~0_149 |v_thread3Thread1of1ForFork1_~tmp~2#1_53|) (= |v_thread2Thread1of1ForFork0_#res#1.offset_15| 0) (= |v_thread3Thread1of1ForFork1_~i~2#1_89| (+ |v_thread3Thread1of1ForFork1_~i~2#1_90| 1)) (= |v_thread2Thread1of1ForFork0_#res#1.base_15| 0) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_67| v_~M~0_103))) InVars {thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_53|, ~M~0=v_~M~0_103, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_67|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_90|} OutVars{thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_53|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_15|, ~M~0=v_~M~0_103, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_15|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_32|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_67|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_89|, ~res2~0=v_~res2~0_149} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_~i~2#1, ~res2~0] [2022-12-06 00:16:51,420 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 [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 00:16:51,768 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [928] L61-4-->L64: Formula: (let ((.cse1 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|))) (and (= (let ((.cse0 (* |v_thread2Thread1of1ForFork0_~i~1#1_23| 4))) (+ (select (select |v_#memory_int_154| v_~B~0.base_72) (+ v_~B~0.offset_72 .cse0)) (select (select |v_#memory_int_154| v_~A~0.base_74) (+ v_~A~0.offset_74 .cse0)))) |v_thread2Thread1of1ForFork0_plus_#in~b#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| |v_thread2Thread1of1ForFork0_plus_~a#1_7|) (= .cse1 |v_thread2Thread1of1ForFork0_plus_#res#1_7|) (< |v_thread2Thread1of1ForFork0_~i~1#1_23| v_~M~0_47) (= |v_thread2Thread1of1ForFork0_plus_#res#1_7| |v_thread2Thread1of1ForFork0_~tmp~1#1_19|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_7| 0) (<= .cse1 2147483647)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| v_~res2~0_81))) InVars {~A~0.base=v_~A~0.base_74, ~B~0.base=v_~B~0.base_72, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} OutVars{~A~0.base=v_~A~0.base_74, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_7|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_7|, ~B~0.base=v_~B~0.base_72, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_7|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_7|, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_7|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_7|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_19|, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_7|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_#t~mem7#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 00:16:52,318 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [928] L61-4-->L64: Formula: (let ((.cse1 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|))) (and (= (let ((.cse0 (* |v_thread2Thread1of1ForFork0_~i~1#1_23| 4))) (+ (select (select |v_#memory_int_154| v_~B~0.base_72) (+ v_~B~0.offset_72 .cse0)) (select (select |v_#memory_int_154| v_~A~0.base_74) (+ v_~A~0.offset_74 .cse0)))) |v_thread2Thread1of1ForFork0_plus_#in~b#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| |v_thread2Thread1of1ForFork0_plus_~a#1_7|) (= .cse1 |v_thread2Thread1of1ForFork0_plus_#res#1_7|) (< |v_thread2Thread1of1ForFork0_~i~1#1_23| v_~M~0_47) (= |v_thread2Thread1of1ForFork0_plus_#res#1_7| |v_thread2Thread1of1ForFork0_~tmp~1#1_19|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_7| 0) (<= .cse1 2147483647)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| v_~res2~0_81))) InVars {~A~0.base=v_~A~0.base_74, ~B~0.base=v_~B~0.base_72, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} OutVars{~A~0.base=v_~A~0.base_74, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_7|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_7|, ~B~0.base=v_~B~0.base_72, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_7|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_7|, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_7|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_7|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_19|, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_7|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_#t~mem7#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 00:16:52,626 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1071] L61-4-->L77: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_165| |v_thread3Thread1of1ForFork1_plus_~b#1_165|)) (.cse4 (select |v_#memory_int_570| v_~B~0.base_347)) (.cse3 (select |v_#memory_int_570| v_~A~0.base_357)) (.cse2 (+ v_~res2~0_432 2147483648)) (.cse1 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_142| |v_thread1Thread1of1ForFork2_plus_~b#1_142|))) (and (= |v_thread1Thread1of1ForFork2_~tmp~0#1_144| |v_thread1Thread1of1ForFork2_plus_#res#1_142|) (< 0 v_~N~0_337) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_165| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_165| 0) (<= .cse0 2147483647)) 1 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_165| |v_thread3Thread1of1ForFork1_~tmp~2#1_229|) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_142| 2147483648)) (= |v_thread2Thread1of1ForFork0_#res#1.offset_75| 0) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_142| v_~res1~0_338) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_142| |v_thread1Thread1of1ForFork2_plus_~a#1_142|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_165| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_165|) (= .cse1 |v_thread1Thread1of1ForFork2_plus_#res#1_142|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_165| 2147483648)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_142| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_142|) (<= v_~res2~0_433 .cse2) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_144| v_~res1~0_337) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_142| |v_thread1Thread1of1ForFork2_plus_~b#1_142|) (= |v_thread3Thread1of1ForFork1_plus_~a#1_165| |v_thread3Thread1of1ForFork1_plus_#in~a#1_165|) (<= v_~res2~0_432 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_165| 2147483647) (= |v_thread1Thread1of1ForFork2_~i~0#1_187| 1) (= (+ (select .cse3 v_~A~0.offset_359) (select .cse4 v_~B~0.offset_349)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_142|) (= |v_thread3Thread1of1ForFork1_plus_~b#1_165| |v_thread3Thread1of1ForFork1_plus_#in~b#1_165|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_144| 2147483648)) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_165| v_~res2~0_432) (= |v_thread3Thread1of1ForFork1_plus_#res#1_165| .cse0) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_229| 2147483648)) (= (let ((.cse5 (* |v_thread3Thread1of1ForFork1_~i~2#1_401| 4))) (+ (select .cse3 (+ v_~A~0.offset_359 .cse5)) (select .cse4 (+ v_~B~0.offset_349 .cse5)) v_~res2~0_433)) v_~res2~0_432) (= (let ((.cse6 (* |v_thread3Thread1of1ForFork1_~i~2#1_400| 4))) (+ (select .cse4 (+ v_~B~0.offset_349 .cse6)) (select .cse3 (+ v_~A~0.offset_359 .cse6)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_165|) (<= v_~res2~0_432 (+ 2147483647 v_~res2~0_433)) (<= 0 .cse2) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_228| v_~M~0_243)) (= (ite (or (<= .cse1 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_142| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_142|) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_142| 2147483647) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_144| 2147483647) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_229| 2147483647) (= |v_thread3Thread1of1ForFork1_~i~2#1_400| (+ |v_thread3Thread1of1ForFork1_~i~2#1_401| 1)) (= |v_thread2Thread1of1ForFork0_#res#1.base_75| 0) (< |v_thread3Thread1of1ForFork1_~i~2#1_400| v_~N~0_337))) InVars {~res1~0=v_~res1~0_338, ~A~0.base=v_~A~0.base_357, ~B~0.base=v_~B~0.base_347, ~A~0.offset=v_~A~0.offset_359, ~M~0=v_~M~0_243, #memory_int=|v_#memory_int_570|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_228|, ~N~0=v_~N~0_337, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_401|, ~B~0.offset=v_~B~0.offset_349, ~res2~0=v_~res2~0_433} OutVars{~res1~0=v_~res1~0_337, ~A~0.base=v_~A~0.base_357, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_142|, ~B~0.base=v_~B~0.base_347, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_142|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_75|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_142|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_165|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_228|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_142|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_165|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_400|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_142|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_229|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_165|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_142|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_165|, ~B~0.offset=v_~B~0.offset_349, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_142|, ~res2~0=v_~res2~0_432, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_142|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_165|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_165|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_165|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_144|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_165|, ~N~0=v_~N~0_337, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_142|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_165|, ~A~0.offset=v_~A~0.offset_359, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_75|, ~M~0=v_~M~0_243, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_187|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_142|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_142|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_165|, #memory_int=|v_#memory_int_570|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_156|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_165|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_142|} 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 00:16:54,009 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [928] L61-4-->L64: Formula: (let ((.cse1 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|))) (and (= (let ((.cse0 (* |v_thread2Thread1of1ForFork0_~i~1#1_23| 4))) (+ (select (select |v_#memory_int_154| v_~B~0.base_72) (+ v_~B~0.offset_72 .cse0)) (select (select |v_#memory_int_154| v_~A~0.base_74) (+ v_~A~0.offset_74 .cse0)))) |v_thread2Thread1of1ForFork0_plus_#in~b#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| |v_thread2Thread1of1ForFork0_plus_~a#1_7|) (= .cse1 |v_thread2Thread1of1ForFork0_plus_#res#1_7|) (< |v_thread2Thread1of1ForFork0_~i~1#1_23| v_~M~0_47) (= |v_thread2Thread1of1ForFork0_plus_#res#1_7| |v_thread2Thread1of1ForFork0_~tmp~1#1_19|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_7| 0) (<= .cse1 2147483647)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| v_~res2~0_81))) InVars {~A~0.base=v_~A~0.base_74, ~B~0.base=v_~B~0.base_72, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} OutVars{~A~0.base=v_~A~0.base_74, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_7|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_7|, ~B~0.base=v_~B~0.base_72, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_7|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_7|, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_7|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_7|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_19|, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_7|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_#t~mem7#1] and [945] L99-4-->L100-3: Formula: (and (= |v_#pthreadsForks_69| |v_ULTIMATE.start_main_#t~pre24#1_31|) (= |v_#memory_int_174| (store |v_#memory_int_175| |v_ULTIMATE.start_main_~#t3~0#1.base_39| (store (select |v_#memory_int_175| |v_ULTIMATE.start_main_~#t3~0#1.base_39|) |v_ULTIMATE.start_main_~#t3~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre24#1_31|))) (= |v_#pthreadsForks_68| (+ |v_#pthreadsForks_69| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_69|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_39|, #memory_int=|v_#memory_int_175|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_39|} OutVars{ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_21|, #pthreadsForks=|v_#pthreadsForks_68|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_39|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_31|, #memory_int=|v_#memory_int_174|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_39|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_33|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23#1, #pthreadsForks, ULTIMATE.start_main_#t~pre24#1, #memory_int, ULTIMATE.start_main_#t~pre22#1] [2022-12-06 00:16:54,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [928] L61-4-->L64: Formula: (let ((.cse1 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|))) (and (= (let ((.cse0 (* |v_thread2Thread1of1ForFork0_~i~1#1_23| 4))) (+ (select (select |v_#memory_int_154| v_~B~0.base_72) (+ v_~B~0.offset_72 .cse0)) (select (select |v_#memory_int_154| v_~A~0.base_74) (+ v_~A~0.offset_74 .cse0)))) |v_thread2Thread1of1ForFork0_plus_#in~b#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| |v_thread2Thread1of1ForFork0_plus_~a#1_7|) (= .cse1 |v_thread2Thread1of1ForFork0_plus_#res#1_7|) (< |v_thread2Thread1of1ForFork0_~i~1#1_23| v_~M~0_47) (= |v_thread2Thread1of1ForFork0_plus_#res#1_7| |v_thread2Thread1of1ForFork0_~tmp~1#1_19|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_7| 0) (<= .cse1 2147483647)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| v_~res2~0_81))) InVars {~A~0.base=v_~A~0.base_74, ~B~0.base=v_~B~0.base_72, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} OutVars{~A~0.base=v_~A~0.base_74, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_7|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_7|, ~B~0.base=v_~B~0.base_72, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_7|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_7|, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_7|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_7|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_19|, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_7|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_#t~mem7#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 00:16:54,501 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [928] L61-4-->L64: Formula: (let ((.cse1 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|))) (and (= (let ((.cse0 (* |v_thread2Thread1of1ForFork0_~i~1#1_23| 4))) (+ (select (select |v_#memory_int_154| v_~B~0.base_72) (+ v_~B~0.offset_72 .cse0)) (select (select |v_#memory_int_154| v_~A~0.base_74) (+ v_~A~0.offset_74 .cse0)))) |v_thread2Thread1of1ForFork0_plus_#in~b#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| |v_thread2Thread1of1ForFork0_plus_~a#1_7|) (= .cse1 |v_thread2Thread1of1ForFork0_plus_#res#1_7|) (< |v_thread2Thread1of1ForFork0_~i~1#1_23| v_~M~0_47) (= |v_thread2Thread1of1ForFork0_plus_#res#1_7| |v_thread2Thread1of1ForFork0_~tmp~1#1_19|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_7| 0) (<= .cse1 2147483647)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| v_~res2~0_81))) InVars {~A~0.base=v_~A~0.base_74, ~B~0.base=v_~B~0.base_72, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} OutVars{~A~0.base=v_~A~0.base_74, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_7|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_7|, ~B~0.base=v_~B~0.base_72, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_7|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_7|, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_7|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_7|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_19|, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_7|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_#t~mem7#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 00:16:54,716 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [928] L61-4-->L64: Formula: (let ((.cse1 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|))) (and (= (let ((.cse0 (* |v_thread2Thread1of1ForFork0_~i~1#1_23| 4))) (+ (select (select |v_#memory_int_154| v_~B~0.base_72) (+ v_~B~0.offset_72 .cse0)) (select (select |v_#memory_int_154| v_~A~0.base_74) (+ v_~A~0.offset_74 .cse0)))) |v_thread2Thread1of1ForFork0_plus_#in~b#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| |v_thread2Thread1of1ForFork0_plus_~a#1_7|) (= .cse1 |v_thread2Thread1of1ForFork0_plus_#res#1_7|) (< |v_thread2Thread1of1ForFork0_~i~1#1_23| v_~M~0_47) (= |v_thread2Thread1of1ForFork0_plus_#res#1_7| |v_thread2Thread1of1ForFork0_~tmp~1#1_19|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_7| 0) (<= .cse1 2147483647)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| v_~res2~0_81))) InVars {~A~0.base=v_~A~0.base_74, ~B~0.base=v_~B~0.base_72, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} OutVars{~A~0.base=v_~A~0.base_74, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_7|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_7|, ~B~0.base=v_~B~0.base_72, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_7|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_7|, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_7|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_7|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_19|, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_7|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_#t~mem7#1] and [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] [2022-12-06 00:16:54,798 WARN L322 ript$VariableManager]: TermVariable LBE534 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:54,798 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:54,798 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:54,798 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:54,798 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:54,798 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:54,798 WARN L322 ript$VariableManager]: TermVariable LBE535 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:54,798 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:54,798 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:54,799 WARN L322 ript$VariableManager]: TermVariable LBE444 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:54,799 WARN L322 ript$VariableManager]: TermVariable LBE520 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:54,799 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:54,799 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:54,799 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:54,799 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:54,799 WARN L322 ript$VariableManager]: TermVariable LBE192 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:56,141 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 00:16:56,230 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 00:16:57,015 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 00:16:57,022 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 00:16:57,116 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 [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 00:16:57,457 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 00:16:57,701 WARN L322 ript$VariableManager]: TermVariable LBE534 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:57,701 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:57,701 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:57,701 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:57,701 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:57,701 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:57,701 WARN L322 ript$VariableManager]: TermVariable LBE535 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:57,701 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:57,701 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:57,701 WARN L322 ript$VariableManager]: TermVariable LBE444 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:57,701 WARN L322 ript$VariableManager]: TermVariable LBE520 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:57,702 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:57,702 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:57,702 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:57,702 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:57,702 WARN L322 ript$VariableManager]: TermVariable LBE192 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:59,484 WARN L322 ript$VariableManager]: TermVariable LBE534 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:59,484 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:59,484 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:59,484 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:59,484 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:59,485 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:59,485 WARN L322 ript$VariableManager]: TermVariable LBE535 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:59,485 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:59,485 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:59,485 WARN L322 ript$VariableManager]: TermVariable LBE444 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:59,485 WARN L322 ript$VariableManager]: TermVariable LBE520 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:59,485 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:59,485 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:59,485 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:59,485 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:16:59,485 WARN L322 ript$VariableManager]: TermVariable LBE192 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:01,564 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 [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 00:17:05,618 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 00:17:05,842 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 00:17:05,974 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 00:17:06,462 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1081] L61-4-->L74-4: Formula: (let ((.cse5 (select |v_#memory_int_595| v_~A~0.base_375)) (.cse7 (select |v_#memory_int_595| v_~B~0.base_365)) (.cse6 (* |v_thread3Thread1of1ForFork1_~i~2#1_428| 4))) (let ((.cse1 (select .cse7 (+ v_~B~0.offset_367 .cse6))) (.cse2 (select .cse5 (+ .cse6 v_~A~0.offset_377)))) (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_161| |v_thread1Thread1of1ForFork2_plus_~b#1_161|)) (.cse3 (+ .cse1 .cse2 v_~res2~0_463)) (.cse4 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_181| |v_thread3Thread1of1ForFork1_plus_~b#1_181|))) (and (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_181| 2147483648)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_181| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_181|) (= v_~res2~0_461 |v_thread3Thread1of1ForFork1_~tmp~2#1_245|) (= |v_thread3Thread1of1ForFork1_plus_~a#1_181| |v_thread3Thread1of1ForFork1_plus_#in~a#1_181|) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_161| |v_thread1Thread1of1ForFork2_plus_~b#1_161|) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_163| 2147483647) (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_161| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_161|) (<= 0 (+ .cse1 .cse2 v_~res2~0_463 2147483648)) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_245| 2147483648)) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_161|) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_163| v_~res1~0_369) (= |v_thread3Thread1of1ForFork1_plus_~b#1_181| |v_thread3Thread1of1ForFork1_plus_#in~b#1_181|) (= |v_thread2Thread1of1ForFork0_#res#1.base_87| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_87| 0) (not (< |v_thread2Thread1of1ForFork0_~i~1#1_248| v_~M~0_259)) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_161| |v_thread1Thread1of1ForFork2_plus_~a#1_161|) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_163| |v_thread1Thread1of1ForFork2_plus_#res#1_161|) (< 0 v_~N~0_353) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_161| v_~res1~0_370) (<= (+ .cse1 .cse2) 2147483647) (<= 0 (+ .cse1 .cse2 2147483648)) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_161| 2147483648)) (<= .cse3 2147483647) (= |v_thread1Thread1of1ForFork2_~i~0#1_206| 1) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_181| 2147483647) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_181| (ite (or (<= .cse4 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_181| 0)) 1 0)) (= (+ 2 |v_thread3Thread1of1ForFork1_~i~2#1_428|) |v_thread3Thread1of1ForFork1_~i~2#1_426|) (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_428| 1) v_~N~0_353) (<= |v_thread1Thread1of1ForFork2_plus_#in~b#1_161| 2147483647) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_161| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_161|) (= .cse3 |v_thread3Thread1of1ForFork1_plus_#in~a#1_181|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_181| |v_thread3Thread1of1ForFork1_~tmp~2#1_245|) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_163| 2147483648)) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_245| 2147483647) (= (+ (select .cse5 (+ .cse6 v_~A~0.offset_377 4)) (select .cse7 (+ v_~B~0.offset_367 .cse6 4))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_181|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_181| .cse4) (= (+ (select .cse7 v_~B~0.offset_367) (select .cse5 v_~A~0.offset_377)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_161|))))) InVars {~res1~0=v_~res1~0_370, ~A~0.base=v_~A~0.base_375, ~B~0.base=v_~B~0.base_365, ~A~0.offset=v_~A~0.offset_377, ~M~0=v_~M~0_259, #memory_int=|v_#memory_int_595|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_248|, ~N~0=v_~N~0_353, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_428|, ~B~0.offset=v_~B~0.offset_367, ~res2~0=v_~res2~0_463} OutVars{~res1~0=v_~res1~0_369, ~A~0.base=v_~A~0.base_375, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_161|, ~B~0.base=v_~B~0.base_365, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_161|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_87|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_161|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_181|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_248|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_161|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_426|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_181|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_161|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_245|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_181|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_161|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_181|, ~B~0.offset=v_~B~0.offset_367, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_161|, ~res2~0=v_~res2~0_461, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_161|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_181|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_181|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_181|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_163|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_181|, ~N~0=v_~N~0_353, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_161|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_181|, ~A~0.offset=v_~A~0.offset_377, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_87|, ~M~0=v_~M~0_259, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_206|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_161|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_161|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_167|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_181|, #memory_int=|v_#memory_int_595|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_181|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_161|} 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, 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~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 00:17:07,940 WARN L322 ript$VariableManager]: TermVariable LBE534 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:07,941 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:07,941 WARN L322 ript$VariableManager]: TermVariable LBE535 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:07,941 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:07,941 WARN L322 ript$VariableManager]: TermVariable LBE444 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:07,941 WARN L322 ript$VariableManager]: TermVariable LBE520 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:07,941 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:07,941 WARN L322 ript$VariableManager]: TermVariable LBE192 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:09,158 WARN L322 ript$VariableManager]: TermVariable LBE534 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:09,158 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:09,158 WARN L322 ript$VariableManager]: TermVariable LBE535 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:09,158 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:09,158 WARN L322 ript$VariableManager]: TermVariable LBE444 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:09,158 WARN L322 ript$VariableManager]: TermVariable LBE520 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:09,158 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:09,158 WARN L322 ript$VariableManager]: TermVariable LBE192 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:10,526 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1096] $Ultimate##0-->L61-4: Formula: (and (= v_~M~0_281 |v_thread3Thread1of1ForFork1_~i~2#1_454|) (= |v_thread2Thread1of1ForFork0_~i~1#1_272| 0)) InVars {~M~0=v_~M~0_281} OutVars{~M~0=v_~M~0_281, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_272|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_454|} 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 00:17:11,095 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1096] $Ultimate##0-->L61-4: Formula: (and (= v_~M~0_281 |v_thread3Thread1of1ForFork1_~i~2#1_454|) (= |v_thread2Thread1of1ForFork0_~i~1#1_272| 0)) InVars {~M~0=v_~M~0_281} OutVars{~M~0=v_~M~0_281, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_272|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_454|} 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 00:17:11,798 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 [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 00:17:12,430 INFO L203 LiptonReduction]: Total number of compositions: 18 [2022-12-06 00:17:12,430 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21992 [2022-12-06 00:17:12,431 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 521 transitions, 12921 flow [2022-12-06 00:17:12,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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 00:17:12,431 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:17:12,431 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 00:17:12,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 00:17:12,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-06 00:17:12,632 INFO L420 AbstractCegarLoop]: === Iteration 32 === 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 00:17:12,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:17:12,632 INFO L85 PathProgramCache]: Analyzing trace with hash 120263689, now seen corresponding path program 1 times [2022-12-06 00:17:12,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:17:12,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338797557] [2022-12-06 00:17:12,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:12,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:17:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:12,669 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 00:17:12,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:17:12,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338797557] [2022-12-06 00:17:12,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338797557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:17:12,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:17:12,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:17:12,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688629240] [2022-12-06 00:17:12,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:17:12,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:17:12,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:17:12,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:17:12,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:17:12,671 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 90 [2022-12-06 00:17:12,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 521 transitions, 12921 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 00:17:12,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:17:12,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 90 [2022-12-06 00:17:12,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:17:14,289 INFO L130 PetriNetUnfolder]: 5125/7749 cut-off events. [2022-12-06 00:17:14,289 INFO L131 PetriNetUnfolder]: For 268977/269446 co-relation queries the response was YES. [2022-12-06 00:17:14,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83204 conditions, 7749 events. 5125/7749 cut-off events. For 268977/269446 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 44564 event pairs, 1490 based on Foata normal form. 320/7903 useless extension candidates. Maximal degree in co-relation 83117. Up to 3948 conditions per place. [2022-12-06 00:17:14,369 INFO L137 encePairwiseOnDemand]: 76/90 looper letters, 626 selfloop transitions, 9 changer transitions 3/666 dead transitions. [2022-12-06 00:17:14,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 666 transitions, 17448 flow [2022-12-06 00:17:14,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:17:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:17:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-12-06 00:17:14,371 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2022-12-06 00:17:14,371 INFO L175 Difference]: Start difference. First operand has 180 places, 521 transitions, 12921 flow. Second operand 4 states and 136 transitions. [2022-12-06 00:17:14,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 666 transitions, 17448 flow [2022-12-06 00:17:14,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 666 transitions, 16598 flow, removed 415 selfloop flow, removed 6 redundant places. [2022-12-06 00:17:14,965 INFO L231 Difference]: Finished difference. Result has 178 places, 504 transitions, 11811 flow [2022-12-06 00:17:14,966 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=11815, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=11811, PETRI_PLACES=178, PETRI_TRANSITIONS=504} [2022-12-06 00:17:14,966 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 145 predicate places. [2022-12-06 00:17:14,966 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:17:14,966 INFO L89 Accepts]: Start accepts. Operand has 178 places, 504 transitions, 11811 flow [2022-12-06 00:17:14,968 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:17:14,968 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:17:14,968 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 504 transitions, 11811 flow [2022-12-06 00:17:14,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 504 transitions, 11811 flow [2022-12-06 00:17:15,340 INFO L130 PetriNetUnfolder]: 1374/2828 cut-off events. [2022-12-06 00:17:15,340 INFO L131 PetriNetUnfolder]: For 58893/59186 co-relation queries the response was YES. [2022-12-06 00:17:15,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27387 conditions, 2828 events. 1374/2828 cut-off events. For 58893/59186 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 20478 event pairs, 107 based on Foata normal form. 49/2791 useless extension candidates. Maximal degree in co-relation 27086. Up to 1130 conditions per place. [2022-12-06 00:17:15,384 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 504 transitions, 11811 flow [2022-12-06 00:17:15,384 INFO L188 LiptonReduction]: Number of co-enabled transitions 1906 [2022-12-06 00:17:15,386 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:17:15,386 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 420 [2022-12-06 00:17:15,387 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 504 transitions, 11811 flow [2022-12-06 00:17:15,387 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 00:17:15,387 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:17:15,387 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 00:17:15,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 00:17:15,387 INFO L420 AbstractCegarLoop]: === Iteration 33 === 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 00:17:15,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:17:15,387 INFO L85 PathProgramCache]: Analyzing trace with hash -901714700, now seen corresponding path program 1 times [2022-12-06 00:17:15,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:17:15,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785837042] [2022-12-06 00:17:15,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:15,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:17:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:15,452 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 00:17:15,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:17:15,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785837042] [2022-12-06 00:17:15,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785837042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:17:15,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:17:15,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:17:15,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475505559] [2022-12-06 00:17:15,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:17:15,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:17:15,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:17:15,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:17:15,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:17:15,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 83 [2022-12-06 00:17:15,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 504 transitions, 11811 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:17:15,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:17:15,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 83 [2022-12-06 00:17:15,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:17:16,999 INFO L130 PetriNetUnfolder]: 5218/7862 cut-off events. [2022-12-06 00:17:17,000 INFO L131 PetriNetUnfolder]: For 232467/232618 co-relation queries the response was YES. [2022-12-06 00:17:17,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81496 conditions, 7862 events. 5218/7862 cut-off events. For 232467/232618 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 44674 event pairs, 1148 based on Foata normal form. 130/7963 useless extension candidates. Maximal degree in co-relation 81054. Up to 3829 conditions per place. [2022-12-06 00:17:17,083 INFO L137 encePairwiseOnDemand]: 68/83 looper letters, 635 selfloop transitions, 27 changer transitions 0/673 dead transitions. [2022-12-06 00:17:17,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 673 transitions, 16748 flow [2022-12-06 00:17:17,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:17:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:17:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-12-06 00:17:17,084 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3825301204819277 [2022-12-06 00:17:17,084 INFO L175 Difference]: Start difference. First operand has 176 places, 504 transitions, 11811 flow. Second operand 4 states and 127 transitions. [2022-12-06 00:17:17,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 673 transitions, 16748 flow [2022-12-06 00:17:17,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 673 transitions, 16728 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 00:17:17,733 INFO L231 Difference]: Finished difference. Result has 177 places, 506 transitions, 11885 flow [2022-12-06 00:17:17,734 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=11710, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=11885, PETRI_PLACES=177, PETRI_TRANSITIONS=506} [2022-12-06 00:17:17,734 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 144 predicate places. [2022-12-06 00:17:17,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:17:17,734 INFO L89 Accepts]: Start accepts. Operand has 177 places, 506 transitions, 11885 flow [2022-12-06 00:17:17,736 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:17:17,736 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:17:17,736 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 506 transitions, 11885 flow [2022-12-06 00:17:17,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 506 transitions, 11885 flow [2022-12-06 00:17:18,437 INFO L130 PetriNetUnfolder]: 1376/2839 cut-off events. [2022-12-06 00:17:18,437 INFO L131 PetriNetUnfolder]: For 59381/59678 co-relation queries the response was YES. [2022-12-06 00:17:18,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27572 conditions, 2839 events. 1376/2839 cut-off events. For 59381/59678 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 20754 event pairs, 109 based on Foata normal form. 50/2805 useless extension candidates. Maximal degree in co-relation 27359. Up to 1130 conditions per place. [2022-12-06 00:17:18,479 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 506 transitions, 11885 flow [2022-12-06 00:17:18,479 INFO L188 LiptonReduction]: Number of co-enabled transitions 1946 [2022-12-06 00:17:18,480 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:17:18,481 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 747 [2022-12-06 00:17:18,481 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 506 transitions, 11885 flow [2022-12-06 00:17:18,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:17:18,481 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:17:18,481 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 00:17:18,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 00:17:18,481 INFO L420 AbstractCegarLoop]: === Iteration 34 === 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 00:17:18,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:17:18,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1400545280, now seen corresponding path program 1 times [2022-12-06 00:17:18,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:17:18,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014117972] [2022-12-06 00:17:18,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:18,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:17:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:19,000 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 00:17:19,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:17:19,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014117972] [2022-12-06 00:17:19,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014117972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:17:19,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:17:19,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 00:17:19,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470720916] [2022-12-06 00:17:19,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:17:19,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:17:19,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:17:19,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:17:19,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:17:19,002 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 81 [2022-12-06 00:17:19,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 506 transitions, 11885 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 00:17:19,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:17:19,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 81 [2022-12-06 00:17:19,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:17:21,082 INFO L130 PetriNetUnfolder]: 5303/8023 cut-off events. [2022-12-06 00:17:21,083 INFO L131 PetriNetUnfolder]: For 226062/226062 co-relation queries the response was YES. [2022-12-06 00:17:21,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83053 conditions, 8023 events. 5303/8023 cut-off events. For 226062/226062 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 45796 event pairs, 979 based on Foata normal form. 2/8021 useless extension candidates. Maximal degree in co-relation 82646. Up to 6268 conditions per place. [2022-12-06 00:17:21,176 INFO L137 encePairwiseOnDemand]: 24/81 looper letters, 254 selfloop transitions, 315 changer transitions 7/576 dead transitions. [2022-12-06 00:17:21,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 576 transitions, 13871 flow [2022-12-06 00:17:21,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 00:17:21,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 00:17:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 159 transitions. [2022-12-06 00:17:21,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1962962962962963 [2022-12-06 00:17:21,178 INFO L175 Difference]: Start difference. First operand has 177 places, 506 transitions, 11885 flow. Second operand 10 states and 159 transitions. [2022-12-06 00:17:21,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 576 transitions, 13871 flow [2022-12-06 00:17:21,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 576 transitions, 13865 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 00:17:21,901 INFO L231 Difference]: Finished difference. Result has 190 places, 529 transitions, 13624 flow [2022-12-06 00:17:21,902 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=11881, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=292, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13624, PETRI_PLACES=190, PETRI_TRANSITIONS=529} [2022-12-06 00:17:21,902 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 157 predicate places. [2022-12-06 00:17:21,902 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:17:21,902 INFO L89 Accepts]: Start accepts. Operand has 190 places, 529 transitions, 13624 flow [2022-12-06 00:17:21,904 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:17:21,904 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:17:21,904 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 529 transitions, 13624 flow [2022-12-06 00:17:21,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 529 transitions, 13624 flow [2022-12-06 00:17:22,335 INFO L130 PetriNetUnfolder]: 1388/2874 cut-off events. [2022-12-06 00:17:22,335 INFO L131 PetriNetUnfolder]: For 70859/71153 co-relation queries the response was YES. [2022-12-06 00:17:22,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29551 conditions, 2874 events. 1388/2874 cut-off events. For 70859/71153 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 21131 event pairs, 111 based on Foata normal form. 49/2839 useless extension candidates. Maximal degree in co-relation 29324. Up to 1141 conditions per place. [2022-12-06 00:17:22,384 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 529 transitions, 13624 flow [2022-12-06 00:17:22,385 INFO L188 LiptonReduction]: Number of co-enabled transitions 2014 [2022-12-06 00:17:22,398 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1119] $Ultimate##0-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_205| |v_thread1Thread1of1ForFork2_plus_~b#1_205|)) (.cse2 (select |v_#memory_int_669| v_~B~0.base_431)) (.cse1 (select |v_#memory_int_669| v_~A~0.base_443)) (.cse3 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_103| |v_thread2Thread1of1ForFork0_plus_~b#1_103|))) (and (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_103| |v_thread2Thread1of1ForFork0_plus_~a#1_103|) (= v_~M~0_301 |v_thread3Thread1of1ForFork1_~i~2#1_508|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_205| v_~res1~0_452) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_205| (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_205| 0) (<= .cse0 2147483647)) 1 0)) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_207| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_207| v_~res1~0_451) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_103| |v_thread2Thread1of1ForFork0_plus_~b#1_103|) (= (+ (select .cse1 v_~A~0.offset_445) (select .cse2 v_~B~0.offset_433)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_205|) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_205| |v_thread1Thread1of1ForFork2_plus_~b#1_205|) (= .cse3 |v_thread2Thread1of1ForFork0_plus_#res#1_103|) (= |v_thread1Thread1of1ForFork2_plus_#res#1_205| .cse0) (<= |v_thread2Thread1of1ForFork0_plus_#res#1_103| 2147483647) (= |v_thread1Thread1of1ForFork2_~i~0#1_258| 1) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_103| v_~res2~0_555) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_103| 2147483648)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_103| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_207| |v_thread1Thread1of1ForFork2_plus_#res#1_205|) (< |v_thread2Thread1of1ForFork0_~i~1#1_290| v_~M~0_301) (= (let ((.cse4 (* |v_thread2Thread1of1ForFork0_~i~1#1_290| 4))) (+ (select .cse2 (+ .cse4 v_~B~0.offset_433)) (select .cse1 (+ .cse4 v_~A~0.offset_445)))) |v_thread2Thread1of1ForFork0_plus_#in~b#1_103|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_205| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_205|) (= |v_thread2Thread1of1ForFork0_~tmp~1#1_134| |v_thread2Thread1of1ForFork0_plus_#res#1_103|) (< 0 v_~N~0_409) (= |v_thread2Thread1of1ForFork0_~i~1#1_290| 0) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_205| 2147483648)) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_207| 2147483647) (<= |v_thread2Thread1of1ForFork0_plus_#in~b#1_103| 2147483647) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103| (ite (or (<= .cse3 2147483647) (<= |v_thread2Thread1of1ForFork0_plus_~b#1_103| 0)) 1 0)) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_205| |v_thread1Thread1of1ForFork2_plus_~a#1_205|))) InVars {~res1~0=v_~res1~0_452, ~A~0.base=v_~A~0.base_443, ~B~0.base=v_~B~0.base_431, ~A~0.offset=v_~A~0.offset_445, ~M~0=v_~M~0_301, #memory_int=|v_#memory_int_669|, ~N~0=v_~N~0_409, ~B~0.offset=v_~B~0.offset_433, ~res2~0=v_~res2~0_555} OutVars{~res1~0=v_~res1~0_451, ~A~0.base=v_~A~0.base_443, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_205|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_103|, ~B~0.base=v_~B~0.base_431, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_205|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_103|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_205|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_290|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_205|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_508|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_205|, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_103|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_103|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_103|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_103|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_134|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_205|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_205|, ~B~0.offset=v_~B~0.offset_433, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_205|, ~res2~0=v_~res2~0_555, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_103|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_207|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_205|, ~N~0=v_~N~0_409, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_103|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_103|, ~A~0.offset=v_~A~0.offset_445, ~M~0=v_~M~0_301, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_258|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_205|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_205|, #memory_int=|v_#memory_int_669|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_103|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_205|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork0_#t~mem8#1, thread1Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork1_~i~2#1, thread1Thread1of1ForFork2_#t~post1#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_~tmp~1#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread2Thread1of1ForFork0_#t~mem7#1, thread1Thread1of1ForFork2_plus_#res#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 00:17:22,730 WARN L322 ript$VariableManager]: TermVariable LBE479 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:22,730 WARN L322 ript$VariableManager]: TermVariable LBE523 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:22,730 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:22,730 WARN L322 ript$VariableManager]: TermVariable LBE137 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:22,731 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:22,731 WARN L322 ript$VariableManager]: TermVariable LBE541 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:22,731 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:22,731 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:22,731 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:22,731 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:22,731 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:22,731 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:22,731 WARN L322 ript$VariableManager]: TermVariable LBE118 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:22,731 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:22,731 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:22,731 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:23,594 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1119] $Ultimate##0-->L48-4: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_205| |v_thread1Thread1of1ForFork2_plus_~b#1_205|)) (.cse2 (select |v_#memory_int_669| v_~B~0.base_431)) (.cse1 (select |v_#memory_int_669| v_~A~0.base_443)) (.cse3 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_103| |v_thread2Thread1of1ForFork0_plus_~b#1_103|))) (and (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_103| |v_thread2Thread1of1ForFork0_plus_~a#1_103|) (= v_~M~0_301 |v_thread3Thread1of1ForFork1_~i~2#1_508|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_205| v_~res1~0_452) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_205| (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_205| 0) (<= .cse0 2147483647)) 1 0)) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_207| 2147483648)) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_207| v_~res1~0_451) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_103| |v_thread2Thread1of1ForFork0_plus_~b#1_103|) (= (+ (select .cse1 v_~A~0.offset_445) (select .cse2 v_~B~0.offset_433)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_205|) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_205| |v_thread1Thread1of1ForFork2_plus_~b#1_205|) (= .cse3 |v_thread2Thread1of1ForFork0_plus_#res#1_103|) (= |v_thread1Thread1of1ForFork2_plus_#res#1_205| .cse0) (<= |v_thread2Thread1of1ForFork0_plus_#res#1_103| 2147483647) (= |v_thread1Thread1of1ForFork2_~i~0#1_258| 1) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_103| v_~res2~0_555) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_103| 2147483648)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_103| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_207| |v_thread1Thread1of1ForFork2_plus_#res#1_205|) (< |v_thread2Thread1of1ForFork0_~i~1#1_290| v_~M~0_301) (= (let ((.cse4 (* |v_thread2Thread1of1ForFork0_~i~1#1_290| 4))) (+ (select .cse2 (+ .cse4 v_~B~0.offset_433)) (select .cse1 (+ .cse4 v_~A~0.offset_445)))) |v_thread2Thread1of1ForFork0_plus_#in~b#1_103|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_205| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_205|) (= |v_thread2Thread1of1ForFork0_~tmp~1#1_134| |v_thread2Thread1of1ForFork0_plus_#res#1_103|) (< 0 v_~N~0_409) (= |v_thread2Thread1of1ForFork0_~i~1#1_290| 0) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_205| 2147483648)) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_207| 2147483647) (<= |v_thread2Thread1of1ForFork0_plus_#in~b#1_103| 2147483647) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103| (ite (or (<= .cse3 2147483647) (<= |v_thread2Thread1of1ForFork0_plus_~b#1_103| 0)) 1 0)) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_205| |v_thread1Thread1of1ForFork2_plus_~a#1_205|))) InVars {~res1~0=v_~res1~0_452, ~A~0.base=v_~A~0.base_443, ~B~0.base=v_~B~0.base_431, ~A~0.offset=v_~A~0.offset_445, ~M~0=v_~M~0_301, #memory_int=|v_#memory_int_669|, ~N~0=v_~N~0_409, ~B~0.offset=v_~B~0.offset_433, ~res2~0=v_~res2~0_555} OutVars{~res1~0=v_~res1~0_451, ~A~0.base=v_~A~0.base_443, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_205|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_103|, ~B~0.base=v_~B~0.base_431, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_205|, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_103|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_205|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_103|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_290|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_205|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_508|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_205|, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_103|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_103|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_103|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_103|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_134|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_205|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_205|, ~B~0.offset=v_~B~0.offset_433, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_205|, ~res2~0=v_~res2~0_555, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_103|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_207|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_205|, ~N~0=v_~N~0_409, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_103|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_103|, ~A~0.offset=v_~A~0.offset_445, ~M~0=v_~M~0_301, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_258|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_205|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_205|, #memory_int=|v_#memory_int_669|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_103|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_205|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork0_#t~mem8#1, thread1Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork1_~i~2#1, thread1Thread1of1ForFork2_#t~post1#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_~tmp~1#1, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork2_~tmp~0#1, thread1Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread2Thread1of1ForFork0_#t~mem7#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 00:17:24,672 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1130] $Ultimate##0-->L77: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_239| |v_thread3Thread1of1ForFork1_plus_~b#1_239|)) (.cse5 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_113| |v_thread2Thread1of1ForFork0_plus_~b#1_113|)) (.cse1 (select |v_#memory_int_689| v_~B~0.base_451)) (.cse3 (select |v_#memory_int_689| v_~A~0.base_463)) (.cse6 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_221| |v_thread1Thread1of1ForFork2_plus_~b#1_221|))) (and (<= |v_thread2Thread1of1ForFork0_plus_#res#1_113| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_223| 2147483648)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_113| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_113| v_~res2~0_579) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_239|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_221| |v_thread1Thread1of1ForFork2_plus_~a#1_221|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_239| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_239| 0) (<= .cse0 2147483647)) 1 0)) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_221| 2147483648)) (= |v_thread2Thread1of1ForFork0_~tmp~1#1_144| |v_thread2Thread1of1ForFork0_plus_#res#1_113|) (= (let ((.cse2 (* |v_thread3Thread1of1ForFork1_~i~2#1_538| 4))) (+ (select .cse1 (+ v_~B~0.offset_453 .cse2)) (select .cse3 (+ v_~A~0.offset_465 .cse2)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_239|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_239| |v_thread3Thread1of1ForFork1_~tmp~2#1_311|) (= (let ((.cse4 (* |v_thread2Thread1of1ForFork0_~i~1#1_306| 4))) (+ (select .cse1 (+ v_~B~0.offset_453 .cse4)) (select .cse3 (+ v_~A~0.offset_465 .cse4)))) |v_thread2Thread1of1ForFork0_plus_#in~b#1_113|) (< |v_thread2Thread1of1ForFork0_~i~1#1_306| v_~M~0_313) (= |v_thread2Thread1of1ForFork0_~i~1#1_306| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_221| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_221|) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_113| 2147483648)) (<= |v_thread2Thread1of1ForFork0_plus_#in~b#1_113| 2147483647) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_113| |v_thread2Thread1of1ForFork0_plus_~b#1_113|) (= |v_thread2Thread1of1ForFork0_plus_#res#1_113| .cse5) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_239| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_239|) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_223| 2147483647) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_221| |v_thread1Thread1of1ForFork2_plus_~b#1_221|) (= v_~M~0_313 |v_thread3Thread1of1ForFork1_~i~2#1_538|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_239| v_~res2~0_579) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_221| (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_221| 0) (<= .cse6 2147483647)) 1 0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_538| v_~N~0_427) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_311| 2147483647) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_113| |v_thread2Thread1of1ForFork0_plus_~a#1_113|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_221| v_~res1~0_482) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_223| v_~res1~0_481) (= |v_thread3Thread1of1ForFork1_plus_~b#1_239| |v_thread3Thread1of1ForFork1_plus_#in~b#1_239|) (= |v_thread3Thread1of1ForFork1_plus_~a#1_239| |v_thread3Thread1of1ForFork1_plus_#in~a#1_239|) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_223| |v_thread1Thread1of1ForFork2_plus_#res#1_221|) (= |v_thread1Thread1of1ForFork2_~i~0#1_280| 1) (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_113| 0) (<= .cse5 2147483647)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113|) (= (+ (select .cse1 v_~B~0.offset_453) (select .cse3 v_~A~0.offset_465)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_221|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_239| 2147483648)) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_239| 2147483647) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_311| 2147483648)) (= .cse6 |v_thread1Thread1of1ForFork2_plus_#res#1_221|))) InVars {~res1~0=v_~res1~0_482, ~A~0.base=v_~A~0.base_463, ~B~0.base=v_~B~0.base_451, ~A~0.offset=v_~A~0.offset_465, ~M~0=v_~M~0_313, #memory_int=|v_#memory_int_689|, ~N~0=v_~N~0_427, ~B~0.offset=v_~B~0.offset_453, ~res2~0=v_~res2~0_579} OutVars{~res1~0=v_~res1~0_481, ~A~0.base=v_~A~0.base_463, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_113|, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_221|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_239|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_306|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_538|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_221|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_113|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_239|, ~B~0.offset=v_~B~0.offset_453, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_239|, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_113|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_239|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_239|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_223|, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_113|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_113|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_239|, ~M~0=v_~M~0_313, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_239|, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_221|, ~B~0.base=v_~B~0.base_451, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_113|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_221|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_221|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_239|, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_113|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_113|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_311|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_113|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_144|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_221|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_239|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_221|, ~res2~0=v_~res2~0_579, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_221|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_239|, ~N~0=v_~N~0_427, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_221|, ~A~0.offset=v_~A~0.offset_465, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_280|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_221|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_221|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_239|, #memory_int=|v_#memory_int_689|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_113|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_221|} AuxVars[] AssignedVars[~res1~0, thread2Thread1of1ForFork0_#t~mem8#1, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_#t~ret14#1, thread1Thread1of1ForFork2_#t~post1#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork1_~tmp~2#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork0_~tmp~1#1, thread1Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork1_#t~mem12#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~tmp~0#1, thread3Thread1of1ForFork1_#t~mem13#1, thread1Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread3Thread1of1ForFork1_#t~ret15#1, thread2Thread1of1ForFork0_#t~mem7#1, thread3Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork2_plus_#res#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 00:17:25,894 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1130] $Ultimate##0-->L77: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_239| |v_thread3Thread1of1ForFork1_plus_~b#1_239|)) (.cse5 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_113| |v_thread2Thread1of1ForFork0_plus_~b#1_113|)) (.cse1 (select |v_#memory_int_689| v_~B~0.base_451)) (.cse3 (select |v_#memory_int_689| v_~A~0.base_463)) (.cse6 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_221| |v_thread1Thread1of1ForFork2_plus_~b#1_221|))) (and (<= |v_thread2Thread1of1ForFork0_plus_#res#1_113| 2147483647) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_223| 2147483648)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_113| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_113| v_~res2~0_579) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_239|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_221| |v_thread1Thread1of1ForFork2_plus_~a#1_221|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_239| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_239| 0) (<= .cse0 2147483647)) 1 0)) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_221| 2147483648)) (= |v_thread2Thread1of1ForFork0_~tmp~1#1_144| |v_thread2Thread1of1ForFork0_plus_#res#1_113|) (= (let ((.cse2 (* |v_thread3Thread1of1ForFork1_~i~2#1_538| 4))) (+ (select .cse1 (+ v_~B~0.offset_453 .cse2)) (select .cse3 (+ v_~A~0.offset_465 .cse2)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_239|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_239| |v_thread3Thread1of1ForFork1_~tmp~2#1_311|) (= (let ((.cse4 (* |v_thread2Thread1of1ForFork0_~i~1#1_306| 4))) (+ (select .cse1 (+ v_~B~0.offset_453 .cse4)) (select .cse3 (+ v_~A~0.offset_465 .cse4)))) |v_thread2Thread1of1ForFork0_plus_#in~b#1_113|) (< |v_thread2Thread1of1ForFork0_~i~1#1_306| v_~M~0_313) (= |v_thread2Thread1of1ForFork0_~i~1#1_306| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_221| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_221|) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_113| 2147483648)) (<= |v_thread2Thread1of1ForFork0_plus_#in~b#1_113| 2147483647) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_113| |v_thread2Thread1of1ForFork0_plus_~b#1_113|) (= |v_thread2Thread1of1ForFork0_plus_#res#1_113| .cse5) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_239| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_239|) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_223| 2147483647) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_221| |v_thread1Thread1of1ForFork2_plus_~b#1_221|) (= v_~M~0_313 |v_thread3Thread1of1ForFork1_~i~2#1_538|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_239| v_~res2~0_579) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_221| (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_221| 0) (<= .cse6 2147483647)) 1 0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_538| v_~N~0_427) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_311| 2147483647) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_113| |v_thread2Thread1of1ForFork0_plus_~a#1_113|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_221| v_~res1~0_482) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_223| v_~res1~0_481) (= |v_thread3Thread1of1ForFork1_plus_~b#1_239| |v_thread3Thread1of1ForFork1_plus_#in~b#1_239|) (= |v_thread3Thread1of1ForFork1_plus_~a#1_239| |v_thread3Thread1of1ForFork1_plus_#in~a#1_239|) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_223| |v_thread1Thread1of1ForFork2_plus_#res#1_221|) (= |v_thread1Thread1of1ForFork2_~i~0#1_280| 1) (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_113| 0) (<= .cse5 2147483647)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113|) (= (+ (select .cse1 v_~B~0.offset_453) (select .cse3 v_~A~0.offset_465)) |v_thread1Thread1of1ForFork2_plus_#in~b#1_221|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_239| 2147483648)) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_239| 2147483647) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_311| 2147483648)) (= .cse6 |v_thread1Thread1of1ForFork2_plus_#res#1_221|))) InVars {~res1~0=v_~res1~0_482, ~A~0.base=v_~A~0.base_463, ~B~0.base=v_~B~0.base_451, ~A~0.offset=v_~A~0.offset_465, ~M~0=v_~M~0_313, #memory_int=|v_#memory_int_689|, ~N~0=v_~N~0_427, ~B~0.offset=v_~B~0.offset_453, ~res2~0=v_~res2~0_579} OutVars{~res1~0=v_~res1~0_481, ~A~0.base=v_~A~0.base_463, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_113|, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_221|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_239|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_306|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_538|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_221|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_113|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_239|, ~B~0.offset=v_~B~0.offset_453, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_239|, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_113|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_239|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_239|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_223|, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_113|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_113|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_239|, ~M~0=v_~M~0_313, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_239|, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_221|, ~B~0.base=v_~B~0.base_451, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_113|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_221|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_113|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_221|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_239|, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_113|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_113|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_311|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_113|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_144|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_221|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_239|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_221|, ~res2~0=v_~res2~0_579, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_221|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_239|, ~N~0=v_~N~0_427, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_221|, ~A~0.offset=v_~A~0.offset_465, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_280|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_221|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_221|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_239|, #memory_int=|v_#memory_int_689|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_113|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_221|} AuxVars[] AssignedVars[~res1~0, thread2Thread1of1ForFork0_#t~mem8#1, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_#t~ret14#1, thread1Thread1of1ForFork2_#t~post1#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork1_~tmp~2#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork0_~tmp~1#1, thread1Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork1_#t~mem12#1, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~tmp~0#1, thread3Thread1of1ForFork1_#t~mem13#1, thread1Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread3Thread1of1ForFork1_#t~ret15#1, thread2Thread1of1ForFork0_#t~mem7#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 00:17:25,894 WARN L322 ript$VariableManager]: TermVariable LBE534 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,895 WARN L322 ript$VariableManager]: TermVariable LBE479 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,895 WARN L322 ript$VariableManager]: TermVariable LBE523 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,895 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,895 WARN L322 ript$VariableManager]: TermVariable LBE137 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,895 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,895 WARN L322 ript$VariableManager]: TermVariable LBE444 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,895 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,895 WARN L322 ript$VariableManager]: TermVariable LBE520 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,895 WARN L322 ript$VariableManager]: TermVariable LBE541 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,895 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,895 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,895 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,895 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,895 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,896 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,896 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,896 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,896 WARN L322 ript$VariableManager]: TermVariable LBE118 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,896 WARN L322 ript$VariableManager]: TermVariable LBE535 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,896 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,896 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,896 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:25,896 WARN L322 ript$VariableManager]: TermVariable LBE192 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:27,267 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:17:27,268 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5366 [2022-12-06 00:17:27,268 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 527 transitions, 13698 flow [2022-12-06 00:17:27,268 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 00:17:27,268 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:17:27,268 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 00:17:27,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-06 00:17:27,268 INFO L420 AbstractCegarLoop]: === Iteration 35 === 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 00:17:27,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:17:27,268 INFO L85 PathProgramCache]: Analyzing trace with hash -543977508, now seen corresponding path program 1 times [2022-12-06 00:17:27,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:17:27,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026500715] [2022-12-06 00:17:27,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:27,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:17:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:28,191 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 00:17:28,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:17:28,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026500715] [2022-12-06 00:17:28,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026500715] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:17:28,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818613910] [2022-12-06 00:17:28,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:28,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:17:28,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:17:28,193 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:17:28,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 00:17:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:28,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 70 conjunts are in the unsatisfiable core [2022-12-06 00:17:28,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:17:28,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 00:17:28,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:17:28,562 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 00:17:28,589 INFO L321 Elim1Store]: treesize reduction 48, result has 37.7 percent of original size [2022-12-06 00:17:28,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 59 treesize of output 43 [2022-12-06 00:17:28,617 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 00:17:28,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:17:28,820 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:17:28,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 68 treesize of output 321 [2022-12-06 00:17:36,669 INFO L321 Elim1Store]: treesize reduction 235, result has 23.5 percent of original size [2022-12-06 00:17:36,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 67 treesize of output 85 [2022-12-06 00:17:36,774 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 00:17:36,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818613910] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:17:36,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:17:36,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2022-12-06 00:17:36,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642178995] [2022-12-06 00:17:36,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:17:36,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 00:17:36,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:17:36,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 00:17:36,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-12-06 00:17:36,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 85 [2022-12-06 00:17:36,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 527 transitions, 13698 flow. Second operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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 00:17:36,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:17:36,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 85 [2022-12-06 00:17:36,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:17:39,963 INFO L130 PetriNetUnfolder]: 5829/8760 cut-off events. [2022-12-06 00:17:39,963 INFO L131 PetriNetUnfolder]: For 296952/296952 co-relation queries the response was YES. [2022-12-06 00:17:40,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97717 conditions, 8760 events. 5829/8760 cut-off events. For 296952/296952 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 49780 event pairs, 922 based on Foata normal form. 1/8757 useless extension candidates. Maximal degree in co-relation 97239. Up to 7042 conditions per place. [2022-12-06 00:17:40,062 INFO L137 encePairwiseOnDemand]: 18/85 looper letters, 313 selfloop transitions, 418 changer transitions 7/738 dead transitions. [2022-12-06 00:17:40,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 738 transitions, 19296 flow [2022-12-06 00:17:40,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 00:17:40,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 00:17:40,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 244 transitions. [2022-12-06 00:17:40,063 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1248081841432225 [2022-12-06 00:17:40,063 INFO L175 Difference]: Start difference. First operand has 188 places, 527 transitions, 13698 flow. Second operand 23 states and 244 transitions. [2022-12-06 00:17:40,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 738 transitions, 19296 flow [2022-12-06 00:17:41,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 738 transitions, 18885 flow, removed 65 selfloop flow, removed 5 redundant places. [2022-12-06 00:17:41,251 INFO L231 Difference]: Finished difference. Result has 213 places, 653 transitions, 17946 flow [2022-12-06 00:17:41,251 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=13293, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=320, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=17946, PETRI_PLACES=213, PETRI_TRANSITIONS=653} [2022-12-06 00:17:41,252 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 180 predicate places. [2022-12-06 00:17:41,252 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:17:41,252 INFO L89 Accepts]: Start accepts. Operand has 213 places, 653 transitions, 17946 flow [2022-12-06 00:17:41,254 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:17:41,254 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:17:41,254 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 653 transitions, 17946 flow [2022-12-06 00:17:41,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 653 transitions, 17946 flow [2022-12-06 00:17:41,994 INFO L130 PetriNetUnfolder]: 1575/3159 cut-off events. [2022-12-06 00:17:41,994 INFO L131 PetriNetUnfolder]: For 83000/83240 co-relation queries the response was YES. [2022-12-06 00:17:42,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35606 conditions, 3159 events. 1575/3159 cut-off events. For 83000/83240 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 22682 event pairs, 96 based on Foata normal form. 39/3104 useless extension candidates. Maximal degree in co-relation 35367. Up to 1298 conditions per place. [2022-12-06 00:17:42,059 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 653 transitions, 17946 flow [2022-12-06 00:17:42,059 INFO L188 LiptonReduction]: Number of co-enabled transitions 2358 [2022-12-06 00:17:42,065 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [928] L61-4-->L64: Formula: (let ((.cse1 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|))) (and (= (let ((.cse0 (* |v_thread2Thread1of1ForFork0_~i~1#1_23| 4))) (+ (select (select |v_#memory_int_154| v_~B~0.base_72) (+ v_~B~0.offset_72 .cse0)) (select (select |v_#memory_int_154| v_~A~0.base_74) (+ v_~A~0.offset_74 .cse0)))) |v_thread2Thread1of1ForFork0_plus_#in~b#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| |v_thread2Thread1of1ForFork0_plus_~a#1_7|) (= .cse1 |v_thread2Thread1of1ForFork0_plus_#res#1_7|) (< |v_thread2Thread1of1ForFork0_~i~1#1_23| v_~M~0_47) (= |v_thread2Thread1of1ForFork0_plus_#res#1_7| |v_thread2Thread1of1ForFork0_~tmp~1#1_19|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_7| 0) (<= .cse1 2147483647)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| v_~res2~0_81))) InVars {~A~0.base=v_~A~0.base_74, ~B~0.base=v_~B~0.base_72, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} OutVars{~A~0.base=v_~A~0.base_74, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_7|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_7|, ~B~0.base=v_~B~0.base_72, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_7|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_7|, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_7|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_7|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_19|, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_7|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_#t~mem7#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 00:17:42,170 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [928] L61-4-->L64: Formula: (let ((.cse1 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|))) (and (= (let ((.cse0 (* |v_thread2Thread1of1ForFork0_~i~1#1_23| 4))) (+ (select (select |v_#memory_int_154| v_~B~0.base_72) (+ v_~B~0.offset_72 .cse0)) (select (select |v_#memory_int_154| v_~A~0.base_74) (+ v_~A~0.offset_74 .cse0)))) |v_thread2Thread1of1ForFork0_plus_#in~b#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| |v_thread2Thread1of1ForFork0_plus_~a#1_7|) (= .cse1 |v_thread2Thread1of1ForFork0_plus_#res#1_7|) (< |v_thread2Thread1of1ForFork0_~i~1#1_23| v_~M~0_47) (= |v_thread2Thread1of1ForFork0_plus_#res#1_7| |v_thread2Thread1of1ForFork0_~tmp~1#1_19|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_7| 0) (<= .cse1 2147483647)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| v_~res2~0_81))) InVars {~A~0.base=v_~A~0.base_74, ~B~0.base=v_~B~0.base_72, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} OutVars{~A~0.base=v_~A~0.base_74, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_7|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_7|, ~B~0.base=v_~B~0.base_72, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_7|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_7|, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_7|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_7|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_19|, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_7|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_#t~mem7#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 00:17:42,697 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [928] L61-4-->L64: Formula: (let ((.cse1 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|))) (and (= (let ((.cse0 (* |v_thread2Thread1of1ForFork0_~i~1#1_23| 4))) (+ (select (select |v_#memory_int_154| v_~B~0.base_72) (+ v_~B~0.offset_72 .cse0)) (select (select |v_#memory_int_154| v_~A~0.base_74) (+ v_~A~0.offset_74 .cse0)))) |v_thread2Thread1of1ForFork0_plus_#in~b#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| |v_thread2Thread1of1ForFork0_plus_~a#1_7|) (= .cse1 |v_thread2Thread1of1ForFork0_plus_#res#1_7|) (< |v_thread2Thread1of1ForFork0_~i~1#1_23| v_~M~0_47) (= |v_thread2Thread1of1ForFork0_plus_#res#1_7| |v_thread2Thread1of1ForFork0_~tmp~1#1_19|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_7| 0) (<= .cse1 2147483647)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| v_~res2~0_81))) InVars {~A~0.base=v_~A~0.base_74, ~B~0.base=v_~B~0.base_72, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} OutVars{~A~0.base=v_~A~0.base_74, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_7|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_7|, ~B~0.base=v_~B~0.base_72, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_7|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_7|, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_7|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_7|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_19|, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_7|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_#t~mem7#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 00:17:43,028 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [928] L61-4-->L64: Formula: (let ((.cse1 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|))) (and (= (let ((.cse0 (* |v_thread2Thread1of1ForFork0_~i~1#1_23| 4))) (+ (select (select |v_#memory_int_154| v_~B~0.base_72) (+ v_~B~0.offset_72 .cse0)) (select (select |v_#memory_int_154| v_~A~0.base_74) (+ v_~A~0.offset_74 .cse0)))) |v_thread2Thread1of1ForFork0_plus_#in~b#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| |v_thread2Thread1of1ForFork0_plus_~a#1_7|) (= .cse1 |v_thread2Thread1of1ForFork0_plus_#res#1_7|) (< |v_thread2Thread1of1ForFork0_~i~1#1_23| v_~M~0_47) (= |v_thread2Thread1of1ForFork0_plus_#res#1_7| |v_thread2Thread1of1ForFork0_~tmp~1#1_19|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_7| 0) (<= .cse1 2147483647)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (<= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483647) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| 2147483648)) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_7| |v_thread2Thread1of1ForFork0_plus_~b#1_7|) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_7| v_~res2~0_81))) InVars {~A~0.base=v_~A~0.base_74, ~B~0.base=v_~B~0.base_72, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} OutVars{~A~0.base=v_~A~0.base_74, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_7|, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_7|, ~B~0.base=v_~B~0.base_72, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_23|, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_7|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_7|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_7|, ~A~0.offset=v_~A~0.offset_74, ~M~0=v_~M~0_47, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_7|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_7|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_19|, #memory_int=|v_#memory_int_154|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_7|, ~B~0.offset=v_~B~0.offset_72, ~res2~0=v_~res2~0_81} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_plus_#in~a#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~mem8#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_#t~mem7#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 00:17:43,197 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1131] $Ultimate##0-->L61-4: Formula: (let ((.cse0 (select |v_#memory_int_691| v_~A~0.base_465)) (.cse2 (select |v_#memory_int_691| v_~B~0.base_453))) (let ((.cse4 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_115| |v_thread2Thread1of1ForFork0_plus_~b#1_115|)) (.cse3 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_241| |v_thread3Thread1of1ForFork1_plus_~b#1_241|)) (.cse5 (+ (select .cse0 v_~A~0.offset_467) (select .cse2 v_~B~0.offset_455))) (.cse6 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_223| |v_thread1Thread1of1ForFork2_plus_~b#1_223|))) (and (< |v_thread3Thread1of1ForFork1_~i~2#1_540| v_~N~0_429) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_115| |v_thread2Thread1of1ForFork0_plus_~a#1_115|) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_223| |v_thread1Thread1of1ForFork2_plus_~b#1_223|) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_223| 2147483648)) (= |v_thread2Thread1of1ForFork0_~tmp~1#1_146| v_~res2~0_581) (< 0 v_~M~0_315) (<= |v_thread2Thread1of1ForFork0_plus_#res#1_115| 2147483647) (= |v_thread1Thread1of1ForFork2_~i~0#1_282| 1) (= (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_540| 4))) (+ (select .cse0 (+ .cse1 v_~A~0.offset_467)) (select .cse2 (+ v_~B~0.offset_455 .cse1)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_241|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_241| .cse3) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_313| 2147483648)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_241| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_241|) (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_115| 0) (<= .cse4 2147483647)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_115|) (= |v_thread3Thread1of1ForFork1_plus_~b#1_241| |v_thread3Thread1of1ForFork1_plus_#in~b#1_241|) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_115| |v_thread2Thread1of1ForFork0_plus_~b#1_115|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_313| 2147483647) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_223| v_~res1~0_486) (= |v_thread3Thread1of1ForFork1_plus_#res#1_241| |v_thread3Thread1of1ForFork1_~tmp~2#1_313|) (= .cse4 |v_thread2Thread1of1ForFork0_plus_#res#1_115|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_241| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_241| 0) (<= .cse3 2147483647)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_241| 2147483648)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_223| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_223|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_115| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_115|) (= .cse5 |v_thread1Thread1of1ForFork2_plus_#in~b#1_223|) (= v_~M~0_315 |v_thread3Thread1of1ForFork1_~i~2#1_540|) (= |v_thread3Thread1of1ForFork1_plus_~a#1_241| |v_thread3Thread1of1ForFork1_plus_#in~a#1_241|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_223| |v_thread1Thread1of1ForFork2_plus_~a#1_223|) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_225| |v_thread1Thread1of1ForFork2_plus_#res#1_223|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_241| v_~res2~0_582) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_225| 2147483648)) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_115| 2147483648)) (= |v_thread2Thread1of1ForFork0_~i~1#1_308| 1) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_115| v_~res2~0_582) (= .cse5 |v_thread2Thread1of1ForFork0_plus_#in~b#1_115|) (<= |v_thread2Thread1of1ForFork0_plus_#in~b#1_115| 2147483647) (= |v_thread2Thread1of1ForFork0_~tmp~1#1_146| |v_thread2Thread1of1ForFork0_plus_#res#1_115|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_223| (ite (or (<= .cse6 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_223| 0)) 1 0)) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_241| 2147483647) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_225| v_~res1~0_485) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_225| 2147483647) (= .cse6 |v_thread1Thread1of1ForFork2_plus_#res#1_223|)))) InVars {~res1~0=v_~res1~0_486, ~A~0.base=v_~A~0.base_465, ~B~0.base=v_~B~0.base_453, ~A~0.offset=v_~A~0.offset_467, ~M~0=v_~M~0_315, #memory_int=|v_#memory_int_691|, ~N~0=v_~N~0_429, ~B~0.offset=v_~B~0.offset_455, ~res2~0=v_~res2~0_582} OutVars{~res1~0=v_~res1~0_485, ~A~0.base=v_~A~0.base_465, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_115|, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_223|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_241|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_308|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_540|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_223|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_115|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_241|, ~B~0.offset=v_~B~0.offset_455, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_61|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_241|, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_115|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_241|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_241|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_225|, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_115|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_115|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_241|, ~M~0=v_~M~0_315, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_241|, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_223|, ~B~0.base=v_~B~0.base_453, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_115|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_223|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_115|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_223|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_241|, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_115|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_115|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_313|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_115|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_146|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_223|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_241|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_223|, ~res2~0=v_~res2~0_581, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_223|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_241|, ~N~0=v_~N~0_429, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_223|, ~A~0.offset=v_~A~0.offset_467, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_282|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_223|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_223|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_241|, #memory_int=|v_#memory_int_691|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_115|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_223|} AuxVars[] AssignedVars[~res1~0, thread2Thread1of1ForFork0_#t~mem8#1, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_#t~ret14#1, thread1Thread1of1ForFork2_#t~post1#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork1_~tmp~2#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork0_~tmp~1#1, thread1Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork1_#t~mem12#1, thread1Thread1of1ForFork2_#t~mem3#1, thread2Thread1of1ForFork0_#t~post6#1, ~res2~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~tmp~0#1, thread3Thread1of1ForFork1_#t~mem13#1, thread1Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread3Thread1of1ForFork1_#t~ret15#1, thread2Thread1of1ForFork0_#t~mem7#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 00:17:43,197 WARN L322 ript$VariableManager]: TermVariable LBE534 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,197 WARN L322 ript$VariableManager]: TermVariable LBE479 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,197 WARN L322 ript$VariableManager]: TermVariable LBE523 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,197 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,197 WARN L322 ript$VariableManager]: TermVariable LBE137 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,197 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,197 WARN L322 ript$VariableManager]: TermVariable LBE444 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,197 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,198 WARN L322 ript$VariableManager]: TermVariable LBE520 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,198 WARN L322 ript$VariableManager]: TermVariable LBE541 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,198 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,198 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,198 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,198 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,198 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,198 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,198 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,198 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,198 WARN L322 ript$VariableManager]: TermVariable LBE118 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,198 WARN L322 ript$VariableManager]: TermVariable LBE535 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,198 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,198 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,199 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:43,199 WARN L322 ript$VariableManager]: TermVariable LBE192 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:44,616 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1131] $Ultimate##0-->L61-4: Formula: (let ((.cse0 (select |v_#memory_int_691| v_~A~0.base_465)) (.cse2 (select |v_#memory_int_691| v_~B~0.base_453))) (let ((.cse4 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_115| |v_thread2Thread1of1ForFork0_plus_~b#1_115|)) (.cse3 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_241| |v_thread3Thread1of1ForFork1_plus_~b#1_241|)) (.cse5 (+ (select .cse0 v_~A~0.offset_467) (select .cse2 v_~B~0.offset_455))) (.cse6 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_223| |v_thread1Thread1of1ForFork2_plus_~b#1_223|))) (and (< |v_thread3Thread1of1ForFork1_~i~2#1_540| v_~N~0_429) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_115| |v_thread2Thread1of1ForFork0_plus_~a#1_115|) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_223| |v_thread1Thread1of1ForFork2_plus_~b#1_223|) (<= 0 (+ |v_thread1Thread1of1ForFork2_plus_#in~b#1_223| 2147483648)) (= |v_thread2Thread1of1ForFork0_~tmp~1#1_146| v_~res2~0_581) (< 0 v_~M~0_315) (<= |v_thread2Thread1of1ForFork0_plus_#res#1_115| 2147483647) (= |v_thread1Thread1of1ForFork2_~i~0#1_282| 1) (= (let ((.cse1 (* |v_thread3Thread1of1ForFork1_~i~2#1_540| 4))) (+ (select .cse0 (+ .cse1 v_~A~0.offset_467)) (select .cse2 (+ v_~B~0.offset_455 .cse1)))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_241|) (= |v_thread3Thread1of1ForFork1_plus_#res#1_241| .cse3) (<= 0 (+ |v_thread3Thread1of1ForFork1_~tmp~2#1_313| 2147483648)) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_241| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_241|) (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_115| 0) (<= .cse4 2147483647)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_115|) (= |v_thread3Thread1of1ForFork1_plus_~b#1_241| |v_thread3Thread1of1ForFork1_plus_#in~b#1_241|) (= |v_thread2Thread1of1ForFork0_plus_#in~b#1_115| |v_thread2Thread1of1ForFork0_plus_~b#1_115|) (<= |v_thread3Thread1of1ForFork1_~tmp~2#1_313| 2147483647) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_223| v_~res1~0_486) (= |v_thread3Thread1of1ForFork1_plus_#res#1_241| |v_thread3Thread1of1ForFork1_~tmp~2#1_313|) (= .cse4 |v_thread2Thread1of1ForFork0_plus_#res#1_115|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_241| (ite (or (<= |v_thread3Thread1of1ForFork1_plus_~b#1_241| 0) (<= .cse3 2147483647)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#in~b#1_241| 2147483648)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_223| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_223|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_115| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_115|) (= .cse5 |v_thread1Thread1of1ForFork2_plus_#in~b#1_223|) (= v_~M~0_315 |v_thread3Thread1of1ForFork1_~i~2#1_540|) (= |v_thread3Thread1of1ForFork1_plus_~a#1_241| |v_thread3Thread1of1ForFork1_plus_#in~a#1_241|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_223| |v_thread1Thread1of1ForFork2_plus_~a#1_223|) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_225| |v_thread1Thread1of1ForFork2_plus_#res#1_223|) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_241| v_~res2~0_582) (<= 0 (+ |v_thread1Thread1of1ForFork2_~tmp~0#1_225| 2147483648)) (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_115| 2147483648)) (= |v_thread2Thread1of1ForFork0_~i~1#1_308| 1) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_115| v_~res2~0_582) (= .cse5 |v_thread2Thread1of1ForFork0_plus_#in~b#1_115|) (<= |v_thread2Thread1of1ForFork0_plus_#in~b#1_115| 2147483647) (= |v_thread2Thread1of1ForFork0_~tmp~1#1_146| |v_thread2Thread1of1ForFork0_plus_#res#1_115|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_223| (ite (or (<= .cse6 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_223| 0)) 1 0)) (<= |v_thread3Thread1of1ForFork1_plus_#in~b#1_241| 2147483647) (= |v_thread1Thread1of1ForFork2_~tmp~0#1_225| v_~res1~0_485) (<= |v_thread1Thread1of1ForFork2_~tmp~0#1_225| 2147483647) (= .cse6 |v_thread1Thread1of1ForFork2_plus_#res#1_223|)))) InVars {~res1~0=v_~res1~0_486, ~A~0.base=v_~A~0.base_465, ~B~0.base=v_~B~0.base_453, ~A~0.offset=v_~A~0.offset_467, ~M~0=v_~M~0_315, #memory_int=|v_#memory_int_691|, ~N~0=v_~N~0_429, ~B~0.offset=v_~B~0.offset_455, ~res2~0=v_~res2~0_582} OutVars{~res1~0=v_~res1~0_485, ~A~0.base=v_~A~0.base_465, thread2Thread1of1ForFork0_#t~mem8#1=|v_thread2Thread1of1ForFork0_#t~mem8#1_115|, thread1Thread1of1ForFork2_#t~ret4#1=|v_thread1Thread1of1ForFork2_#t~ret4#1_223|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_241|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_308|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_540|, thread1Thread1of1ForFork2_#t~post1#1=|v_thread1Thread1of1ForFork2_#t~post1#1_223|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_115|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_241|, ~B~0.offset=v_~B~0.offset_455, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_61|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_241|, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_115|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_241|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_241|, thread1Thread1of1ForFork2_~tmp~0#1=|v_thread1Thread1of1ForFork2_~tmp~0#1_225|, thread2Thread1of1ForFork0_#t~ret10#1=|v_thread2Thread1of1ForFork0_#t~ret10#1_115|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_115|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_241|, ~M~0=v_~M~0_315, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_241|, thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_223|, ~B~0.base=v_~B~0.base_453, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_115|, thread1Thread1of1ForFork2_#t~mem2#1=|v_thread1Thread1of1ForFork2_#t~mem2#1_223|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_115|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_223|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_241|, thread2Thread1of1ForFork0_#t~ret9#1=|v_thread2Thread1of1ForFork0_#t~ret9#1_115|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_115|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_313|, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_115|, thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_146|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_223|, thread3Thread1of1ForFork1_#t~mem12#1=|v_thread3Thread1of1ForFork1_#t~mem12#1_241|, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_223|, ~res2~0=v_~res2~0_581, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_223|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_241|, ~N~0=v_~N~0_429, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_223|, ~A~0.offset=v_~A~0.offset_467, thread1Thread1of1ForFork2_~i~0#1=|v_thread1Thread1of1ForFork2_~i~0#1_282|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_223|, thread1Thread1of1ForFork2_#t~ret5#1=|v_thread1Thread1of1ForFork2_#t~ret5#1_223|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_241|, #memory_int=|v_#memory_int_691|, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_115|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_223|} AuxVars[] AssignedVars[~res1~0, thread2Thread1of1ForFork0_#t~mem8#1, thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork0_~i~1#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork1_~i~2#1, thread3Thread1of1ForFork1_#t~ret14#1, thread1Thread1of1ForFork2_#t~post1#1, thread2Thread1of1ForFork0_#t~ret9#1, thread2Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork1_~tmp~2#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork0_~tmp~1#1, thread1Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork1_#t~mem12#1, thread1Thread1of1ForFork2_#t~mem3#1, thread2Thread1of1ForFork0_#t~post6#1, ~res2~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~tmp~0#1, thread3Thread1of1ForFork1_#t~mem13#1, thread1Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork0_#t~ret10#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork2_~i~0#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ret5#1, thread3Thread1of1ForFork1_#t~ret15#1, thread2Thread1of1ForFork0_#t~mem7#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 00:17:45,226 WARN L322 ript$VariableManager]: TermVariable LBE534 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,226 WARN L322 ript$VariableManager]: TermVariable LBE479 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,226 WARN L322 ript$VariableManager]: TermVariable LBE523 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,226 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,226 WARN L322 ript$VariableManager]: TermVariable LBE137 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,227 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,227 WARN L322 ript$VariableManager]: TermVariable LBE444 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,227 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,227 WARN L322 ript$VariableManager]: TermVariable LBE520 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,227 WARN L322 ript$VariableManager]: TermVariable LBE541 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,227 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,227 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,227 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,227 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,227 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,227 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,227 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,227 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,227 WARN L322 ript$VariableManager]: TermVariable LBE118 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,228 WARN L322 ript$VariableManager]: TermVariable LBE535 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,228 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,228 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,228 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:45,228 WARN L322 ript$VariableManager]: TermVariable LBE192 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,705 WARN L322 ript$VariableManager]: TermVariable LBE534 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,705 WARN L322 ript$VariableManager]: TermVariable LBE479 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,705 WARN L322 ript$VariableManager]: TermVariable LBE523 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,705 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,705 WARN L322 ript$VariableManager]: TermVariable LBE137 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,705 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,705 WARN L322 ript$VariableManager]: TermVariable LBE444 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,705 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,705 WARN L322 ript$VariableManager]: TermVariable LBE520 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,705 WARN L322 ript$VariableManager]: TermVariable LBE541 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,706 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,706 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,706 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,706 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,706 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,706 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,706 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,706 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,706 WARN L322 ript$VariableManager]: TermVariable LBE118 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,706 WARN L322 ript$VariableManager]: TermVariable LBE535 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,706 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,706 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,706 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:46,706 WARN L322 ript$VariableManager]: TermVariable LBE192 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,180 WARN L322 ript$VariableManager]: TermVariable LBE534 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,180 WARN L322 ript$VariableManager]: TermVariable LBE479 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,180 WARN L322 ript$VariableManager]: TermVariable LBE523 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,181 WARN L322 ript$VariableManager]: TermVariable LBE511 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,181 WARN L322 ript$VariableManager]: TermVariable LBE137 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,181 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,181 WARN L322 ript$VariableManager]: TermVariable LBE444 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,181 WARN L322 ript$VariableManager]: TermVariable LBE147 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,181 WARN L322 ript$VariableManager]: TermVariable LBE520 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,181 WARN L322 ript$VariableManager]: TermVariable LBE541 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,181 WARN L322 ript$VariableManager]: TermVariable LBE221 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,181 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,181 WARN L322 ript$VariableManager]: TermVariable LBE24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,181 WARN L322 ript$VariableManager]: TermVariable LBE517 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,181 WARN L322 ript$VariableManager]: TermVariable LBE34 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,181 WARN L322 ript$VariableManager]: TermVariable LBE537 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,182 WARN L322 ript$VariableManager]: TermVariable LBE108 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,182 WARN L322 ript$VariableManager]: TermVariable LBE536 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,182 WARN L322 ript$VariableManager]: TermVariable LBE118 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,182 WARN L322 ript$VariableManager]: TermVariable LBE535 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,182 WARN L322 ript$VariableManager]: TermVariable LBE447 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,182 WARN L322 ript$VariableManager]: TermVariable LBE53 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,182 WARN L322 ript$VariableManager]: TermVariable LBE63 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:48,182 WARN L322 ript$VariableManager]: TermVariable LBE192 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:17:49,645 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:17:49,646 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8394 [2022-12-06 00:17:49,646 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 650 transitions, 18042 flow [2022-12-06 00:17:49,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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 00:17:49,646 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:17:49,646 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 00:17:49,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 00:17:49,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-06 00:17:49,867 INFO L420 AbstractCegarLoop]: === Iteration 36 === 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 00:17:49,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:17:49,868 INFO L85 PathProgramCache]: Analyzing trace with hash 898886931, now seen corresponding path program 1 times [2022-12-06 00:17:49,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:17:49,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036212018] [2022-12-06 00:17:49,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:49,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:17:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:49,937 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 00:17:49,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:17:49,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036212018] [2022-12-06 00:17:49,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036212018] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:17:49,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256078936] [2022-12-06 00:17:49,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:49,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:17:49,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:17:49,939 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:17:49,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 00:17:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:17:50,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:17:50,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:17:50,146 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 00:17:50,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:17:50,184 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 00:17:50,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256078936] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:17:50,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:17:50,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-06 00:17:50,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673895277] [2022-12-06 00:17:50,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:17:50,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 00:17:50,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:17:50,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 00:17:50,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-12-06 00:17:50,186 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 92 [2022-12-06 00:17:50,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 650 transitions, 18042 flow. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 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 00:17:50,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:17:50,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 92 [2022-12-06 00:17:50,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:17:53,262 INFO L130 PetriNetUnfolder]: 7297/10993 cut-off events. [2022-12-06 00:17:53,263 INFO L131 PetriNetUnfolder]: For 423881/423881 co-relation queries the response was YES. [2022-12-06 00:17:53,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131133 conditions, 10993 events. 7297/10993 cut-off events. For 423881/423881 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 65113 event pairs, 479 based on Foata normal form. 36/11025 useless extension candidates. Maximal degree in co-relation 130583. Up to 4474 conditions per place. [2022-12-06 00:17:53,395 INFO L137 encePairwiseOnDemand]: 28/92 looper letters, 518 selfloop transitions, 532 changer transitions 1/1051 dead transitions. [2022-12-06 00:17:53,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 1051 transitions, 28894 flow [2022-12-06 00:17:53,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-06 00:17:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-06 00:17:53,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 278 transitions. [2022-12-06 00:17:53,401 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15108695652173912 [2022-12-06 00:17:53,401 INFO L175 Difference]: Start difference. First operand has 210 places, 650 transitions, 18042 flow. Second operand 20 states and 278 transitions. [2022-12-06 00:17:53,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 1051 transitions, 28894 flow [2022-12-06 00:17:55,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 1051 transitions, 28058 flow, removed 323 selfloop flow, removed 9 redundant places. [2022-12-06 00:17:55,047 INFO L231 Difference]: Finished difference. Result has 227 places, 787 transitions, 23163 flow [2022-12-06 00:17:55,048 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=17258, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=400, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=23163, PETRI_PLACES=227, PETRI_TRANSITIONS=787} [2022-12-06 00:17:55,048 INFO L294 CegarLoopForPetriNet]: 33 programPoint places, 194 predicate places. [2022-12-06 00:17:55,048 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:17:55,048 INFO L89 Accepts]: Start accepts. Operand has 227 places, 787 transitions, 23163 flow [2022-12-06 00:17:55,051 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:17:55,051 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:17:55,053 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 787 transitions, 23163 flow [2022-12-06 00:17:55,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 227 places, 787 transitions, 23163 flow [2022-12-06 00:17:55,766 INFO L130 PetriNetUnfolder]: 1881/3860 cut-off events. [2022-12-06 00:17:55,766 INFO L131 PetriNetUnfolder]: For 115065/115543 co-relation queries the response was YES. [2022-12-06 00:17:55,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45611 conditions, 3860 events. 1881/3860 cut-off events. For 115065/115543 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 29486 event pairs, 132 based on Foata normal form. 75/3819 useless extension candidates. Maximal degree in co-relation 45304. Up to 1574 conditions per place. [2022-12-06 00:17:55,836 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 227 places, 787 transitions, 23163 flow [2022-12-06 00:17:55,837 INFO L188 LiptonReduction]: Number of co-enabled transitions 3234 [2022-12-06 00:17:55,843 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 00:17:56,115 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 00:17:56,154 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 00:17:56,352 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 00:17:56,562 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 00:17:56,769 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 00:17:56,967 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 00:17:57,006 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 00:17:57,166 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 00:17:58,736 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:17:58,736 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3688 [2022-12-06 00:17:58,736 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 787 transitions, 23484 flow [2022-12-06 00:17:58,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 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 00:17:58,737 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:17:58,737 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 00:17:58,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-06 00:17:58,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-06 00:17:58,943 INFO L420 AbstractCegarLoop]: === Iteration 37 === 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 00:17:58,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:17:58,943 INFO L85 PathProgramCache]: Analyzing trace with hash 747341004, now seen corresponding path program 1 times [2022-12-06 00:17:58,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:17:58,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164855781] [2022-12-06 00:17:58,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:17:58,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:17:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 00:17:58,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 00:17:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 00:17:59,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 00:17:59,017 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 00:17:59,017 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 00:17:59,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 00:17:59,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 00:17:59,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 00:17:59,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-06 00:17:59,020 INFO L458 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:17:59,031 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 00:17:59,031 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 00:17:59,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 12:17:59 BasicIcfg [2022-12-06 00:17:59,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 00:17:59,172 INFO L158 Benchmark]: Toolchain (without parser) took 246387.19ms. Allocated memory was 169.9MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 146.4MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-06 00:17:59,172 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 169.9MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:17:59,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.16ms. Allocated memory is still 169.9MB. Free memory was 146.4MB in the beginning and 132.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 00:17:59,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.65ms. Allocated memory is still 169.9MB. Free memory was 132.7MB in the beginning and 130.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:17:59,173 INFO L158 Benchmark]: Boogie Preprocessor took 30.94ms. Allocated memory is still 169.9MB. Free memory was 130.1MB in the beginning and 128.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:17:59,173 INFO L158 Benchmark]: RCFGBuilder took 826.02ms. Allocated memory was 169.9MB in the beginning and 211.8MB in the end (delta: 41.9MB). Free memory was 128.0MB in the beginning and 180.8MB in the end (delta: -52.7MB). Peak memory consumption was 55.3MB. Max. memory is 8.0GB. [2022-12-06 00:17:59,191 INFO L158 Benchmark]: TraceAbstraction took 245295.33ms. Allocated memory was 211.8MB in the beginning and 5.3GB in the end (delta: 5.0GB). Free memory was 180.2MB in the beginning and 3.4GB in the end (delta: -3.2GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-06 00:17:59,193 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 169.9MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.16ms. Allocated memory is still 169.9MB. Free memory was 146.4MB in the beginning and 132.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.65ms. Allocated memory is still 169.9MB. Free memory was 132.7MB in the beginning and 130.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.94ms. Allocated memory is still 169.9MB. Free memory was 130.1MB in the beginning and 128.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 826.02ms. Allocated memory was 169.9MB in the beginning and 211.8MB in the end (delta: 41.9MB). Free memory was 128.0MB in the beginning and 180.8MB in the end (delta: -52.7MB). Peak memory consumption was 55.3MB. Max. memory is 8.0GB. * TraceAbstraction took 245295.33ms. Allocated memory was 211.8MB in the beginning and 5.3GB in the end (delta: 5.0GB). Free memory was 180.2MB in the beginning and 3.4GB in the end (delta: -3.2GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 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: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 2, 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.6s, 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: 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: 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: 3.9s, 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: 1.6s, 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: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 27, 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.2s, 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.2s, 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.5s, 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: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 33, dependent conditional: 33, 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.5s, 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: 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: 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.2s, 119 PlacesBefore, 119 PlacesAfterwards, 160 TransitionsBefore, 160 TransitionsAfterwards, 1002 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): 132, Positive cache size: 110, Positive conditional cache size: 77, 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.0s, 129 PlacesBefore, 129 PlacesAfterwards, 167 TransitionsBefore, 167 TransitionsAfterwards, 1020 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): 132, Positive cache size: 110, Positive conditional cache size: 77, 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.5s, 136 PlacesBefore, 136 PlacesAfterwards, 175 TransitionsBefore, 175 TransitionsAfterwards, 1078 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 8, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 8, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 20, independent: 16, independent conditional: 7, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 128, Positive conditional cache size: 81, Positive unconditional cache size: 47, 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: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 136 PlacesBefore, 131 PlacesAfterwards, 151 TransitionsBefore, 149 TransitionsAfterwards, 946 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 129, Positive conditional cache size: 82, Positive unconditional cache size: 47, 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: 3.6s, 126 PlacesBefore, 126 PlacesAfterwards, 149 TransitionsBefore, 148 TransitionsAfterwards, 950 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): 151, Positive cache size: 129, Positive conditional cache size: 82, Positive unconditional cache size: 47, 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, 111 PlacesBefore, 111 PlacesAfterwards, 193 TransitionsBefore, 193 TransitionsAfterwards, 1048 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 2, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 137, Positive conditional cache size: 84, Positive unconditional cache size: 53, 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, 100 PlacesBefore, 100 PlacesAfterwards, 192 TransitionsBefore, 192 TransitionsAfterwards, 1046 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): 159, Positive cache size: 137, Positive conditional cache size: 84, Positive unconditional cache size: 53, 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: 5.6s, 145 PlacesBefore, 140 PlacesAfterwards, 438 TransitionsBefore, 433 TransitionsAfterwards, 1598 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 157, Positive conditional cache size: 96, Positive unconditional cache size: 61, 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: 21.3s, 189 PlacesBefore, 180 PlacesAfterwards, 530 TransitionsBefore, 521 TransitionsAfterwards, 1996 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 0 ChoiceCompositions, 18 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 56, independent conditional: 56, 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: 56, independent: 56, independent conditional: 56, 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: 56, independent: 56, independent conditional: 56, 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: 56, independent: 56, independent conditional: 56, 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: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 56, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 186, Positive conditional cache size: 110, Positive unconditional cache size: 76, 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, 176 PlacesBefore, 176 PlacesAfterwards, 504 TransitionsBefore, 504 TransitionsAfterwards, 1906 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): 208, Positive cache size: 186, Positive conditional cache size: 110, Positive unconditional cache size: 76, 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, 177 PlacesBefore, 177 PlacesAfterwards, 506 TransitionsBefore, 506 TransitionsAfterwards, 1946 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): 208, Positive cache size: 186, Positive conditional cache size: 110, Positive unconditional cache size: 76, 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: 4.9s, 190 PlacesBefore, 188 PlacesAfterwards, 529 TransitionsBefore, 527 TransitionsAfterwards, 2014 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 188, Positive conditional cache size: 112, Positive unconditional cache size: 76, 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: 7.6s, 213 PlacesBefore, 210 PlacesAfterwards, 653 TransitionsBefore, 650 TransitionsAfterwards, 2358 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 6, independent conditional: 6, 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): 219, Positive cache size: 197, Positive conditional cache size: 119, Positive unconditional cache size: 78, 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: 2.9s, 227 PlacesBefore, 227 PlacesAfterwards, 787 TransitionsBefore, 787 TransitionsAfterwards, 3234 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, independent: 71, independent conditional: 71, 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: 71, independent: 71, independent conditional: 23, independent unconditional: 48, 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: 71, independent: 71, independent conditional: 23, independent unconditional: 48, 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: 71, independent: 71, independent conditional: 23, independent unconditional: 48, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, independent: 69, independent conditional: 21, independent unconditional: 48, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 200, Positive conditional cache size: 122, Positive unconditional cache size: 78, 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 - CounterExampleResult [Line: 106]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L40] 0 int* A; [L41] 0 int* B; [L42] 0 int res1, res2, M, N; [L87] 0 pthread_t t1, t2, t3; [L90] 0 M = __VERIFIER_nondet_int() [L91] 0 N = __VERIFIER_nondet_int() [L92] CALL, EXPR 0 create_fresh_int_array(N) [L112] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) [L112] RET 0 assume_abort_if_not(size >= 0) [L113] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) [L113] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L115] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L116] 0 int i = 0; [L116] COND TRUE 0 i < size [L117] 0 arr[i] = __VERIFIER_nondet_int() [L116] 0 i++ [L116] COND TRUE 0 i < size [L117] 0 arr[i] = __VERIFIER_nondet_int() [L116] 0 i++ [L116] COND FALSE 0 !(i < size) [L119] 0 return arr; [L92] RET, EXPR 0 create_fresh_int_array(N) [L92] 0 A = create_fresh_int_array(N) [L93] CALL, EXPR 0 create_fresh_int_array(N) [L112] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) [L112] RET 0 assume_abort_if_not(size >= 0) [L113] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) [L113] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L115] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L116] 0 int i = 0; [L116] COND TRUE 0 i < size [L117] 0 arr[i] = __VERIFIER_nondet_int() [L116] 0 i++ [L116] COND TRUE 0 i < size [L117] 0 arr[i] = __VERIFIER_nondet_int() [L116] 0 i++ [L116] COND FALSE 0 !(i < size) [L119] 0 return arr; [L93] RET, EXPR 0 create_fresh_int_array(N) [L93] 0 B = create_fresh_int_array(N) [L95] CALL 0 assume_abort_if_not(M >= 0 && M < N) [L37] COND FALSE 0 !(!cond) [L95] RET 0 assume_abort_if_not(M >= 0 && M < N) [L98] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-3:0}, B={3:0}, M=1, N=2, pthread_create(&t1, 0, thread1, 0)=-2, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L99] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-3:0}, B={3:0}, M=1, N=2, pthread_create(&t2, 0, thread2, 0)=-1, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L100] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [A={-3:0}, B={3:0}, M=1, N=2, pthread_create(&t3, 0, thread3, 0)=0, res1=0, res2=0, t1={6:0}, t2={7:0}, t3={5:0}] [L74] 3 int i=M; [L61] 3 int i=0; [L61] COND TRUE 3 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 3 !(!cond) [L123] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 3 !(!cond) [L124] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 3 return a + b; [L63] RET, EXPR 3 plus(A[i], B[i]) [L63] CALL, EXPR 3 plus(res2, plus(A[i], B[i])) [L123] CALL 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 3 !(!cond) [L123] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 3 !(!cond) [L124] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 3 return a + b; [L63] RET, EXPR 3 plus(res2, plus(A[i], B[i])) [L63] 3 int tmp = plus(res2, plus(A[i], B[i])); [L48] 3 int i=0; [L48] COND TRUE 3 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 3 !(!cond) [L123] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 3 !(!cond) [L124] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 3 return a + b; [L50] RET, EXPR 3 plus(A[i], B[i]) [L50] CALL, EXPR 3 plus(res1, plus(A[i], B[i])) [L123] CALL 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 3 !(!cond) [L123] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 3 !(!cond) [L124] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 3 return a + b; [L50] RET, EXPR 3 plus(res1, plus(A[i], B[i])) [L50] 3 int tmp = plus(res1, plus(A[i], B[i])); [L53] 3 res1 = tmp [L48] 3 i++ [L74] COND TRUE 3 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 3 !(!cond) [L123] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 3 !(!cond) [L124] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 3 return a + b; [L76] RET, EXPR 3 plus(A[i], B[i]) [L76] CALL, EXPR 3 plus(res2, plus(A[i], B[i])) [L123] CALL 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 3 !(!cond) [L123] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 3 !(!cond) [L124] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 3 return a + b; [L76] RET, EXPR 3 plus(res2, plus(A[i], B[i])) [L76] 3 int tmp = plus(res2, plus(A[i], B[i])); [L66] 3 res2 = tmp [L61] 3 i++ [L79] 3 res2 = tmp [L74] 3 i++ VAL [A={-3:0}, B={3:0}, i=2, M=1, N=2, res1=2147483646, res2=1, tmp=1] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L123] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L124] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 1 return a + b; [L50] RET, EXPR 1 plus(A[i], B[i]) [L50] CALL, EXPR 1 plus(res1, plus(A[i], B[i])) [L123] CALL 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L37] COND FALSE 1 !(!cond) [L123] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L124] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L37] COND FALSE 1 !(!cond) [L124] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L125] 1 return a + b; [L50] RET, EXPR 1 plus(res1, plus(A[i], B[i])) [L50] 1 int tmp = plus(res1, plus(A[i], B[i])); [L53] 1 res1 = tmp [L48] 1 i++ VAL [A={-3:0}, B={3:0}, i=2, M=1, N=2, res1=2147483647, res2=1, tmp=2147483647] [L48] COND FALSE 1 !(i