/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:36:12,117 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:36:12,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:36:12,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:36:12,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:36:12,169 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:36:12,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:36:12,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:36:12,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:36:12,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:36:12,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:36:12,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:36:12,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:36:12,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:36:12,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:36:12,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:36:12,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:36:12,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:36:12,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:36:12,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:36:12,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:36:12,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:36:12,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:36:12,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:36:12,193 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:36:12,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:36:12,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:36:12,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:36:12,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:36:12,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:36:12,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:36:12,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:36:12,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:36:12,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:36:12,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:36:12,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:36:12,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:36:12,197 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:36:12,197 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:36:12,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:36:12,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:36:12,200 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:36:12,239 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:36:12,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:36:12,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:36:12,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:36:12,240 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:36:12,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:36:12,241 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:36:12,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:36:12,241 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:36:12,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:36:12,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:36:12,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:36:12,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:36:12,242 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:36:12,242 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:36:12,243 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:36:12,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:36:12,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:36:12,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:36:12,243 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:36:12,243 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:36:12,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:36:12,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:36:12,243 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:36:12,244 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:36:12,244 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:36:12,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:36:12,244 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:36:12,244 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:36:12,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:36:12,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:36:12,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:36:12,521 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:36:12,521 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:36:12,522 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2022-12-06 07:36:13,399 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:36:13,583 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:36:13,584 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2022-12-06 07:36:13,590 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21b1faaaf/2f188e8d1064432693faf68c6b13ddb1/FLAG0ae4369fe [2022-12-06 07:36:13,598 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21b1faaaf/2f188e8d1064432693faf68c6b13ddb1 [2022-12-06 07:36:13,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:36:13,600 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:36:13,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:36:13,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:36:13,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:36:13,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:36:13" (1/1) ... [2022-12-06 07:36:13,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dd3b51e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:36:13, skipping insertion in model container [2022-12-06 07:36:13,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:36:13" (1/1) ... [2022-12-06 07:36:13,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:36:13,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:36:13,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:36:13,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:36:13,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:36:13,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:36:13,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:36:13,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:36:13,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:36:13,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:36:13,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:36:13,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:36:13,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:36:13,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:36:13,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:36:13,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:36:13,736 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-bad-threaded-sum-2.wvr.c[2476,2489] [2022-12-06 07:36:13,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:36:13,750 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:36:13,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:36:13,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:36:13,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:36:13,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:36:13,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:36:13,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:36:13,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:36:13,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:36:13,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:36:13,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:36:13,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:36:13,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:36:13,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:36:13,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:36:13,784 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-bad-threaded-sum-2.wvr.c[2476,2489] [2022-12-06 07:36:13,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:36:13,794 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:36:13,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:36:13 WrapperNode [2022-12-06 07:36:13,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:36:13,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:36:13,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:36:13,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:36:13,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:36:13" (1/1) ... [2022-12-06 07:36:13,812 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:36:13" (1/1) ... [2022-12-06 07:36:13,829 INFO L138 Inliner]: procedures = 21, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2022-12-06 07:36:13,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:36:13,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:36:13,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:36:13,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:36:13,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:36:13" (1/1) ... [2022-12-06 07:36:13,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:36:13" (1/1) ... [2022-12-06 07:36:13,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:36:13" (1/1) ... [2022-12-06 07:36:13,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:36:13" (1/1) ... [2022-12-06 07:36:13,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:36:13" (1/1) ... [2022-12-06 07:36:13,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:36:13" (1/1) ... [2022-12-06 07:36:13,858 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:36:13" (1/1) ... [2022-12-06 07:36:13,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:36:13" (1/1) ... [2022-12-06 07:36:13,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:36:13,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:36:13,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:36:13,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:36:13,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:36:13" (1/1) ... [2022-12-06 07:36:13,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:36:13,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:36:13,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:36:13,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 07:36:13,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:36:13,933 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:36:13,934 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:36:13,934 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:36:13,934 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:36:13,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:36:13,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:36:13,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:36:13,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:36:13,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:36:13,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:36:13,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:36:13,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:36:13,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:36:13,935 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:36:14,017 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:36:14,018 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:36:14,214 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:36:14,246 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:36:14,247 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 07:36:14,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:36:14 BoogieIcfgContainer [2022-12-06 07:36:14,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:36:14,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:36:14,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:36:14,252 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:36:14,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:36:13" (1/3) ... [2022-12-06 07:36:14,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72eb1cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:36:14, skipping insertion in model container [2022-12-06 07:36:14,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:36:13" (2/3) ... [2022-12-06 07:36:14,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72eb1cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:36:14, skipping insertion in model container [2022-12-06 07:36:14,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:36:14" (3/3) ... [2022-12-06 07:36:14,253 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-threaded-sum-2.wvr.c [2022-12-06 07:36:14,265 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:36:14,265 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:36:14,265 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:36:14,305 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:36:14,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 81 transitions, 178 flow [2022-12-06 07:36:14,366 INFO L130 PetriNetUnfolder]: 6/79 cut-off events. [2022-12-06 07:36:14,366 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:36:14,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 79 events. 6/79 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2022-12-06 07:36:14,369 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 81 transitions, 178 flow [2022-12-06 07:36:14,381 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 71 transitions, 154 flow [2022-12-06 07:36:14,382 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:14,395 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 71 transitions, 154 flow [2022-12-06 07:36:14,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 71 transitions, 154 flow [2022-12-06 07:36:14,416 INFO L130 PetriNetUnfolder]: 6/71 cut-off events. [2022-12-06 07:36:14,416 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:36:14,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 71 events. 6/71 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2022-12-06 07:36:14,418 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 71 transitions, 154 flow [2022-12-06 07:36:14,418 INFO L188 LiptonReduction]: Number of co-enabled transitions 396 [2022-12-06 07:36:16,480 INFO L203 LiptonReduction]: Total number of compositions: 54 [2022-12-06 07:36:16,491 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:36:16,495 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;@10aa14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:36:16,495 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 07:36:16,499 INFO L130 PetriNetUnfolder]: 2/16 cut-off events. [2022-12-06 07:36:16,499 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:36:16,499 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:16,499 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:16,500 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:16,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:16,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1895754169, now seen corresponding path program 1 times [2022-12-06 07:36:16,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:16,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085842922] [2022-12-06 07:36:16,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:16,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:16,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:16,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:16,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085842922] [2022-12-06 07:36:16,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085842922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:16,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:16,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:36:16,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038585197] [2022-12-06 07:36:16,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:16,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:16,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:16,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:16,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:16,920 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 07:36:16,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:16,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:16,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 07:36:16,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:17,008 INFO L130 PetriNetUnfolder]: 93/164 cut-off events. [2022-12-06 07:36:17,008 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-06 07:36:17,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 164 events. 93/164 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 435 event pairs, 9 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 280. Up to 85 conditions per place. [2022-12-06 07:36:17,012 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 30 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2022-12-06 07:36:17,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 33 transitions, 150 flow [2022-12-06 07:36:17,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:17,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:17,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-06 07:36:17,021 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 07:36:17,022 INFO L175 Difference]: Start difference. First operand has 22 places, 17 transitions, 46 flow. Second operand 4 states and 34 transitions. [2022-12-06 07:36:17,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 33 transitions, 150 flow [2022-12-06 07:36:17,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 33 transitions, 138 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 07:36:17,027 INFO L231 Difference]: Finished difference. Result has 22 places, 18 transitions, 52 flow [2022-12-06 07:36:17,029 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=52, PETRI_PLACES=22, PETRI_TRANSITIONS=18} [2022-12-06 07:36:17,032 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 0 predicate places. [2022-12-06 07:36:17,033 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:17,033 INFO L89 Accepts]: Start accepts. Operand has 22 places, 18 transitions, 52 flow [2022-12-06 07:36:17,035 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:17,036 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:17,038 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 18 transitions, 52 flow [2022-12-06 07:36:17,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 18 transitions, 52 flow [2022-12-06 07:36:17,049 INFO L130 PetriNetUnfolder]: 2/19 cut-off events. [2022-12-06 07:36:17,049 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:36:17,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 19 events. 2/19 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 20 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 15. Up to 4 conditions per place. [2022-12-06 07:36:17,050 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 18 transitions, 52 flow [2022-12-06 07:36:17,051 INFO L188 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-06 07:36:17,062 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:36:17,064 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 07:36:17,064 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 18 transitions, 52 flow [2022-12-06 07:36:17,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:17,064 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:17,064 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:17,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:36:17,067 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:17,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:17,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1814883146, now seen corresponding path program 1 times [2022-12-06 07:36:17,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:17,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439114558] [2022-12-06 07:36:17,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:17,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:36:17,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:17,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439114558] [2022-12-06 07:36:17,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439114558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:36:17,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:36:17,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:36:17,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370209503] [2022-12-06 07:36:17,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:36:17,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:36:17,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:17,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:36:17,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:36:17,256 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 07:36:17,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 18 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:17,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:17,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 07:36:17,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:17,325 INFO L130 PetriNetUnfolder]: 76/133 cut-off events. [2022-12-06 07:36:17,325 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-06 07:36:17,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 133 events. 76/133 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 311 event pairs, 10 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 101. Up to 81 conditions per place. [2022-12-06 07:36:17,328 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 25 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2022-12-06 07:36:17,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 29 transitions, 139 flow [2022-12-06 07:36:17,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:36:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:36:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-12-06 07:36:17,330 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2022-12-06 07:36:17,330 INFO L175 Difference]: Start difference. First operand has 22 places, 18 transitions, 52 flow. Second operand 4 states and 30 transitions. [2022-12-06 07:36:17,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 29 transitions, 139 flow [2022-12-06 07:36:17,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 29 transitions, 133 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:36:17,331 INFO L231 Difference]: Finished difference. Result has 25 places, 20 transitions, 71 flow [2022-12-06 07:36:17,331 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=71, PETRI_PLACES=25, PETRI_TRANSITIONS=20} [2022-12-06 07:36:17,332 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 3 predicate places. [2022-12-06 07:36:17,332 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:17,332 INFO L89 Accepts]: Start accepts. Operand has 25 places, 20 transitions, 71 flow [2022-12-06 07:36:17,333 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:17,333 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:17,333 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 20 transitions, 71 flow [2022-12-06 07:36:17,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 71 flow [2022-12-06 07:36:17,337 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-06 07:36:17,337 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:36:17,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 24 events. 4/24 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 24 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 30. Up to 7 conditions per place. [2022-12-06 07:36:17,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 71 flow [2022-12-06 07:36:17,340 INFO L188 LiptonReduction]: Number of co-enabled transitions 82 [2022-12-06 07:36:17,350 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:36:17,350 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 07:36:17,351 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 71 flow [2022-12-06 07:36:17,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:17,351 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:17,352 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:17,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:36:17,352 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:17,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:17,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1774834238, now seen corresponding path program 2 times [2022-12-06 07:36:17,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:17,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310925902] [2022-12-06 07:36:17,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:17,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:17,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:17,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310925902] [2022-12-06 07:36:17,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310925902] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:36:17,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830716023] [2022-12-06 07:36:17,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:36:17,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:36:17,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:36:17,490 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:36:17,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:36:17,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:36:17,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:36:17,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 07:36:17,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:36:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:17,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:36:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:17,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830716023] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:36:17,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:36:17,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 5] total 8 [2022-12-06 07:36:17,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647241234] [2022-12-06 07:36:17,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:36:17,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:36:17,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:17,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:36:17,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:36:17,767 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 07:36:17,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 71 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:17,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:17,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 07:36:17,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:17,911 INFO L130 PetriNetUnfolder]: 94/163 cut-off events. [2022-12-06 07:36:17,911 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-12-06 07:36:17,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 163 events. 94/163 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 409 event pairs, 11 based on Foata normal form. 6/169 useless extension candidates. Maximal degree in co-relation 145. Up to 46 conditions per place. [2022-12-06 07:36:17,914 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 32 selfloop transitions, 19 changer transitions 0/51 dead transitions. [2022-12-06 07:36:17,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 51 transitions, 255 flow [2022-12-06 07:36:17,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:36:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:36:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-12-06 07:36:17,917 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3058823529411765 [2022-12-06 07:36:17,917 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 71 flow. Second operand 10 states and 52 transitions. [2022-12-06 07:36:17,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 51 transitions, 255 flow [2022-12-06 07:36:17,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 51 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:36:17,919 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 189 flow [2022-12-06 07:36:17,919 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=189, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2022-12-06 07:36:17,920 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 15 predicate places. [2022-12-06 07:36:17,921 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:17,923 INFO L89 Accepts]: Start accepts. Operand has 37 places, 35 transitions, 189 flow [2022-12-06 07:36:17,925 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:17,925 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:17,925 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 35 transitions, 189 flow [2022-12-06 07:36:17,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 35 transitions, 189 flow [2022-12-06 07:36:17,929 INFO L130 PetriNetUnfolder]: 15/41 cut-off events. [2022-12-06 07:36:17,930 INFO L131 PetriNetUnfolder]: For 30/31 co-relation queries the response was YES. [2022-12-06 07:36:17,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 41 events. 15/41 cut-off events. For 30/31 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 98. Up to 12 conditions per place. [2022-12-06 07:36:17,930 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 35 transitions, 189 flow [2022-12-06 07:36:17,930 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 07:36:17,933 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [212] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork0_~cond~0_1 (ite (= (ite (or (< 0 (mod v_~s~0_1 4294967296)) (< 0 (mod v_~t~0_1 4294967296))) 1 0) 0) 0 1)) InVars {~s~0=v_~s~0_1, ~t~0=v_~t~0_1} OutVars{thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_1, ~s~0=v_~s~0_1, ~t~0=v_~t~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0] and [269] L66-->L72: Formula: (and (= v_~t~0_36 (+ v_~t~0_35 1)) (= (ite (= (ite (< 0 (mod v_~t~0_35 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_15)) InVars {~t~0=v_~t~0_36} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_7|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_15, ~t~0=v_~t~0_35} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~cond~1, ~t~0] [2022-12-06 07:36:17,954 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:36:17,955 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 07:36:17,955 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 194 flow [2022-12-06 07:36:17,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:17,956 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:17,956 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:17,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 07:36:18,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:36:18,166 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:18,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:18,166 INFO L85 PathProgramCache]: Analyzing trace with hash 384197232, now seen corresponding path program 3 times [2022-12-06 07:36:18,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:18,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995635350] [2022-12-06 07:36:18,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:18,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:18,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:18,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995635350] [2022-12-06 07:36:18,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995635350] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:36:18,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155142321] [2022-12-06 07:36:18,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 07:36:18,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:36:18,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:36:18,648 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:36:18,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:36:18,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 07:36:18,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:36:18,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-06 07:36:18,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:36:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:19,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:36:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:19,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155142321] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:36:19,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:36:19,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-06 07:36:19,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509288564] [2022-12-06 07:36:19,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:36:19,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 07:36:19,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:19,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 07:36:19,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-12-06 07:36:19,283 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 07:36:19,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 194 flow. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:19,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:19,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 07:36:19,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:36:22,504 INFO L130 PetriNetUnfolder]: 461/800 cut-off events. [2022-12-06 07:36:22,504 INFO L131 PetriNetUnfolder]: For 1073/1073 co-relation queries the response was YES. [2022-12-06 07:36:22,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2827 conditions, 800 events. 461/800 cut-off events. For 1073/1073 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3448 event pairs, 10 based on Foata normal form. 10/810 useless extension candidates. Maximal degree in co-relation 1078. Up to 193 conditions per place. [2022-12-06 07:36:22,509 INFO L137 encePairwiseOnDemand]: 7/18 looper letters, 114 selfloop transitions, 131 changer transitions 58/303 dead transitions. [2022-12-06 07:36:22,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 303 transitions, 2109 flow [2022-12-06 07:36:22,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-06 07:36:22,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-12-06 07:36:22,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 241 transitions. [2022-12-06 07:36:22,511 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29106280193236717 [2022-12-06 07:36:22,511 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 194 flow. Second operand 46 states and 241 transitions. [2022-12-06 07:36:22,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 303 transitions, 2109 flow [2022-12-06 07:36:22,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 303 transitions, 2030 flow, removed 29 selfloop flow, removed 3 redundant places. [2022-12-06 07:36:22,519 INFO L231 Difference]: Finished difference. Result has 108 places, 165 transitions, 1455 flow [2022-12-06 07:36:22,519 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=1455, PETRI_PLACES=108, PETRI_TRANSITIONS=165} [2022-12-06 07:36:22,519 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 86 predicate places. [2022-12-06 07:36:22,519 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:36:22,519 INFO L89 Accepts]: Start accepts. Operand has 108 places, 165 transitions, 1455 flow [2022-12-06 07:36:22,521 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:36:22,521 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:36:22,521 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 165 transitions, 1455 flow [2022-12-06 07:36:22,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 165 transitions, 1455 flow [2022-12-06 07:36:22,557 INFO L130 PetriNetUnfolder]: 99/225 cut-off events. [2022-12-06 07:36:22,557 INFO L131 PetriNetUnfolder]: For 1560/1566 co-relation queries the response was YES. [2022-12-06 07:36:22,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 225 events. 99/225 cut-off events. For 1560/1566 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 872 event pairs, 1 based on Foata normal form. 5/229 useless extension candidates. Maximal degree in co-relation 1057. Up to 69 conditions per place. [2022-12-06 07:36:22,559 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 165 transitions, 1455 flow [2022-12-06 07:36:22,560 INFO L188 LiptonReduction]: Number of co-enabled transitions 394 [2022-12-06 07:36:22,566 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [300] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [281] L53-->L46-1: Formula: (and (let ((.cse0 (< 0 (mod v_~s~0_64 4294967296)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_8| |v_thread1Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~s~0_64 v_~s~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_8| |v_thread1Thread1of1ForFork0_#t~post1_7|) (= v_~m~0_36 v_~m~0_35)) (and .cse0 (= v_~s~0_64 (+ v_~s~0_63 1)) (= (+ v_~m~0_36 1) v_~m~0_35)))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_17 256) 0))) InVars {~m~0=v_~m~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_64} OutVars{~m~0=v_~m~0_35, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_7|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_7|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_63} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:36:22,677 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [300] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [218] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork0_~cond~0_7 (ite (= (ite (or (< 0 (mod v_~t~0_2 4294967296)) (< 0 (mod v_~s~0_6 4294967296))) 1 0) 0) 0 1)) InVars {~s~0=v_~s~0_6, ~t~0=v_~t~0_2} OutVars{thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_7, ~s~0=v_~s~0_6, ~t~0=v_~t~0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0] [2022-12-06 07:36:22,711 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [300] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [218] L46-1-->L53: Formula: (= v_thread1Thread1of1ForFork0_~cond~0_7 (ite (= (ite (or (< 0 (mod v_~t~0_2 4294967296)) (< 0 (mod v_~s~0_6 4294967296))) 1 0) 0) 0 1)) InVars {~s~0=v_~s~0_6, ~t~0=v_~t~0_2} OutVars{thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_7, ~s~0=v_~s~0_6, ~t~0=v_~t~0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0] [2022-12-06 07:36:22,747 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [300] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [281] L53-->L46-1: Formula: (and (let ((.cse0 (< 0 (mod v_~s~0_64 4294967296)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_8| |v_thread1Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~s~0_64 v_~s~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_8| |v_thread1Thread1of1ForFork0_#t~post1_7|) (= v_~m~0_36 v_~m~0_35)) (and .cse0 (= v_~s~0_64 (+ v_~s~0_63 1)) (= (+ v_~m~0_36 1) v_~m~0_35)))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_17 256) 0))) InVars {~m~0=v_~m~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_64} OutVars{~m~0=v_~m~0_35, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_7|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_7|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_63} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:36:22,908 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [308] $Ultimate##0-->L66: Formula: (and (= (ite (= (ite (< 0 (mod v_~t~0_107 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_56) (not (= (mod v_thread2Thread1of1ForFork1_~cond~1_56 256) 0)) (= (+ v_~s~0_138 1) v_~s~0_137)) InVars {~s~0=v_~s~0_138, ~t~0=v_~t~0_107} OutVars{thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_23|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_56, ~s~0=v_~s~0_137, ~t~0=v_~t~0_107} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_~cond~1, ~s~0] and [303] $Ultimate##0-->L72: Formula: (and (= (ite (= (ite (or (< 0 (mod v_~t~0_98 4294967296)) (< 0 (mod v_~s~0_121 4294967296))) 1 0) 0) 0 1) v_thread1Thread1of1ForFork0_~cond~0_40) (= (ite (= 0 (ite (< 0 (mod v_~t~0_97 4294967296)) 1 0)) 0 1) v_thread2Thread1of1ForFork1_~cond~1_43) (= v_~t~0_98 (+ v_~t~0_97 1))) InVars {~t~0=v_~t~0_98, ~s~0=v_~s~0_121} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_19|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_43, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_40, ~t~0=v_~t~0_97, ~s~0=v_~s~0_121} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~cond~1, thread1Thread1of1ForFork0_~cond~0, ~t~0] [2022-12-06 07:36:22,946 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [300] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [281] L53-->L46-1: Formula: (and (let ((.cse0 (< 0 (mod v_~s~0_64 4294967296)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_8| |v_thread1Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~s~0_64 v_~s~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_8| |v_thread1Thread1of1ForFork0_#t~post1_7|) (= v_~m~0_36 v_~m~0_35)) (and .cse0 (= v_~s~0_64 (+ v_~s~0_63 1)) (= (+ v_~m~0_36 1) v_~m~0_35)))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_17 256) 0))) InVars {~m~0=v_~m~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_64} OutVars{~m~0=v_~m~0_35, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_7|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_7|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_63} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:36:23,062 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [300] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [281] L53-->L46-1: Formula: (and (let ((.cse0 (< 0 (mod v_~s~0_64 4294967296)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_8| |v_thread1Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~s~0_64 v_~s~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_8| |v_thread1Thread1of1ForFork0_#t~post1_7|) (= v_~m~0_36 v_~m~0_35)) (and .cse0 (= v_~s~0_64 (+ v_~s~0_63 1)) (= (+ v_~m~0_36 1) v_~m~0_35)))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_17 256) 0))) InVars {~m~0=v_~m~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_64} OutVars{~m~0=v_~m~0_35, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_7|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_7|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_63} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:36:23,174 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [244] L72-->L66: Formula: (and (not (= (mod v_thread2Thread1of1ForFork1_~cond~1_11 256) 0)) (= v_~s~0_31 (+ v_~s~0_32 1))) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_11, ~s~0=v_~s~0_32} OutVars{thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_5|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_11, ~s~0=v_~s~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post3, ~s~0] and [281] L53-->L46-1: Formula: (and (let ((.cse0 (< 0 (mod v_~s~0_64 4294967296)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_8| |v_thread1Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~s~0_64 v_~s~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_8| |v_thread1Thread1of1ForFork0_#t~post1_7|) (= v_~m~0_36 v_~m~0_35)) (and .cse0 (= v_~s~0_64 (+ v_~s~0_63 1)) (= (+ v_~m~0_36 1) v_~m~0_35)))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_17 256) 0))) InVars {~m~0=v_~m~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_64} OutVars{~m~0=v_~m~0_35, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_7|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_7|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_63} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:36:23,269 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [314] L72-->L72: Formula: (and (not (= (mod v_thread2Thread1of1ForFork1_~cond~1_73 256) 0)) (= (+ v_~s~0_164 1) v_~s~0_163) (= (ite (= (ite (< 0 (mod v_~t~0_117 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_72) (= v_~t~0_118 (+ v_~t~0_117 1))) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_73, ~t~0=v_~t~0_118, ~s~0=v_~s~0_164} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_27|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_31|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_72, ~t~0=v_~t~0_117, ~s~0=v_~s~0_163} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_~cond~1, ~t~0, ~s~0] and [281] L53-->L46-1: Formula: (and (let ((.cse0 (< 0 (mod v_~s~0_64 4294967296)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_8| |v_thread1Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~s~0_64 v_~s~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_8| |v_thread1Thread1of1ForFork0_#t~post1_7|) (= v_~m~0_36 v_~m~0_35)) (and .cse0 (= v_~s~0_64 (+ v_~s~0_63 1)) (= (+ v_~m~0_36 1) v_~m~0_35)))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_17 256) 0))) InVars {~m~0=v_~m~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_64} OutVars{~m~0=v_~m~0_35, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_7|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_7|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_63} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:36:23,475 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [300] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [281] L53-->L46-1: Formula: (and (let ((.cse0 (< 0 (mod v_~s~0_64 4294967296)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_8| |v_thread1Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~s~0_64 v_~s~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_8| |v_thread1Thread1of1ForFork0_#t~post1_7|) (= v_~m~0_36 v_~m~0_35)) (and .cse0 (= v_~s~0_64 (+ v_~s~0_63 1)) (= (+ v_~m~0_36 1) v_~m~0_35)))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_17 256) 0))) InVars {~m~0=v_~m~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_64} OutVars{~m~0=v_~m~0_35, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_7|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_7|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_63} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:36:23,693 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [220] $Ultimate##0-->L72: Formula: (= (ite (= (ite (< 0 (mod v_~t~0_6 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_1) InVars {~t~0=v_~t~0_6} OutVars{thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_1, ~t~0=v_~t~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1] and [281] L53-->L46-1: Formula: (and (let ((.cse0 (< 0 (mod v_~s~0_64 4294967296)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_8| |v_thread1Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~s~0_64 v_~s~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_8| |v_thread1Thread1of1ForFork0_#t~post1_7|) (= v_~m~0_36 v_~m~0_35)) (and .cse0 (= v_~s~0_64 (+ v_~s~0_63 1)) (= (+ v_~m~0_36 1) v_~m~0_35)))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_17 256) 0))) InVars {~m~0=v_~m~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_64} OutVars{~m~0=v_~m~0_35, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_7|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_7|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_63} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:36:23,770 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [300] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [281] L53-->L46-1: Formula: (and (let ((.cse0 (< 0 (mod v_~s~0_64 4294967296)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_8| |v_thread1Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~s~0_64 v_~s~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_8| |v_thread1Thread1of1ForFork0_#t~post1_7|) (= v_~m~0_36 v_~m~0_35)) (and .cse0 (= v_~s~0_64 (+ v_~s~0_63 1)) (= (+ v_~m~0_36 1) v_~m~0_35)))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_17 256) 0))) InVars {~m~0=v_~m~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_64} OutVars{~m~0=v_~m~0_35, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_7|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_7|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_63} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:36:23,887 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [300] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [281] L53-->L46-1: Formula: (and (let ((.cse0 (< 0 (mod v_~s~0_64 4294967296)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_8| |v_thread1Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~s~0_64 v_~s~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_8| |v_thread1Thread1of1ForFork0_#t~post1_7|) (= v_~m~0_36 v_~m~0_35)) (and .cse0 (= v_~s~0_64 (+ v_~s~0_63 1)) (= (+ v_~m~0_36 1) v_~m~0_35)))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_17 256) 0))) InVars {~m~0=v_~m~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_64} OutVars{~m~0=v_~m~0_35, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_7|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_7|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_63} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:36:24,013 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [244] L72-->L66: Formula: (and (not (= (mod v_thread2Thread1of1ForFork1_~cond~1_11 256) 0)) (= v_~s~0_31 (+ v_~s~0_32 1))) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_11, ~s~0=v_~s~0_32} OutVars{thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_5|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_11, ~s~0=v_~s~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post3, ~s~0] and [212] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork0_~cond~0_1 (ite (= (ite (or (< 0 (mod v_~s~0_1 4294967296)) (< 0 (mod v_~t~0_1 4294967296))) 1 0) 0) 0 1)) InVars {~s~0=v_~s~0_1, ~t~0=v_~t~0_1} OutVars{thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_1, ~s~0=v_~s~0_1, ~t~0=v_~t~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0] [2022-12-06 07:36:24,036 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [300] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [281] L53-->L46-1: Formula: (and (let ((.cse0 (< 0 (mod v_~s~0_64 4294967296)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_8| |v_thread1Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~s~0_64 v_~s~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_8| |v_thread1Thread1of1ForFork0_#t~post1_7|) (= v_~m~0_36 v_~m~0_35)) (and .cse0 (= v_~s~0_64 (+ v_~s~0_63 1)) (= (+ v_~m~0_36 1) v_~m~0_35)))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_17 256) 0))) InVars {~m~0=v_~m~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_64} OutVars{~m~0=v_~m~0_35, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_7|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_7|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_63} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:36:24,177 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [212] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork0_~cond~0_1 (ite (= (ite (or (< 0 (mod v_~s~0_1 4294967296)) (< 0 (mod v_~t~0_1 4294967296))) 1 0) 0) 0 1)) InVars {~s~0=v_~s~0_1, ~t~0=v_~t~0_1} OutVars{thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_1, ~s~0=v_~s~0_1, ~t~0=v_~t~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0] and [315] L72-->L46-1: Formula: (and (= (+ v_~t~0_121 1) v_~t~0_122) (= (ite (= (ite (< 0 (mod v_~t~0_121 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_76) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_60 256) 0)) (not (= (mod v_thread2Thread1of1ForFork1_~cond~1_77 256) 0)) (let ((.cse1 (+ v_~s~0_169 1))) (let ((.cse0 (< 0 (mod .cse1 4294967296)))) (or (and .cse0 (= v_~m~0_85 (+ v_~m~0_86 1)) (= v_~s~0_169 v_~s~0_167)) (and (= .cse1 v_~s~0_167) (= |v_thread1Thread1of1ForFork0_#t~post1_41| |v_thread1Thread1of1ForFork0_#t~post1_40|) (= |v_thread1Thread1of1ForFork0_#t~post2_41| |v_thread1Thread1of1ForFork0_#t~post2_40|) (not .cse0) (= v_~m~0_86 v_~m~0_85)))))) InVars {~m~0=v_~m~0_86, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_41|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_77, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_41|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_60, ~s~0=v_~s~0_169, ~t~0=v_~t~0_122} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_29|, ~m~0=v_~m~0_85, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_33|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_40|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_76, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_40|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_60, ~s~0=v_~s~0_167, ~t~0=v_~t~0_121} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~m~0, thread2Thread1of1ForFork1_#t~post3, thread1Thread1of1ForFork0_#t~post1, thread2Thread1of1ForFork1_~cond~1, thread1Thread1of1ForFork0_#t~post2, ~s~0, ~t~0] [2022-12-06 07:36:24,281 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [212] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork0_~cond~0_1 (ite (= (ite (or (< 0 (mod v_~s~0_1 4294967296)) (< 0 (mod v_~t~0_1 4294967296))) 1 0) 0) 0 1)) InVars {~s~0=v_~s~0_1, ~t~0=v_~t~0_1} OutVars{thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_1, ~s~0=v_~s~0_1, ~t~0=v_~t~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0] and [316] L72-->L46-1: Formula: (and (not (= 0 (mod v_thread1Thread1of1ForFork0_~cond~0_62 256))) (= (mod v_thread2Thread1of1ForFork1_~cond~1_80 256) 0) (not (= (mod v_thread2Thread1of1ForFork1_~cond~1_81 256) 0)) (= |v_thread2Thread1of1ForFork1_#res.base_26| 0) (= (ite (= (ite (< 0 (mod v_~t~0_125 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_80) (= |v_thread2Thread1of1ForFork1_#res.offset_26| 0) (= v_~t~0_126 (+ v_~t~0_125 1)) (let ((.cse1 (+ v_~s~0_175 1))) (let ((.cse0 (< 0 (mod .cse1 4294967296)))) (or (and (= v_~m~0_89 (+ v_~m~0_90 1)) (= v_~s~0_173 v_~s~0_175) .cse0) (and (= |v_thread1Thread1of1ForFork0_#t~post2_45| |v_thread1Thread1of1ForFork0_#t~post2_44|) (not .cse0) (= |v_thread1Thread1of1ForFork0_#t~post1_45| |v_thread1Thread1of1ForFork0_#t~post1_44|) (= v_~m~0_89 v_~m~0_90) (= .cse1 v_~s~0_173)))))) InVars {~m~0=v_~m~0_90, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_45|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_81, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_45|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_62, ~s~0=v_~s~0_175, ~t~0=v_~t~0_126} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_26|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_31|, ~m~0=v_~m~0_89, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_35|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_44|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_80, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_44|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_26|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_62, ~s~0=v_~s~0_173, ~t~0=v_~t~0_125} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, ~m~0, thread2Thread1of1ForFork1_#t~post3, thread1Thread1of1ForFork0_#t~post1, thread2Thread1of1ForFork1_~cond~1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#res.base, ~s~0, ~t~0] [2022-12-06 07:36:24,481 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [212] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork0_~cond~0_1 (ite (= (ite (or (< 0 (mod v_~s~0_1 4294967296)) (< 0 (mod v_~t~0_1 4294967296))) 1 0) 0) 0 1)) InVars {~s~0=v_~s~0_1, ~t~0=v_~t~0_1} OutVars{thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_1, ~s~0=v_~s~0_1, ~t~0=v_~t~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0] and [317] L72-->L46-1: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_28| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_84 256) 0) (let ((.cse0 (< 0 (mod v_~s~0_180 4294967296)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_49| |v_thread1Thread1of1ForFork0_#t~post1_48|) (not .cse0) (= v_~m~0_93 v_~m~0_94) (= v_~s~0_179 v_~s~0_180) (= |v_thread1Thread1of1ForFork0_#t~post2_49| |v_thread1Thread1of1ForFork0_#t~post2_48|)) (and (= (+ v_~m~0_94 1) v_~m~0_93) (= (+ v_~s~0_179 1) v_~s~0_180) .cse0))) (= |v_thread2Thread1of1ForFork1_#res.offset_28| 0) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_64 256) 0))) InVars {~m~0=v_~m~0_94, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_49|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_84, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_49|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_64, ~s~0=v_~s~0_180} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_28|, ~m~0=v_~m~0_93, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_48|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_84, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_48|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_28|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_64, ~s~0=v_~s~0_179} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, ~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#res.base, ~s~0] [2022-12-06 07:36:24,660 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [212] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork0_~cond~0_1 (ite (= (ite (or (< 0 (mod v_~s~0_1 4294967296)) (< 0 (mod v_~t~0_1 4294967296))) 1 0) 0) 0 1)) InVars {~s~0=v_~s~0_1, ~t~0=v_~t~0_1} OutVars{thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_1, ~s~0=v_~s~0_1, ~t~0=v_~t~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0] and [313] L72-->L46-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork1_~cond~1_70 256) 0)) (let ((.cse1 (+ v_~s~0_159 1))) (let ((.cse0 (< 0 (mod .cse1 4294967296)))) (or (and (not .cse0) (= v_~m~0_82 v_~m~0_81) (= .cse1 v_~s~0_157) (= |v_thread1Thread1of1ForFork0_#t~post1_37| |v_thread1Thread1of1ForFork0_#t~post1_36|) (= |v_thread1Thread1of1ForFork0_#t~post2_37| |v_thread1Thread1of1ForFork0_#t~post2_36|)) (and (= v_~s~0_159 v_~s~0_157) .cse0 (= (+ v_~m~0_82 1) v_~m~0_81))))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_58 256) 0))) InVars {~m~0=v_~m~0_82, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_37|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_70, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_37|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_58, ~s~0=v_~s~0_159} OutVars{~m~0=v_~m~0_81, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_29|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_36|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_70, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_36|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_58, ~s~0=v_~s~0_157} AuxVars[] AssignedVars[~m~0, thread2Thread1of1ForFork1_#t~post3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:36:24,771 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [212] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork0_~cond~0_1 (ite (= (ite (or (< 0 (mod v_~s~0_1 4294967296)) (< 0 (mod v_~t~0_1 4294967296))) 1 0) 0) 0 1)) InVars {~s~0=v_~s~0_1, ~t~0=v_~t~0_1} OutVars{thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_1, ~s~0=v_~s~0_1, ~t~0=v_~t~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0] and [314] L72-->L72: Formula: (and (not (= (mod v_thread2Thread1of1ForFork1_~cond~1_73 256) 0)) (= (+ v_~s~0_164 1) v_~s~0_163) (= (ite (= (ite (< 0 (mod v_~t~0_117 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_72) (= v_~t~0_118 (+ v_~t~0_117 1))) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_73, ~t~0=v_~t~0_118, ~s~0=v_~s~0_164} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_27|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_31|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_72, ~t~0=v_~t~0_117, ~s~0=v_~s~0_163} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_~cond~1, ~t~0, ~s~0] [2022-12-06 07:36:24,803 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [300] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [281] L53-->L46-1: Formula: (and (let ((.cse0 (< 0 (mod v_~s~0_64 4294967296)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_8| |v_thread1Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~s~0_64 v_~s~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_8| |v_thread1Thread1of1ForFork0_#t~post1_7|) (= v_~m~0_36 v_~m~0_35)) (and .cse0 (= v_~s~0_64 (+ v_~s~0_63 1)) (= (+ v_~m~0_36 1) v_~m~0_35)))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_17 256) 0))) InVars {~m~0=v_~m~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_64} OutVars{~m~0=v_~m~0_35, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_7|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_7|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_63} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:36:24,909 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [300] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [281] L53-->L46-1: Formula: (and (let ((.cse0 (< 0 (mod v_~s~0_64 4294967296)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_8| |v_thread1Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~s~0_64 v_~s~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_8| |v_thread1Thread1of1ForFork0_#t~post1_7|) (= v_~m~0_36 v_~m~0_35)) (and .cse0 (= v_~s~0_64 (+ v_~s~0_63 1)) (= (+ v_~m~0_36 1) v_~m~0_35)))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_17 256) 0))) InVars {~m~0=v_~m~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_64} OutVars{~m~0=v_~m~0_35, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_7|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_7|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_63} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:36:25,028 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [300] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [212] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork0_~cond~0_1 (ite (= (ite (or (< 0 (mod v_~s~0_1 4294967296)) (< 0 (mod v_~t~0_1 4294967296))) 1 0) 0) 0 1)) InVars {~s~0=v_~s~0_1, ~t~0=v_~t~0_1} OutVars{thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_1, ~s~0=v_~s~0_1, ~t~0=v_~t~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0] [2022-12-06 07:36:25,069 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [319] $Ultimate##0-->L66: Formula: (and (= (ite (= (ite (< 0 (mod v_~t~0_131 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_86) (= (+ v_~s~0_188 1) v_~s~0_187) (not (= (mod v_thread2Thread1of1ForFork1_~cond~1_86 256) 0))) InVars {~s~0=v_~s~0_188, ~t~0=v_~t~0_131} OutVars{thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_37|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_86, ~s~0=v_~s~0_187, ~t~0=v_~t~0_131} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_~cond~1, ~s~0] and [281] L53-->L46-1: Formula: (and (let ((.cse0 (< 0 (mod v_~s~0_64 4294967296)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_8| |v_thread1Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~s~0_64 v_~s~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_8| |v_thread1Thread1of1ForFork0_#t~post1_7|) (= v_~m~0_36 v_~m~0_35)) (and .cse0 (= v_~s~0_64 (+ v_~s~0_63 1)) (= (+ v_~m~0_36 1) v_~m~0_35)))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_17 256) 0))) InVars {~m~0=v_~m~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_64} OutVars{~m~0=v_~m~0_35, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_7|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_7|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_63} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:36:25,182 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [300] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [281] L53-->L46-1: Formula: (and (let ((.cse0 (< 0 (mod v_~s~0_64 4294967296)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_8| |v_thread1Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~s~0_64 v_~s~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_8| |v_thread1Thread1of1ForFork0_#t~post1_7|) (= v_~m~0_36 v_~m~0_35)) (and .cse0 (= v_~s~0_64 (+ v_~s~0_63 1)) (= (+ v_~m~0_36 1) v_~m~0_35)))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_17 256) 0))) InVars {~m~0=v_~m~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_64} OutVars{~m~0=v_~m~0_35, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_7|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_7|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_63} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:36:25,295 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [300] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [281] L53-->L46-1: Formula: (and (let ((.cse0 (< 0 (mod v_~s~0_64 4294967296)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_8| |v_thread1Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~s~0_64 v_~s~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_8| |v_thread1Thread1of1ForFork0_#t~post1_7|) (= v_~m~0_36 v_~m~0_35)) (and .cse0 (= v_~s~0_64 (+ v_~s~0_63 1)) (= (+ v_~m~0_36 1) v_~m~0_35)))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_17 256) 0))) InVars {~m~0=v_~m~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_64} OutVars{~m~0=v_~m~0_35, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_7|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_7|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_63} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:36:25,426 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [309] $Ultimate##0-->L72: Formula: (and (= (+ v_~s~0_142 1) v_~s~0_141) (not (= (mod (ite (= (ite (< 0 (mod v_~t~0_110 4294967296)) 1 0) 0) 0 1) 256) 0)) (= v_~t~0_110 (+ v_~t~0_109 1)) (= (ite (= (ite (< 0 (mod v_~t~0_109 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_58)) InVars {~t~0=v_~t~0_110, ~s~0=v_~s~0_142} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_23|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_25|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_58, ~t~0=v_~t~0_109, ~s~0=v_~s~0_141} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_~cond~1, ~t~0, ~s~0] and [328] $Ultimate##0-->L46-1: Formula: (let ((.cse0 (< 0 (mod v_~s~0_224 4294967296)))) (and (= |v_thread2Thread1of1ForFork1_#res.offset_38| 0) (= 0 (mod v_thread2Thread1of1ForFork1_~cond~1_110 256)) (or (and (= (+ v_~m~0_126 1) v_~m~0_125) (= (+ v_~s~0_223 1) v_~s~0_224) .cse0) (and (= |v_thread1Thread1of1ForFork0_#t~post2_81| |v_thread1Thread1of1ForFork0_#t~post2_80|) (= |v_thread1Thread1of1ForFork0_#t~post1_81| |v_thread1Thread1of1ForFork0_#t~post1_80|) (= v_~s~0_224 v_~s~0_223) (not .cse0) (= v_~m~0_126 v_~m~0_125))) (= |v_thread2Thread1of1ForFork1_#res.base_38| 0) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_82 256) 0)) (= (ite (= (ite (or (< 0 (mod v_~t~0_149 4294967296)) .cse0) 1 0) 0) 0 1) v_thread1Thread1of1ForFork0_~cond~0_82))) InVars {~m~0=v_~m~0_126, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_81|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_110, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_81|, ~s~0=v_~s~0_224, ~t~0=v_~t~0_149} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_38|, ~m~0=v_~m~0_125, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_80|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_110, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_80|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_38|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_82, ~s~0=v_~s~0_223, ~t~0=v_~t~0_149} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, ~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork0_~cond~0, ~s~0] [2022-12-06 07:36:25,547 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [309] $Ultimate##0-->L72: Formula: (and (= (+ v_~s~0_142 1) v_~s~0_141) (not (= (mod (ite (= (ite (< 0 (mod v_~t~0_110 4294967296)) 1 0) 0) 0 1) 256) 0)) (= v_~t~0_110 (+ v_~t~0_109 1)) (= (ite (= (ite (< 0 (mod v_~t~0_109 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_58)) InVars {~t~0=v_~t~0_110, ~s~0=v_~s~0_142} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_23|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_25|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_58, ~t~0=v_~t~0_109, ~s~0=v_~s~0_141} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_~cond~1, ~t~0, ~s~0] and [329] $Ultimate##0-->L46-1: Formula: (let ((.cse0 (< 0 (mod v_~s~0_228 4294967296)))) (and (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_84 256) 0)) (= (ite (= (ite (or .cse0 (< 0 (mod v_~t~0_151 4294967296))) 1 0) 0) 0 1) v_thread1Thread1of1ForFork0_~cond~0_84) (or (and (= (+ v_~m~0_130 1) v_~m~0_129) .cse0 (= (+ v_~s~0_227 1) v_~s~0_228)) (and (= |v_thread1Thread1of1ForFork0_#t~post1_85| |v_thread1Thread1of1ForFork0_#t~post1_84|) (= v_~s~0_228 v_~s~0_227) (not .cse0) (= v_~m~0_129 v_~m~0_130) (= |v_thread1Thread1of1ForFork0_#t~post2_85| |v_thread1Thread1of1ForFork0_#t~post2_84|))))) InVars {~m~0=v_~m~0_130, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_85|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_85|, ~s~0=v_~s~0_228, ~t~0=v_~t~0_151} OutVars{~m~0=v_~m~0_129, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_84|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_84|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_84, ~s~0=v_~s~0_227, ~t~0=v_~t~0_151} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~cond~0, ~s~0] [2022-12-06 07:36:25,662 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [309] $Ultimate##0-->L72: Formula: (and (= (+ v_~s~0_142 1) v_~s~0_141) (not (= (mod (ite (= (ite (< 0 (mod v_~t~0_110 4294967296)) 1 0) 0) 0 1) 256) 0)) (= v_~t~0_110 (+ v_~t~0_109 1)) (= (ite (= (ite (< 0 (mod v_~t~0_109 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_58)) InVars {~t~0=v_~t~0_110, ~s~0=v_~s~0_142} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_23|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_25|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_58, ~t~0=v_~t~0_109, ~s~0=v_~s~0_141} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_~cond~1, ~t~0, ~s~0] and [330] $Ultimate##0-->L46-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork1_~cond~1_112 256) 0)) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_86 256) 0)) (= (ite (= (ite (or (< 0 (mod v_~t~0_153 4294967296)) (< 0 (mod v_~s~0_232 4294967296))) 1 0) 0) 0 1) v_thread1Thread1of1ForFork0_~cond~0_86) (let ((.cse1 (+ v_~s~0_232 1))) (let ((.cse0 (< 0 (mod .cse1 4294967296)))) (or (and (= (+ v_~m~0_134 1) v_~m~0_133) (= v_~s~0_232 v_~s~0_231) .cse0) (and (= v_~m~0_134 v_~m~0_133) (= |v_thread1Thread1of1ForFork0_#t~post2_89| |v_thread1Thread1of1ForFork0_#t~post2_88|) (not .cse0) (= .cse1 v_~s~0_231) (= |v_thread1Thread1of1ForFork0_#t~post1_89| |v_thread1Thread1of1ForFork0_#t~post1_88|)))))) InVars {~m~0=v_~m~0_134, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_89|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_112, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_89|, ~s~0=v_~s~0_232, ~t~0=v_~t~0_153} OutVars{~m~0=v_~m~0_133, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_47|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_88|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_112, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_88|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_86, ~s~0=v_~s~0_231, ~t~0=v_~t~0_153} AuxVars[] AssignedVars[~m~0, thread2Thread1of1ForFork1_#t~post3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~cond~0, ~s~0] [2022-12-06 07:36:25,858 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [309] $Ultimate##0-->L72: Formula: (and (= (+ v_~s~0_142 1) v_~s~0_141) (not (= (mod (ite (= (ite (< 0 (mod v_~t~0_110 4294967296)) 1 0) 0) 0 1) 256) 0)) (= v_~t~0_110 (+ v_~t~0_109 1)) (= (ite (= (ite (< 0 (mod v_~t~0_109 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_58)) InVars {~t~0=v_~t~0_110, ~s~0=v_~s~0_142} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_23|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_25|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_58, ~t~0=v_~t~0_109, ~s~0=v_~s~0_141} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_~cond~1, ~t~0, ~s~0] and [331] $Ultimate##0-->L72: Formula: (and (= v_~t~0_156 (+ v_~t~0_155 1)) (= (+ v_~s~0_236 1) v_~s~0_235) (not (= (mod v_thread2Thread1of1ForFork1_~cond~1_115 256) 0)) (= (ite (= (ite (or (< 0 (mod v_~s~0_236 4294967296)) (< 0 (mod v_~t~0_156 4294967296))) 1 0) 0) 0 1) v_thread1Thread1of1ForFork0_~cond~0_88) (= (ite (= (ite (< 0 (mod v_~t~0_155 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_114)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_115, ~t~0=v_~t~0_156, ~s~0=v_~s~0_236} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_39|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_49|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_114, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_88, ~t~0=v_~t~0_155, ~s~0=v_~s~0_235} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_~cond~1, thread1Thread1of1ForFork0_~cond~0, ~t~0, ~s~0] [2022-12-06 07:36:26,125 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [309] $Ultimate##0-->L72: Formula: (and (= (+ v_~s~0_142 1) v_~s~0_141) (not (= (mod (ite (= (ite (< 0 (mod v_~t~0_110 4294967296)) 1 0) 0) 0 1) 256) 0)) (= v_~t~0_110 (+ v_~t~0_109 1)) (= (ite (= (ite (< 0 (mod v_~t~0_109 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_58)) InVars {~t~0=v_~t~0_110, ~s~0=v_~s~0_142} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_23|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_25|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_58, ~t~0=v_~t~0_109, ~s~0=v_~s~0_141} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_~cond~1, ~t~0, ~s~0] and [212] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork0_~cond~0_1 (ite (= (ite (or (< 0 (mod v_~s~0_1 4294967296)) (< 0 (mod v_~t~0_1 4294967296))) 1 0) 0) 0 1)) InVars {~s~0=v_~s~0_1, ~t~0=v_~t~0_1} OutVars{thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_1, ~s~0=v_~s~0_1, ~t~0=v_~t~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0] [2022-12-06 07:36:26,156 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [309] $Ultimate##0-->L72: Formula: (and (= (+ v_~s~0_142 1) v_~s~0_141) (not (= (mod (ite (= (ite (< 0 (mod v_~t~0_110 4294967296)) 1 0) 0) 0 1) 256) 0)) (= v_~t~0_110 (+ v_~t~0_109 1)) (= (ite (= (ite (< 0 (mod v_~t~0_109 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_58)) InVars {~t~0=v_~t~0_110, ~s~0=v_~s~0_142} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_23|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_25|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_58, ~t~0=v_~t~0_109, ~s~0=v_~s~0_141} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_~cond~1, ~t~0, ~s~0] and [326] $Ultimate##0-->L46-1: Formula: (and (= v_~t~0_142 (+ v_~t~0_141 1)) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_78 256) 0)) (= (ite (= (ite (< 0 (mod v_~t~0_141 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_102) (let ((.cse1 (+ v_~s~0_216 1))) (let ((.cse0 (< 0 (mod .cse1 4294967296)))) (or (and (= v_~m~0_117 (+ v_~m~0_118 1)) (= v_~s~0_216 v_~s~0_215) .cse0) (and (not .cse0) (= v_~m~0_118 v_~m~0_117) (= v_~s~0_215 .cse1) (= |v_thread1Thread1of1ForFork0_#t~post2_73| |v_thread1Thread1of1ForFork0_#t~post2_72|) (= |v_thread1Thread1of1ForFork0_#t~post1_73| |v_thread1Thread1of1ForFork0_#t~post1_72|))))) (not (= (mod v_thread2Thread1of1ForFork1_~cond~1_103 256) 0)) (= (ite (= (ite (or (< 0 (mod v_~t~0_142 4294967296)) (< 0 (mod v_~s~0_216 4294967296))) 1 0) 0) 0 1) v_thread1Thread1of1ForFork0_~cond~0_78)) InVars {~m~0=v_~m~0_118, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_73|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_103, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_73|, ~s~0=v_~s~0_216, ~t~0=v_~t~0_142} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_35|, ~m~0=v_~m~0_117, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_43|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_72|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_102, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_72|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_78, ~s~0=v_~s~0_215, ~t~0=v_~t~0_141} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~m~0, thread2Thread1of1ForFork1_#t~post3, thread1Thread1of1ForFork0_#t~post1, thread2Thread1of1ForFork1_~cond~1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~cond~0, ~s~0, ~t~0] [2022-12-06 07:36:26,401 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [309] $Ultimate##0-->L72: Formula: (and (= (+ v_~s~0_142 1) v_~s~0_141) (not (= (mod (ite (= (ite (< 0 (mod v_~t~0_110 4294967296)) 1 0) 0) 0 1) 256) 0)) (= v_~t~0_110 (+ v_~t~0_109 1)) (= (ite (= (ite (< 0 (mod v_~t~0_109 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_58)) InVars {~t~0=v_~t~0_110, ~s~0=v_~s~0_142} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_23|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_25|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_58, ~t~0=v_~t~0_109, ~s~0=v_~s~0_141} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_~cond~1, ~t~0, ~s~0] and [327] $Ultimate##0-->L46-1: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_36| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_36| 0) (not (= (mod v_thread2Thread1of1ForFork1_~cond~1_107 256) 0)) (let ((.cse1 (+ v_~s~0_220 1))) (let ((.cse0 (< 0 (mod .cse1 4294967296)))) (or (and (= v_~s~0_220 v_~s~0_219) .cse0 (= (+ v_~m~0_122 1) v_~m~0_121)) (and (= |v_thread1Thread1of1ForFork0_#t~post1_77| |v_thread1Thread1of1ForFork0_#t~post1_76|) (= .cse1 v_~s~0_219) (= v_~m~0_122 v_~m~0_121) (not .cse0) (= |v_thread1Thread1of1ForFork0_#t~post2_77| |v_thread1Thread1of1ForFork0_#t~post2_76|))))) (= v_~t~0_146 (+ v_~t~0_145 1)) (= (ite (= (ite (< 0 (mod v_~t~0_145 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_106) (= (ite (= (ite (or (< 0 (mod v_~t~0_146 4294967296)) (< 0 (mod v_~s~0_220 4294967296))) 1 0) 0) 0 1) v_thread1Thread1of1ForFork0_~cond~0_80) (= (mod v_thread2Thread1of1ForFork1_~cond~1_106 256) 0)) InVars {~m~0=v_~m~0_122, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_77|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_107, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_77|, ~s~0=v_~s~0_220, ~t~0=v_~t~0_146} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_36|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_37|, ~m~0=v_~m~0_121, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_45|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_76|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_106, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_76|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_36|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_80, ~s~0=v_~s~0_219, ~t~0=v_~t~0_145} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, ~m~0, thread2Thread1of1ForFork1_#t~post3, thread1Thread1of1ForFork0_#t~post1, thread2Thread1of1ForFork1_~cond~1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork0_~cond~0, ~s~0, ~t~0] [2022-12-06 07:36:26,619 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [343] $Ultimate##0-->L72: Formula: (and (= v_~t~0_187 (+ v_~t~0_185 2)) (= (ite (= (ite (< 0 (mod v_~t~0_185 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_144) (not (= (mod (ite (= (ite (< 0 (mod v_~t~0_187 4294967296)) 1 0) 0) 0 1) 256) 0)) (= (+ 2 v_~s~0_293) v_~s~0_291) (not (= (mod (ite (= (ite (< 0 (mod (+ v_~t~0_185 1) 4294967296)) 1 0) 0) 0 1) 256) 0))) InVars {~t~0=v_~t~0_187, ~s~0=v_~s~0_293} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_53|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_67|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_144, ~t~0=v_~t~0_185, ~s~0=v_~s~0_291} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_~cond~1, ~t~0, ~s~0] and [212] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork0_~cond~0_1 (ite (= (ite (or (< 0 (mod v_~s~0_1 4294967296)) (< 0 (mod v_~t~0_1 4294967296))) 1 0) 0) 0 1)) InVars {~s~0=v_~s~0_1, ~t~0=v_~t~0_1} OutVars{thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_1, ~s~0=v_~s~0_1, ~t~0=v_~t~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0] [2022-12-06 07:36:26,765 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] $Ultimate##0-->thread2EXIT: Formula: (and (= v_thread2Thread1of1ForFork1_~cond~1_148 (ite (= (ite (< 0 (mod v_~t~0_191 4294967296)) 1 0) 0) 0 1)) (= v_~t~0_192 (+ v_~t~0_191 1)) (= |v_thread2Thread1of1ForFork1_#res.base_52| 0) (= (+ v_~s~0_298 1) v_~s~0_297) (= |v_thread2Thread1of1ForFork1_#res.offset_52| 0) (= 0 (mod v_thread2Thread1of1ForFork1_~cond~1_148 256))) InVars {~t~0=v_~t~0_192, ~s~0=v_~s~0_298} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_52|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_57|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_71|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_148, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_52|, ~t~0=v_~t~0_191, ~s~0=v_~s~0_297} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_~cond~1, thread2Thread1of1ForFork1_#res.base, ~t~0, ~s~0] and [318] $Ultimate##0-->L46-1: Formula: (let ((.cse0 (< 0 (mod v_~s~0_184 4294967296)))) (and (= (ite (= (ite (or (< 0 (mod v_~t~0_129 4294967296)) .cse0) 1 0) 0) 0 1) v_thread1Thread1of1ForFork0_~cond~0_66) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_66 256) 0)) (or (and (= v_~m~0_97 (+ v_~m~0_98 1)) .cse0 (= (+ v_~s~0_183 1) v_~s~0_184)) (and (= v_~s~0_184 v_~s~0_183) (= |v_thread1Thread1of1ForFork0_#t~post1_52| |v_thread1Thread1of1ForFork0_#t~post1_53|) (= |v_thread1Thread1of1ForFork0_#t~post2_53| |v_thread1Thread1of1ForFork0_#t~post2_52|) (not .cse0) (= v_~m~0_98 v_~m~0_97))))) InVars {~m~0=v_~m~0_98, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_53|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_53|, ~s~0=v_~s~0_184, ~t~0=v_~t~0_129} OutVars{~m~0=v_~m~0_97, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_52|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_52|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_66, ~s~0=v_~s~0_183, ~t~0=v_~t~0_129} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~cond~0, ~s~0] [2022-12-06 07:36:26,890 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [212] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork0_~cond~0_1 (ite (= (ite (or (< 0 (mod v_~s~0_1 4294967296)) (< 0 (mod v_~t~0_1 4294967296))) 1 0) 0) 0 1)) InVars {~s~0=v_~s~0_1, ~t~0=v_~t~0_1} OutVars{thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_1, ~s~0=v_~s~0_1, ~t~0=v_~t~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0] and [220] $Ultimate##0-->L72: Formula: (= (ite (= (ite (< 0 (mod v_~t~0_6 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_1) InVars {~t~0=v_~t~0_6} OutVars{thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_1, ~t~0=v_~t~0_6} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1] [2022-12-06 07:36:26,987 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [212] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork0_~cond~0_1 (ite (= (ite (or (< 0 (mod v_~s~0_1 4294967296)) (< 0 (mod v_~t~0_1 4294967296))) 1 0) 0) 0 1)) InVars {~s~0=v_~s~0_1, ~t~0=v_~t~0_1} OutVars{thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_1, ~s~0=v_~s~0_1, ~t~0=v_~t~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0] and [320] $Ultimate##0-->L46-1: Formula: (and (not (= 0 (mod v_thread1Thread1of1ForFork0_~cond~0_68 256))) (let ((.cse0 (< 0 (mod v_~s~0_192 4294967296)))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork0_#t~post1_57| |v_thread1Thread1of1ForFork0_#t~post1_56|) (= v_~m~0_102 v_~m~0_101) (= v_~s~0_192 v_~s~0_191) (= |v_thread1Thread1of1ForFork0_#t~post2_57| |v_thread1Thread1of1ForFork0_#t~post2_56|)) (and (= (+ v_~s~0_191 1) v_~s~0_192) (= (+ v_~m~0_102 1) v_~m~0_101) .cse0))) (= (ite (= (ite (< 0 (mod v_~t~0_133 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_88)) InVars {~m~0=v_~m~0_102, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_57|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_57|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_68, ~s~0=v_~s~0_192, ~t~0=v_~t~0_133} OutVars{~m~0=v_~m~0_101, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_56|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_88, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_56|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_68, ~s~0=v_~s~0_191, ~t~0=v_~t~0_133} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread2Thread1of1ForFork1_~cond~1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:36:27,073 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [212] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork0_~cond~0_1 (ite (= (ite (or (< 0 (mod v_~s~0_1 4294967296)) (< 0 (mod v_~t~0_1 4294967296))) 1 0) 0) 0 1)) InVars {~s~0=v_~s~0_1, ~t~0=v_~t~0_1} OutVars{thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_1, ~s~0=v_~s~0_1, ~t~0=v_~t~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0] and [335] $Ultimate##0-->L46-1: Formula: (and (not (= (mod v_thread2Thread1of1ForFork1_~cond~1_124 256) 0)) (let ((.cse1 (+ v_~s~0_251 1))) (let ((.cse0 (< 0 (mod .cse1 4294967296)))) (or (and (= v_~s~0_249 v_~s~0_251) (= (+ v_~m~0_146 1) v_~m~0_145) .cse0) (and (= .cse1 v_~s~0_249) (not .cse0) (= |v_thread1Thread1of1ForFork0_#t~post1_100| |v_thread1Thread1of1ForFork0_#t~post1_101|) (= |v_thread1Thread1of1ForFork0_#t~post2_101| |v_thread1Thread1of1ForFork0_#t~post2_100|) (= v_~m~0_146 v_~m~0_145))))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_96 256) 0)) (= (ite (= (ite (< 0 (mod v_~t~0_161 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_124)) InVars {~m~0=v_~m~0_146, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_101|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_101|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_96, ~s~0=v_~s~0_251, ~t~0=v_~t~0_161} OutVars{~m~0=v_~m~0_145, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_51|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_100|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_124, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_100|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_96, ~s~0=v_~s~0_249, ~t~0=v_~t~0_161} AuxVars[] AssignedVars[~m~0, thread2Thread1of1ForFork1_#t~post3, thread1Thread1of1ForFork0_#t~post1, thread2Thread1of1ForFork1_~cond~1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:36:27,209 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [212] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork0_~cond~0_1 (ite (= (ite (or (< 0 (mod v_~s~0_1 4294967296)) (< 0 (mod v_~t~0_1 4294967296))) 1 0) 0) 0 1)) InVars {~s~0=v_~s~0_1, ~t~0=v_~t~0_1} OutVars{thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_1, ~s~0=v_~s~0_1, ~t~0=v_~t~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0] and [336] $Ultimate##0-->L72: Formula: (and (= (+ v_~s~0_256 1) v_~s~0_255) (= (ite (= (ite (< 0 (mod v_~t~0_163 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_126) (not (= (mod (ite (= (ite (< 0 (mod v_~t~0_164 4294967296)) 1 0) 0) 0 1) 256) 0)) (= v_~t~0_164 (+ v_~t~0_163 1))) InVars {~t~0=v_~t~0_164, ~s~0=v_~s~0_256} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_41|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_53|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_126, ~t~0=v_~t~0_163, ~s~0=v_~s~0_255} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_~cond~1, ~t~0, ~s~0] [2022-12-06 07:36:27,242 INFO L203 LiptonReduction]: Total number of compositions: 21 [2022-12-06 07:36:27,243 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4724 [2022-12-06 07:36:27,243 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 149 transitions, 1571 flow [2022-12-06 07:36:27,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:27,243 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:36:27,243 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:36:27,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 07:36:27,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-06 07:36:27,447 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:36:27,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:36:27,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1555303035, now seen corresponding path program 1 times [2022-12-06 07:36:27,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:36:27,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124907857] [2022-12-06 07:36:27,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:27,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:36:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:41,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:36:41,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124907857] [2022-12-06 07:36:41,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124907857] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:36:41,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013011742] [2022-12-06 07:36:41,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:36:41,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:36:41,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:36:41,259 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:36:41,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:36:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:36:41,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 07:36:41,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:36:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:42,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:36:43,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:36:43,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013011742] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:36:43,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:36:43,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-12-06 07:36:43,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305402564] [2022-12-06 07:36:43,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:36:43,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-06 07:36:43,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:36:43,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-06 07:36:43,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=411, Unknown=2, NotChecked=0, Total=506 [2022-12-06 07:36:43,125 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 07:36:43,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 149 transitions, 1571 flow. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:36:43,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:36:43,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 07:36:43,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:09,680 WARN L233 SmtUtils]: Spent 9.92s on a formula simplification. DAG size of input: 125 DAG size of output: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:37:25,652 INFO L130 PetriNetUnfolder]: 761/1318 cut-off events. [2022-12-06 07:37:25,652 INFO L131 PetriNetUnfolder]: For 18590/18590 co-relation queries the response was YES. [2022-12-06 07:37:25,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7720 conditions, 1318 events. 761/1318 cut-off events. For 18590/18590 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6610 event pairs, 0 based on Foata normal form. 10/1328 useless extension candidates. Maximal degree in co-relation 7625. Up to 325 conditions per place. [2022-12-06 07:37:25,662 INFO L137 encePairwiseOnDemand]: 8/47 looper letters, 158 selfloop transitions, 235 changer transitions 73/466 dead transitions. [2022-12-06 07:37:25,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 466 transitions, 5206 flow [2022-12-06 07:37:25,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-06 07:37:25,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-12-06 07:37:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 279 transitions. [2022-12-06 07:37:25,665 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.11639549436795996 [2022-12-06 07:37:25,665 INFO L175 Difference]: Start difference. First operand has 85 places, 149 transitions, 1571 flow. Second operand 51 states and 279 transitions. [2022-12-06 07:37:25,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 466 transitions, 5206 flow [2022-12-06 07:37:25,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 466 transitions, 4572 flow, removed 298 selfloop flow, removed 17 redundant places. [2022-12-06 07:37:25,714 INFO L231 Difference]: Finished difference. Result has 132 places, 293 transitions, 3286 flow [2022-12-06 07:37:25,715 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=3286, PETRI_PLACES=132, PETRI_TRANSITIONS=293} [2022-12-06 07:37:25,716 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 110 predicate places. [2022-12-06 07:37:25,716 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:25,717 INFO L89 Accepts]: Start accepts. Operand has 132 places, 293 transitions, 3286 flow [2022-12-06 07:37:25,718 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:25,718 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:25,718 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 293 transitions, 3286 flow [2022-12-06 07:37:25,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 293 transitions, 3286 flow [2022-12-06 07:37:25,761 INFO L130 PetriNetUnfolder]: 193/411 cut-off events. [2022-12-06 07:37:25,761 INFO L131 PetriNetUnfolder]: For 2141/2143 co-relation queries the response was YES. [2022-12-06 07:37:25,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2275 conditions, 411 events. 193/411 cut-off events. For 2141/2143 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1920 event pairs, 0 based on Foata normal form. 1/408 useless extension candidates. Maximal degree in co-relation 2189. Up to 116 conditions per place. [2022-12-06 07:37:25,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 293 transitions, 3286 flow [2022-12-06 07:37:25,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 664 [2022-12-06 07:37:25,769 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [349] $Ultimate##0-->L53: Formula: (let ((.cse0 (< 0 (mod v_~t~0_215 4294967296)))) (and (= v_~t~0_216 (+ v_~t~0_215 2)) (not (= (mod (ite (= (ite (< 0 (mod (+ v_~t~0_215 1) 4294967296)) 1 0) 0) 0 1) 256) 0)) (= (ite (= (ite (or .cse0 (< 0 (mod v_~s~0_323 4294967296))) 1 0) 0) 0 1) v_thread1Thread1of1ForFork0_~cond~0_118) (not (= (mod (ite (= (ite (< 0 (mod v_~t~0_216 4294967296)) 1 0) 0) 0 1) 256) 0)) (= (ite (= (ite .cse0 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_162) (= (+ 2 v_~s~0_324) v_~s~0_323))) InVars {~s~0=v_~s~0_324, ~t~0=v_~t~0_216} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_71|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_87|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_162, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_118, ~s~0=v_~s~0_323, ~t~0=v_~t~0_215} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_~cond~1, thread1Thread1of1ForFork0_~cond~0, ~s~0, ~t~0] and [300] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] [2022-12-06 07:37:26,018 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [349] $Ultimate##0-->L53: Formula: (let ((.cse0 (< 0 (mod v_~t~0_215 4294967296)))) (and (= v_~t~0_216 (+ v_~t~0_215 2)) (not (= (mod (ite (= (ite (< 0 (mod (+ v_~t~0_215 1) 4294967296)) 1 0) 0) 0 1) 256) 0)) (= (ite (= (ite (or .cse0 (< 0 (mod v_~s~0_323 4294967296))) 1 0) 0) 0 1) v_thread1Thread1of1ForFork0_~cond~0_118) (not (= (mod (ite (= (ite (< 0 (mod v_~t~0_216 4294967296)) 1 0) 0) 0 1) 256) 0)) (= (ite (= (ite .cse0 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_162) (= (+ 2 v_~s~0_324) v_~s~0_323))) InVars {~s~0=v_~s~0_324, ~t~0=v_~t~0_216} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_71|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_87|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_162, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_118, ~s~0=v_~s~0_323, ~t~0=v_~t~0_215} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_~cond~1, thread1Thread1of1ForFork0_~cond~0, ~s~0, ~t~0] and [244] L72-->L66: Formula: (and (not (= (mod v_thread2Thread1of1ForFork1_~cond~1_11 256) 0)) (= v_~s~0_31 (+ v_~s~0_32 1))) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_11, ~s~0=v_~s~0_32} OutVars{thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_5|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_11, ~s~0=v_~s~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post3, ~s~0] [2022-12-06 07:37:26,464 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [269] L66-->L72: Formula: (and (= v_~t~0_36 (+ v_~t~0_35 1)) (= (ite (= (ite (< 0 (mod v_~t~0_35 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_15)) InVars {~t~0=v_~t~0_36} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_7|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_15, ~t~0=v_~t~0_35} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~cond~1, ~t~0] and [281] L53-->L46-1: Formula: (and (let ((.cse0 (< 0 (mod v_~s~0_64 4294967296)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_8| |v_thread1Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~s~0_64 v_~s~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_8| |v_thread1Thread1of1ForFork0_#t~post1_7|) (= v_~m~0_36 v_~m~0_35)) (and .cse0 (= v_~s~0_64 (+ v_~s~0_63 1)) (= (+ v_~m~0_36 1) v_~m~0_35)))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_17 256) 0))) InVars {~m~0=v_~m~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_64} OutVars{~m~0=v_~m~0_35, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_7|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_7|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_63} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:37:26,624 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [244] L72-->L66: Formula: (and (not (= (mod v_thread2Thread1of1ForFork1_~cond~1_11 256) 0)) (= v_~s~0_31 (+ v_~s~0_32 1))) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_11, ~s~0=v_~s~0_32} OutVars{thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_5|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_11, ~s~0=v_~s~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post3, ~s~0] and [281] L53-->L46-1: Formula: (and (let ((.cse0 (< 0 (mod v_~s~0_64 4294967296)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_8| |v_thread1Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~s~0_64 v_~s~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_8| |v_thread1Thread1of1ForFork0_#t~post1_7|) (= v_~m~0_36 v_~m~0_35)) (and .cse0 (= v_~s~0_64 (+ v_~s~0_63 1)) (= (+ v_~m~0_36 1) v_~m~0_35)))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_17 256) 0))) InVars {~m~0=v_~m~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_64} OutVars{~m~0=v_~m~0_35, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_7|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_7|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_63} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:37:27,115 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [357] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (< 0 (mod v_~t~0_243 4294967296)))) (and (= |v_thread2Thread1of1ForFork1_#res.offset_62| 0) (= (ite (= (ite .cse0 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_179) (= v_~t~0_244 (+ v_~t~0_243 2)) (= (mod v_thread2Thread1of1ForFork1_~cond~1_179 256) 0) (= (ite (= (ite (or .cse0 (< 0 (mod v_~s~0_361 4294967296))) 1 0) 0) 0 1) v_thread1Thread1of1ForFork0_~cond~0_137) (= |v_thread2Thread1of1ForFork1_#res.base_62| 0) (= (+ 2 v_~s~0_362) v_~s~0_361))) InVars {~s~0=v_~s~0_362, ~t~0=v_~t~0_244} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_62|, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_82|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_100|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_179, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_62|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_137, ~s~0=v_~s~0_361, ~t~0=v_~t~0_243} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_~cond~1, thread2Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork0_~cond~0, ~s~0, ~t~0] and [362] L53-->L53: Formula: (and (= (ite (= (ite (or (< 0 (mod v_~s~0_385 4294967296)) (< 0 (mod v_~t~0_259 4294967296))) 1 0) 0) 0 1) v_thread1Thread1of1ForFork0_~cond~0_147) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_148 256) 0)) (let ((.cse0 (< 0 (mod v_~s~0_386 4294967296)))) (or (and (= v_~m~0_207 (+ v_~m~0_208 1)) (= (+ v_~s~0_385 1) v_~s~0_386) .cse0) (and (= |v_thread1Thread1of1ForFork0_#t~post1_164| |v_thread1Thread1of1ForFork0_#t~post1_163|) (= |v_thread1Thread1of1ForFork0_#t~post2_164| |v_thread1Thread1of1ForFork0_#t~post2_163|) (= v_~s~0_386 v_~s~0_385) (= v_~m~0_208 v_~m~0_207) (not .cse0))))) InVars {~m~0=v_~m~0_208, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_164|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_164|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_148, ~s~0=v_~s~0_386, ~t~0=v_~t~0_259} OutVars{~m~0=v_~m~0_207, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_163|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_163|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_147, ~s~0=v_~s~0_385, ~t~0=v_~t~0_259} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~cond~0, ~s~0] [2022-12-06 07:37:27,341 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [212] $Ultimate##0-->L53: Formula: (= v_thread1Thread1of1ForFork0_~cond~0_1 (ite (= (ite (or (< 0 (mod v_~s~0_1 4294967296)) (< 0 (mod v_~t~0_1 4294967296))) 1 0) 0) 0 1)) InVars {~s~0=v_~s~0_1, ~t~0=v_~t~0_1} OutVars{thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_1, ~s~0=v_~s~0_1, ~t~0=v_~t~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0] and [269] L66-->L72: Formula: (and (= v_~t~0_36 (+ v_~t~0_35 1)) (= (ite (= (ite (< 0 (mod v_~t~0_35 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_15)) InVars {~t~0=v_~t~0_36} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_7|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_15, ~t~0=v_~t~0_35} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~cond~1, ~t~0] [2022-12-06 07:37:27,366 WARN L322 ript$VariableManager]: TermVariable LBE20 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:27,366 WARN L322 ript$VariableManager]: TermVariable LBE130 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:27,541 WARN L322 ript$VariableManager]: TermVariable LBE20 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:27,541 WARN L322 ript$VariableManager]: TermVariable LBE130 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:27,722 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [300] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_In_1, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [281] L53-->L46-1: Formula: (and (let ((.cse0 (< 0 (mod v_~s~0_64 4294967296)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post2_8| |v_thread1Thread1of1ForFork0_#t~post2_7|) (not .cse0) (= v_~s~0_64 v_~s~0_63) (= |v_thread1Thread1of1ForFork0_#t~post1_8| |v_thread1Thread1of1ForFork0_#t~post1_7|) (= v_~m~0_36 v_~m~0_35)) (and .cse0 (= v_~s~0_64 (+ v_~s~0_63 1)) (= (+ v_~m~0_36 1) v_~m~0_35)))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_17 256) 0))) InVars {~m~0=v_~m~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_8|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_64} OutVars{~m~0=v_~m~0_35, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_7|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_7|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_17, ~s~0=v_~s~0_63} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~s~0] [2022-12-06 07:37:27,852 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [366] $Ultimate##0-->L66: Formula: (and (= (ite (= (ite (< 0 (mod v_~t~0_273 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_191) (= (+ 3 v_~s~0_403) v_~s~0_401) (not (= (mod (ite (= 0 (ite (< 0 (mod v_~t~0_274 4294967296)) 1 0)) 0 1) 256) 0)) (not (= (mod v_thread2Thread1of1ForFork1_~cond~1_191 256) 0)) (= v_~t~0_274 (+ v_~t~0_273 2)) (not (= (mod (ite (= (ite (< 0 (mod (+ v_~t~0_273 1) 4294967296)) 1 0) 0) 0 1) 256) 0))) InVars {~s~0=v_~s~0_403, ~t~0=v_~t~0_274} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_94|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_110|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_191, ~s~0=v_~s~0_401, ~t~0=v_~t~0_273} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_~cond~1, ~s~0, ~t~0] and [374] $Ultimate##0-->L46-1: Formula: (let ((.cse0 (< 0 (mod v_~s~0_448 4294967296)))) (and (= (ite (= (ite (or .cse0 (< 0 (mod v_~t~0_301 4294967296))) 1 0) 0) 0 1) v_thread1Thread1of1ForFork0_~cond~0_169) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_169 256) 0)) (or (and (= v_~m~0_239 (+ v_~m~0_240 1)) (= (+ v_~s~0_447 1) v_~s~0_448) .cse0) (and (= |v_thread1Thread1of1ForFork0_#t~post2_196| |v_thread1Thread1of1ForFork0_#t~post2_195|) (not .cse0) (= v_~s~0_448 v_~s~0_447) (= |v_thread1Thread1of1ForFork0_#t~post1_196| |v_thread1Thread1of1ForFork0_#t~post1_195|) (= v_~m~0_239 v_~m~0_240))))) InVars {~m~0=v_~m~0_240, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_196|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_196|, ~s~0=v_~s~0_448, ~t~0=v_~t~0_301} OutVars{~m~0=v_~m~0_239, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_195|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_195|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_169, ~s~0=v_~s~0_447, ~t~0=v_~t~0_301} AuxVars[] AssignedVars[~m~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~cond~0, ~s~0] [2022-12-06 07:37:28,113 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [366] $Ultimate##0-->L66: Formula: (and (= (ite (= (ite (< 0 (mod v_~t~0_273 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_191) (= (+ 3 v_~s~0_403) v_~s~0_401) (not (= (mod (ite (= 0 (ite (< 0 (mod v_~t~0_274 4294967296)) 1 0)) 0 1) 256) 0)) (not (= (mod v_thread2Thread1of1ForFork1_~cond~1_191 256) 0)) (= v_~t~0_274 (+ v_~t~0_273 2)) (not (= (mod (ite (= (ite (< 0 (mod (+ v_~t~0_273 1) 4294967296)) 1 0) 0) 0 1) 256) 0))) InVars {~s~0=v_~s~0_403, ~t~0=v_~t~0_274} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_94|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_110|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_191, ~s~0=v_~s~0_401, ~t~0=v_~t~0_273} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_~cond~1, ~s~0, ~t~0] and [375] $Ultimate##0-->L72: Formula: (and (= (ite (= (ite (< 0 (mod v_~t~0_303 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_215) (= v_~t~0_304 (+ v_~t~0_303 1)) (= (ite (= (ite (or (< 0 (mod v_~s~0_451 4294967296)) (< 0 (mod v_~t~0_304 4294967296))) 1 0) 0) 0 1) v_thread1Thread1of1ForFork0_~cond~0_171)) InVars {~t~0=v_~t~0_304, ~s~0=v_~s~0_451} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_108|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_215, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_171, ~t~0=v_~t~0_303, ~s~0=v_~s~0_451} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~cond~1, thread1Thread1of1ForFork0_~cond~0, ~t~0] [2022-12-06 07:37:28,331 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [358] $Ultimate##0-->L46-1: Formula: (let ((.cse2 (+ 2 v_~s~0_367))) (let ((.cse0 (< 0 (mod v_~t~0_247 4294967296))) (.cse1 (< 0 (mod .cse2 4294967296)))) (and (= v_~t~0_248 (+ v_~t~0_247 2)) (= v_thread1Thread1of1ForFork0_~cond~0_139 (ite (= (ite (or .cse0 .cse1) 1 0) 0) 0 1)) (= (ite (= (ite .cse0 1 0) 0) 0 1) v_thread2Thread1of1ForFork1_~cond~1_181) (or (and (not .cse1) (= |v_thread1Thread1of1ForFork0_#t~post2_152| |v_thread1Thread1of1ForFork0_#t~post2_151|) (= |v_thread1Thread1of1ForFork0_#t~post1_152| |v_thread1Thread1of1ForFork0_#t~post1_151|) (= v_~m~0_196 v_~m~0_195) (= .cse2 v_~s~0_365)) (and (= v_~m~0_195 (+ v_~m~0_196 1)) .cse1 (= (+ v_~s~0_367 1) v_~s~0_365))) (not (= (mod v_thread1Thread1of1ForFork0_~cond~0_139 256) 0)) (not (= 0 (mod (ite (= (ite (< 0 (mod v_~t~0_248 4294967296)) 1 0) 0) 0 1) 256))) (not (= (mod (ite (= (ite (< 0 (mod (+ v_~t~0_247 1) 4294967296)) 1 0) 0) 0 1) 256) 0))))) InVars {~m~0=v_~m~0_196, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_152|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_152|, ~s~0=v_~s~0_367, ~t~0=v_~t~0_248} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_84|, ~m~0=v_~m~0_195, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_102|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_151|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_181, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_151|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_139, ~s~0=v_~s~0_365, ~t~0=v_~t~0_247} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, ~m~0, thread2Thread1of1ForFork1_#t~post3, thread1Thread1of1ForFork0_#t~post1, thread2Thread1of1ForFork1_~cond~1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~cond~0, ~s~0, ~t~0] and [244] L72-->L66: Formula: (and (not (= (mod v_thread2Thread1of1ForFork1_~cond~1_11 256) 0)) (= v_~s~0_31 (+ v_~s~0_32 1))) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_11, ~s~0=v_~s~0_32} OutVars{thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_5|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_11, ~s~0=v_~s~0_31} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post3, ~s~0] [2022-12-06 07:37:28,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 07:37:28,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:37:28,804 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IndexOutOfBoundsException: Index 14 out of bounds for length 14 at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70) at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:248) at java.base/java.util.Objects.checkIndex(Objects.java:372) at java.base/java.util.ArrayList.get(ArrayList.java:459) at de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetRun.getTransition(PetriNetRun.java:125) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.adaptRun(ChoiceRule.java:163) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.applyInternal(ChoiceRule.java:115) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.choiceRuleWrapper(LiptonReduction.java:239) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:200) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 07:37:28,806 INFO L158 Benchmark]: Toolchain (without parser) took 75205.49ms. Allocated memory was 196.1MB in the beginning and 343.9MB in the end (delta: 147.8MB). Free memory was 171.9MB in the beginning and 256.6MB in the end (delta: -84.7MB). Peak memory consumption was 206.8MB. Max. memory is 8.0GB. [2022-12-06 07:37:28,806 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 196.1MB. Free memory was 172.5MB in the beginning and 172.4MB in the end (delta: 91.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:37:28,806 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.48ms. Allocated memory is still 196.1MB. Free memory was 171.4MB in the beginning and 158.3MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 07:37:28,806 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.07ms. Allocated memory is still 196.1MB. Free memory was 158.3MB in the beginning and 156.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:37:28,807 INFO L158 Benchmark]: Boogie Preprocessor took 31.99ms. Allocated memory is still 196.1MB. Free memory was 156.7MB in the beginning and 155.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:37:28,807 INFO L158 Benchmark]: RCFGBuilder took 385.40ms. Allocated memory is still 196.1MB. Free memory was 155.1MB in the beginning and 139.9MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 07:37:28,807 INFO L158 Benchmark]: TraceAbstraction took 74555.99ms. Allocated memory was 196.1MB in the beginning and 343.9MB in the end (delta: 147.8MB). Free memory was 139.4MB in the beginning and 256.6MB in the end (delta: -117.2MB). Peak memory consumption was 174.3MB. Max. memory is 8.0GB. [2022-12-06 07:37:28,808 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.10ms. Allocated memory is still 196.1MB. Free memory was 172.5MB in the beginning and 172.4MB in the end (delta: 91.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 194.48ms. Allocated memory is still 196.1MB. Free memory was 171.4MB in the beginning and 158.3MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.07ms. Allocated memory is still 196.1MB. Free memory was 158.3MB in the beginning and 156.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.99ms. Allocated memory is still 196.1MB. Free memory was 156.7MB in the beginning and 155.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 385.40ms. Allocated memory is still 196.1MB. Free memory was 155.1MB in the beginning and 139.9MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 74555.99ms. Allocated memory was 196.1MB in the beginning and 343.9MB in the end (delta: 147.8MB). Free memory was 139.4MB in the beginning and 256.6MB in the end (delta: -117.2MB). Peak memory consumption was 174.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 72 PlacesBefore, 22 PlacesAfterwards, 71 TransitionsBefore, 17 TransitionsAfterwards, 396 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 14 ConcurrentYvCompositions, 4 ChoiceCompositions, 54 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 188, independent: 179, independent conditional: 179, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 188, independent: 179, independent conditional: 0, independent unconditional: 179, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 188, independent: 179, independent conditional: 0, independent unconditional: 179, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 188, independent: 179, independent conditional: 0, independent unconditional: 179, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 177, independent: 172, independent conditional: 0, independent unconditional: 172, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 177, independent: 172, independent conditional: 0, independent unconditional: 172, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 188, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 177, unknown conditional: 0, unknown unconditional: 177] , Statistics on independence cache: Total cache size (in pairs): 257, Positive cache size: 252, Positive conditional cache size: 0, Positive unconditional cache size: 252, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, 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, 22 PlacesBefore, 22 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 13, unknown conditional: 3, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 8, Positive conditional cache size: 2, Positive unconditional cache size: 6, Negative cache size: 5, Negative conditional cache size: 1, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 82 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 14, 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: 18, independent: 14, independent conditional: 2, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 14, independent conditional: 2, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 14, independent conditional: 2, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 1, 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: 5, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 18, independent: 9, independent conditional: 1, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 5, unknown conditional: 1, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 13, Positive conditional cache size: 3, Positive unconditional cache size: 10, Negative cache size: 5, Negative conditional cache size: 1, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 15, Positive conditional cache size: 5, Positive unconditional cache size: 10, Negative cache size: 5, Negative conditional cache size: 1, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 102 PlacesBefore, 85 PlacesAfterwards, 165 TransitionsBefore, 149 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 19 ConcurrentYvCompositions, 0 ChoiceCompositions, 21 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, independent: 73, independent conditional: 73, 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: 73, independent: 73, independent conditional: 73, 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: 73, independent: 73, independent conditional: 56, independent unconditional: 17, 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: 73, independent: 73, independent conditional: 56, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 17, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 73, independent: 52, independent conditional: 39, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 21, unknown conditional: 17, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 49, Positive conditional cache size: 23, Positive unconditional cache size: 26, Negative cache size: 5, Negative conditional cache size: 1, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - ExceptionOrErrorResult: IndexOutOfBoundsException: Index 14 out of bounds for length 14 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IndexOutOfBoundsException: Index 14 out of bounds for length 14: java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 07:37:28,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...