/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-channel-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:37:01,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:37:01,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:37:01,724 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:37:01,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:37:01,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:37:01,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:37:01,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:37:01,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:37:01,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:37:01,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:37:01,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:37:01,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:37:01,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:37:01,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:37:01,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:37:01,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:37:01,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:37:01,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:37:01,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:37:01,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:37:01,758 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:37:01,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:37:01,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:37:01,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:37:01,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:37:01,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:37:01,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:37:01,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:37:01,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:37:01,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:37:01,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:37:01,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:37:01,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:37:01,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:37:01,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:37:01,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:37:01,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:37:01,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:37:01,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:37:01,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:37:01,779 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:37:01,808 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:37:01,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:37:01,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:37:01,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:37:01,810 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:37:01,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:37:01,811 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:37:01,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:37:01,812 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:37:01,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:37:01,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:37:01,813 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:37:01,813 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:37:01,813 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:37:01,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:37:01,813 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:37:01,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:37:01,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:37:01,814 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:37:01,814 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:37:01,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:37:01,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:37:01,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:37:01,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:37:01,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:37:01,815 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:37:01,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:37:01,815 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:37:01,815 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:37:02,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:37:02,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:37:02,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:37:02,161 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:37:02,161 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:37:02,162 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2022-12-06 07:37:03,258 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:37:03,488 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:37:03,489 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2022-12-06 07:37:03,494 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e78ec6716/37f5817cbf2d47e18d39db5ccc191f71/FLAG365df7619 [2022-12-06 07:37:03,505 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e78ec6716/37f5817cbf2d47e18d39db5ccc191f71 [2022-12-06 07:37:03,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:37:03,507 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:37:03,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:37:03,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:37:03,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:37:03,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:37:03" (1/1) ... [2022-12-06 07:37:03,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f545f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:03, skipping insertion in model container [2022-12-06 07:37:03,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:37:03" (1/1) ... [2022-12-06 07:37:03,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:37:03,539 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:37:03,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:37:03,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:37:03,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:37:03,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:37:03,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:37:03,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:37:03,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:37:03,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:37:03,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:37:03,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:37:03,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:37:03,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:37:03,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:37:03,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:37:03,701 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-channel-sum.wvr.c[2947,2960] [2022-12-06 07:37:03,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:37:03,726 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:37:03,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:37:03,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:37:03,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:37:03,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:37:03,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:37:03,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:37:03,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:37:03,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:37:03,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:37:03,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:37:03,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:37:03,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:37:03,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:37:03,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:37:03,766 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-channel-sum.wvr.c[2947,2960] [2022-12-06 07:37:03,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:37:03,782 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:37:03,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:03 WrapperNode [2022-12-06 07:37:03,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:37:03,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:37:03,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:37:03,785 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:37:03,791 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:37:03" (1/1) ... [2022-12-06 07:37:03,806 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:37:03" (1/1) ... [2022-12-06 07:37:03,836 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 151 [2022-12-06 07:37:03,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:37:03,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:37:03,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:37:03,837 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:37:03,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:03" (1/1) ... [2022-12-06 07:37:03,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:03" (1/1) ... [2022-12-06 07:37:03,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:03" (1/1) ... [2022-12-06 07:37:03,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:03" (1/1) ... [2022-12-06 07:37:03,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:03" (1/1) ... [2022-12-06 07:37:03,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:03" (1/1) ... [2022-12-06 07:37:03,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:37:03" (1/1) ... [2022-12-06 07:37:03,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:37:03" (1/1) ... [2022-12-06 07:37:03,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:37:03,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:37:03,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:37:03,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:37:03,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:03" (1/1) ... [2022-12-06 07:37:03,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:37:03,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:37:03,897 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:37:03,914 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:37:03,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:37:03,936 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:37:03,936 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:37:03,936 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:37:03,936 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:37:03,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:37:03,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:37:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:37:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:37:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:37:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:37:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:37:03,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:37:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:37:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:37:03,938 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:37:04,085 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:37:04,086 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:37:04,376 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:37:04,424 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:37:04,425 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 07:37:04,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:37:04 BoogieIcfgContainer [2022-12-06 07:37:04,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:37:04,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:37:04,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:37:04,432 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:37:04,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:37:03" (1/3) ... [2022-12-06 07:37:04,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc899c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:37:04, skipping insertion in model container [2022-12-06 07:37:04,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:37:03" (2/3) ... [2022-12-06 07:37:04,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc899c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:37:04, skipping insertion in model container [2022-12-06 07:37:04,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:37:04" (3/3) ... [2022-12-06 07:37:04,434 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2022-12-06 07:37:04,450 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:37:04,450 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:37:04,450 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:37:04,513 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:37:04,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 131 transitions, 278 flow [2022-12-06 07:37:04,683 INFO L130 PetriNetUnfolder]: 11/129 cut-off events. [2022-12-06 07:37:04,683 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:37:04,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 129 events. 11/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 123 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-06 07:37:04,689 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 131 transitions, 278 flow [2022-12-06 07:37:04,696 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 121 transitions, 254 flow [2022-12-06 07:37:04,698 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:04,713 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 121 transitions, 254 flow [2022-12-06 07:37:04,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 121 transitions, 254 flow [2022-12-06 07:37:04,777 INFO L130 PetriNetUnfolder]: 11/121 cut-off events. [2022-12-06 07:37:04,777 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:37:04,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 121 events. 11/121 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 122 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-06 07:37:04,782 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 121 transitions, 254 flow [2022-12-06 07:37:04,782 INFO L188 LiptonReduction]: Number of co-enabled transitions 1242 [2022-12-06 07:37:10,158 INFO L203 LiptonReduction]: Total number of compositions: 103 [2022-12-06 07:37:10,172 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:37:10,177 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;@422139c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:37:10,178 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 07:37:10,182 INFO L130 PetriNetUnfolder]: 4/18 cut-off events. [2022-12-06 07:37:10,182 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:37:10,183 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:10,183 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:37:10,184 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:37:10,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:10,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1602862863, now seen corresponding path program 1 times [2022-12-06 07:37:10,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:10,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325736833] [2022-12-06 07:37:10,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:10,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:10,634 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:37:10,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:10,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325736833] [2022-12-06 07:37:10,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325736833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:10,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:10,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:37:10,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709117108] [2022-12-06 07:37:10,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:10,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:37:10,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:10,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:37:10,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:37:10,667 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2022-12-06 07:37:10,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:10,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:10,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2022-12-06 07:37:10,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:10,737 INFO L130 PetriNetUnfolder]: 64/121 cut-off events. [2022-12-06 07:37:10,737 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 07:37:10,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 121 events. 64/121 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 350 event pairs, 13 based on Foata normal form. 1/84 useless extension candidates. Maximal degree in co-relation 170. Up to 66 conditions per place. [2022-12-06 07:37:10,739 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 19 selfloop transitions, 2 changer transitions 4/28 dead transitions. [2022-12-06 07:37:10,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 28 transitions, 127 flow [2022-12-06 07:37:10,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:37:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:37:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 07:37:10,749 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6491228070175439 [2022-12-06 07:37:10,750 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 50 flow. Second operand 3 states and 37 transitions. [2022-12-06 07:37:10,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 28 transitions, 127 flow [2022-12-06 07:37:10,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 28 transitions, 113 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 07:37:10,755 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 52 flow [2022-12-06 07:37:10,757 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2022-12-06 07:37:10,760 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2022-12-06 07:37:10,760 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:10,761 INFO L89 Accepts]: Start accepts. Operand has 21 places, 19 transitions, 52 flow [2022-12-06 07:37:10,764 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:10,767 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:10,773 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 19 transitions, 52 flow [2022-12-06 07:37:10,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 19 transitions, 52 flow [2022-12-06 07:37:10,779 INFO L130 PetriNetUnfolder]: 3/23 cut-off events. [2022-12-06 07:37:10,780 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:37:10,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 23 events. 3/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 16. Up to 4 conditions per place. [2022-12-06 07:37:10,780 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 19 transitions, 52 flow [2022-12-06 07:37:10,780 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 07:37:10,794 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:37:10,796 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 07:37:10,797 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 52 flow [2022-12-06 07:37:10,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:10,797 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:10,797 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:37:10,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:37:10,798 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:37:10,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:10,798 INFO L85 PathProgramCache]: Analyzing trace with hash -729500201, now seen corresponding path program 1 times [2022-12-06 07:37:10,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:10,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126047765] [2022-12-06 07:37:10,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:10,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:10,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:10,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126047765] [2022-12-06 07:37:10,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126047765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:10,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:10,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:37:10,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728779259] [2022-12-06 07:37:10,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:10,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:10,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:10,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:10,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:10,951 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 07:37:10,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:10,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:10,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 07:37:10,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:11,016 INFO L130 PetriNetUnfolder]: 68/129 cut-off events. [2022-12-06 07:37:11,016 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 07:37:11,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 129 events. 68/129 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 348 event pairs, 9 based on Foata normal form. 6/110 useless extension candidates. Maximal degree in co-relation 171. Up to 88 conditions per place. [2022-12-06 07:37:11,017 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 21 selfloop transitions, 4 changer transitions 6/32 dead transitions. [2022-12-06 07:37:11,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 32 transitions, 143 flow [2022-12-06 07:37:11,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:11,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:11,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-06 07:37:11,019 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2022-12-06 07:37:11,019 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 52 flow. Second operand 4 states and 35 transitions. [2022-12-06 07:37:11,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 32 transitions, 143 flow [2022-12-06 07:37:11,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 32 transitions, 141 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:37:11,020 INFO L231 Difference]: Finished difference. Result has 25 places, 22 transitions, 75 flow [2022-12-06 07:37:11,021 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=75, PETRI_PLACES=25, PETRI_TRANSITIONS=22} [2022-12-06 07:37:11,021 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 3 predicate places. [2022-12-06 07:37:11,021 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:11,022 INFO L89 Accepts]: Start accepts. Operand has 25 places, 22 transitions, 75 flow [2022-12-06 07:37:11,022 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:11,022 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:11,023 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 22 transitions, 75 flow [2022-12-06 07:37:11,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 22 transitions, 75 flow [2022-12-06 07:37:11,028 INFO L130 PetriNetUnfolder]: 5/30 cut-off events. [2022-12-06 07:37:11,028 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:37:11,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 30 events. 5/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 32. Up to 5 conditions per place. [2022-12-06 07:37:11,029 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 22 transitions, 75 flow [2022-12-06 07:37:11,029 INFO L188 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-06 07:37:11,142 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:11,143 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-06 07:37:11,144 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 21 transitions, 73 flow [2022-12-06 07:37:11,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:11,144 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:11,144 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:37:11,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:37:11,144 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:37:11,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:11,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1786759989, now seen corresponding path program 1 times [2022-12-06 07:37:11,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:11,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749405030] [2022-12-06 07:37:11,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:11,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:37:11,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:11,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749405030] [2022-12-06 07:37:11,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749405030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:37:11,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:37:11,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:37:11,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552105805] [2022-12-06 07:37:11,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:37:11,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:37:11,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:11,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:37:11,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:37:11,266 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 18 [2022-12-06 07:37:11,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 21 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:11,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:11,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 18 [2022-12-06 07:37:11,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:11,338 INFO L130 PetriNetUnfolder]: 62/137 cut-off events. [2022-12-06 07:37:11,338 INFO L131 PetriNetUnfolder]: For 49/58 co-relation queries the response was YES. [2022-12-06 07:37:11,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 137 events. 62/137 cut-off events. For 49/58 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 478 event pairs, 42 based on Foata normal form. 17/151 useless extension candidates. Maximal degree in co-relation 232. Up to 103 conditions per place. [2022-12-06 07:37:11,340 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 17 selfloop transitions, 2 changer transitions 10/32 dead transitions. [2022-12-06 07:37:11,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 32 transitions, 157 flow [2022-12-06 07:37:11,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:37:11,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:37:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 07:37:11,341 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 07:37:11,341 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 73 flow. Second operand 4 states and 36 transitions. [2022-12-06 07:37:11,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 32 transitions, 157 flow [2022-12-06 07:37:11,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 32 transitions, 157 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 07:37:11,343 INFO L231 Difference]: Finished difference. Result has 29 places, 22 transitions, 89 flow [2022-12-06 07:37:11,343 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=29, PETRI_TRANSITIONS=22} [2022-12-06 07:37:11,344 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 7 predicate places. [2022-12-06 07:37:11,344 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:11,344 INFO L89 Accepts]: Start accepts. Operand has 29 places, 22 transitions, 89 flow [2022-12-06 07:37:11,347 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:11,347 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:11,347 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 22 transitions, 89 flow [2022-12-06 07:37:11,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 22 transitions, 89 flow [2022-12-06 07:37:11,354 INFO L130 PetriNetUnfolder]: 5/30 cut-off events. [2022-12-06 07:37:11,355 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:37:11,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 30 events. 5/30 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 47. Up to 5 conditions per place. [2022-12-06 07:37:11,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 22 transitions, 89 flow [2022-12-06 07:37:11,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 68 [2022-12-06 07:37:12,292 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:37:12,294 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 950 [2022-12-06 07:37:12,294 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 85 flow [2022-12-06 07:37:12,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:12,299 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:12,299 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:37:12,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:37:12,299 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:37:12,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:12,300 INFO L85 PathProgramCache]: Analyzing trace with hash -902540002, now seen corresponding path program 1 times [2022-12-06 07:37:12,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:12,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932729074] [2022-12-06 07:37:12,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:12,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:12,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:12,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932729074] [2022-12-06 07:37:12,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932729074] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:37:12,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966730728] [2022-12-06 07:37:12,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:12,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:37:12,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:37:12,444 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:37:12,445 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:37:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:12,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 07:37:12,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:37:12,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 116 [2022-12-06 07:37:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:12,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:37:12,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2022-12-06 07:37:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:37:12,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966730728] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:37:12,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:37:12,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 9 [2022-12-06 07:37:12,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158445689] [2022-12-06 07:37:12,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:37:12,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 07:37:12,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:12,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 07:37:12,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-06 07:37:12,956 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 07:37:12,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 85 flow. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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:37:12,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:12,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 07:37:12,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:13,092 INFO L130 PetriNetUnfolder]: 86/169 cut-off events. [2022-12-06 07:37:13,092 INFO L131 PetriNetUnfolder]: For 82/84 co-relation queries the response was YES. [2022-12-06 07:37:13,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 169 events. 86/169 cut-off events. For 82/84 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 533 event pairs, 9 based on Foata normal form. 10/178 useless extension candidates. Maximal degree in co-relation 420. Up to 39 conditions per place. [2022-12-06 07:37:13,093 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 19 selfloop transitions, 3 changer transitions 25/48 dead transitions. [2022-12-06 07:37:13,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 48 transitions, 246 flow [2022-12-06 07:37:13,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:37:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:37:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-12-06 07:37:13,094 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 07:37:13,095 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 85 flow. Second operand 7 states and 56 transitions. [2022-12-06 07:37:13,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 48 transitions, 246 flow [2022-12-06 07:37:13,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 48 transitions, 234 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 07:37:13,097 INFO L231 Difference]: Finished difference. Result has 32 places, 19 transitions, 74 flow [2022-12-06 07:37:13,097 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=74, PETRI_PLACES=32, PETRI_TRANSITIONS=19} [2022-12-06 07:37:13,097 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 10 predicate places. [2022-12-06 07:37:13,098 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:13,098 INFO L89 Accepts]: Start accepts. Operand has 32 places, 19 transitions, 74 flow [2022-12-06 07:37:13,098 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:13,098 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:13,099 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 19 transitions, 74 flow [2022-12-06 07:37:13,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 19 transitions, 74 flow [2022-12-06 07:37:13,103 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-06 07:37:13,103 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 07:37:13,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 25 events. 4/25 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 29. Up to 4 conditions per place. [2022-12-06 07:37:13,103 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 19 transitions, 74 flow [2022-12-06 07:37:13,103 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 07:37:13,104 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:37:13,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 07:37:13,105 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 74 flow [2022-12-06 07:37:13,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 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:37:13,105 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:37:13,105 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:37:13,114 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:37:13,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:37:13,312 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:37:13,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:37:13,312 INFO L85 PathProgramCache]: Analyzing trace with hash -456533050, now seen corresponding path program 2 times [2022-12-06 07:37:13,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:37:13,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758483640] [2022-12-06 07:37:13,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:37:13,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:37:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:37:14,204 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:37:14,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:37:14,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758483640] [2022-12-06 07:37:14,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758483640] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:37:14,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135797307] [2022-12-06 07:37:14,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:37:14,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:37:14,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:37:14,206 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:37:14,209 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:37:14,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:37:14,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:37:14,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-06 07:37:14,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:37:14,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-06 07:37:14,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:37:14,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:37:14,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 07:37:14,544 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:37:14,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:37:15,162 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:37:15,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135797307] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:37:15,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:37:15,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2022-12-06 07:37:15,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080422804] [2022-12-06 07:37:15,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:37:15,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 07:37:15,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:37:15,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 07:37:15,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=318, Unknown=5, NotChecked=0, Total=420 [2022-12-06 07:37:15,164 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 07:37:15,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 74 flow. Second operand has 21 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:37:15,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:37:15,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 07:37:15,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:37:16,039 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~back~0 4))) (let ((.cse5 (* c_~front~0 4)) (.cse18 (select |c_#memory_int| c_~queue~0.base)) (.cse10 (+ c_~queue~0.offset .cse4))) (let ((.cse15 (select .cse18 .cse10)) (.cse11 (+ c_~queue~0.offset .cse5))) (let ((.cse6 (not (< c_~front~0 (+ c_~back~0 1)))) (.cse7 (not (< c_~back~0 c_~n~0))) (.cse16 (let ((.cse17 (+ c_~sum~0 (select .cse18 .cse11)))) (and (not (< .cse17 0)) (not (< 1 .cse17))))) (.cse14 (not (= .cse15 1))) (.cse8 (not (<= 0 c_~back~0)))) (and (or (let ((.cse1 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_102 (Array Int Int)) (v_ArrVal_103 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_102) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_103) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< (+ (select .cse0 .cse1) c_~sum~0) 0)) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_102 (Array Int Int)) (v_ArrVal_103 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_102) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_103) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< 1 (+ (select .cse3 .cse1) c_~sum~0))) (not (= (select .cse3 .cse2) 1))))))) .cse6 (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse7 .cse8) (not (< 1 c_~sum~0)) (or .cse6 .cse7 .cse8 (and (forall ((v_ArrVal_103 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_103) c_~queue~0.base))) (or (not (= (select .cse9 .cse10) 1)) (not (< (+ c_~sum~0 (select .cse9 .cse11)) 0))))) (forall ((v_ArrVal_103 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_103) c_~queue~0.base))) (or (not (< 1 (+ c_~sum~0 (select .cse12 .cse11)))) (not (= (select .cse12 .cse10) 1))))))) (not (< c_~sum~0 0)) (or (let ((.cse13 (= (mod |c_thread2Thread1of1ForFork1_~flag~0#1| 256) 0))) (and (or .cse6 .cse13 .cse7 .cse14 .cse8) (or .cse6 (not .cse13) .cse7 (not (= (+ .cse15 1) 0)) .cse8))) .cse16) (or .cse6 .cse7 .cse16 .cse14 .cse8)))))) is different from false [2022-12-06 07:37:16,318 INFO L130 PetriNetUnfolder]: 163/326 cut-off events. [2022-12-06 07:37:16,319 INFO L131 PetriNetUnfolder]: For 270/270 co-relation queries the response was YES. [2022-12-06 07:37:16,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 326 events. 163/326 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1189 event pairs, 8 based on Foata normal form. 17/340 useless extension candidates. Maximal degree in co-relation 357. Up to 67 conditions per place. [2022-12-06 07:37:16,321 INFO L137 encePairwiseOnDemand]: 5/18 looper letters, 63 selfloop transitions, 32 changer transitions 19/114 dead transitions. [2022-12-06 07:37:16,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 114 transitions, 618 flow [2022-12-06 07:37:16,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 07:37:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 07:37:16,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 120 transitions. [2022-12-06 07:37:16,323 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30303030303030304 [2022-12-06 07:37:16,323 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 74 flow. Second operand 22 states and 120 transitions. [2022-12-06 07:37:16,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 114 transitions, 618 flow [2022-12-06 07:37:16,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 114 transitions, 586 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 07:37:16,326 INFO L231 Difference]: Finished difference. Result has 50 places, 52 transitions, 320 flow [2022-12-06 07:37:16,327 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=320, PETRI_PLACES=50, PETRI_TRANSITIONS=52} [2022-12-06 07:37:16,327 INFO L294 CegarLoopForPetriNet]: 22 programPoint places, 28 predicate places. [2022-12-06 07:37:16,327 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:37:16,327 INFO L89 Accepts]: Start accepts. Operand has 50 places, 52 transitions, 320 flow [2022-12-06 07:37:16,328 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:37:16,328 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:37:16,329 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 52 transitions, 320 flow [2022-12-06 07:37:16,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 52 transitions, 320 flow [2022-12-06 07:37:16,341 INFO L130 PetriNetUnfolder]: 41/124 cut-off events. [2022-12-06 07:37:16,341 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-12-06 07:37:16,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 124 events. 41/124 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 423 event pairs, 9 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 307. Up to 45 conditions per place. [2022-12-06 07:37:16,343 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 52 transitions, 320 flow [2022-12-06 07:37:16,343 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-06 07:37:20,519 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [544] L57-->L57: Formula: (and (= (+ v_~front~0_117 1) v_~front~0_116) (= (ite (and (< v_~front~0_117 v_~n~0_87) (<= 0 v_~front~0_117)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (= v_~sum~0_92 (+ v_~element~0_69 v_~sum~0_93)) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_47| 256) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (= v_~element~0_69 (select (select |v_#memory_int_162| v_~queue~0.base_113) (+ (* v_~front~0_117 4) v_~queue~0.offset_113))) (= (ite (= (ite (< v_~front~0_116 v_~back~0_124) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~cond~0#1_46|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| 0))) InVars {~sum~0=v_~sum~0_93, ~queue~0.offset=v_~queue~0.offset_113, ~back~0=v_~back~0_124, #memory_int=|v_#memory_int_162|, ~queue~0.base=v_~queue~0.base_113, ~n~0=v_~n~0_87, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_47|, ~front~0=v_~front~0_117} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_44|, ~queue~0.offset=v_~queue~0.offset_113, ~back~0=v_~back~0_124, ~queue~0.base=v_~queue~0.base_113, ~sum~0=v_~sum~0_92, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|, ~element~0=v_~element~0_69, #memory_int=|v_#memory_int_162|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50|, ~n~0=v_~n~0_87, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_46|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_56|, ~front~0=v_~front~0_116} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~element~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] and [540] L65-4-->thread2EXIT: Formula: (and (= (mod |v_thread2Thread1of1ForFork1_#t~nondet3#1_In_1| 256) 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_6| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_6| 0)) InVars {thread2Thread1of1ForFork1_#t~nondet3#1=|v_thread2Thread1of1ForFork1_#t~nondet3#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_6|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~nondet3#1] [2022-12-06 07:37:20,629 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [544] L57-->L57: Formula: (and (= (+ v_~front~0_117 1) v_~front~0_116) (= (ite (and (< v_~front~0_117 v_~n~0_87) (<= 0 v_~front~0_117)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (= v_~sum~0_92 (+ v_~element~0_69 v_~sum~0_93)) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_47| 256) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (= v_~element~0_69 (select (select |v_#memory_int_162| v_~queue~0.base_113) (+ (* v_~front~0_117 4) v_~queue~0.offset_113))) (= (ite (= (ite (< v_~front~0_116 v_~back~0_124) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~cond~0#1_46|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| 0))) InVars {~sum~0=v_~sum~0_93, ~queue~0.offset=v_~queue~0.offset_113, ~back~0=v_~back~0_124, #memory_int=|v_#memory_int_162|, ~queue~0.base=v_~queue~0.base_113, ~n~0=v_~n~0_87, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_47|, ~front~0=v_~front~0_117} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_44|, ~queue~0.offset=v_~queue~0.offset_113, ~back~0=v_~back~0_124, ~queue~0.base=v_~queue~0.base_113, ~sum~0=v_~sum~0_92, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|, ~element~0=v_~element~0_69, #memory_int=|v_#memory_int_162|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50|, ~n~0=v_~n~0_87, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_46|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_56|, ~front~0=v_~front~0_116} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~element~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] and [541] L65-4-->L65-4: Formula: (let ((.cse5 (= (mod |v_thread2Thread1of1ForFork1_~flag~0#1_In_5| 256) 0))) (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet3#1_In_3| 256) 0))) (.cse1 (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10| 0))) (.cse2 (= (ite (= (ite .cse5 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~flag~0#1_Out_8|)) (.cse3 (select (select |v_#memory_int_In_25| v_~queue~0.base_In_9) (+ (* v_~back~0_In_8 4) v_~queue~0.offset_In_9))) (.cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|)) (.cse6 (= v_~back~0_Out_22 (+ v_~back~0_In_8 1))) (.cse7 (not (= (ite (and (< v_~back~0_In_8 v_~n~0_In_5) (<= 0 v_~back~0_In_8)) 1 0) 0)))) (or (and .cse0 (= |v_thread2Thread1of1ForFork1_#t~mem4#1_Out_8| |v_thread2Thread1of1ForFork1_#t~mem4#1_In_3|) .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~post5#1_In_3| |v_thread2Thread1of1ForFork1_#t~post5#1_Out_8|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10| (ite (= (+ .cse3 1) 0) 1 0)) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4| |v_thread2Thread1of1ForFork1_#t~mem6#1_In_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10| (ite (= .cse3 1) 1 0)) (not .cse5) (= |v_thread2Thread1of1ForFork1_#t~post7#1_Out_6| |v_thread2Thread1of1ForFork1_#t~post7#1_In_1|) .cse4 .cse6 .cse7)))) InVars {thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_In_3|, ~queue~0.offset=v_~queue~0.offset_In_9, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_In_5|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_In_3|, ~back~0=v_~back~0_In_8, #memory_int=|v_#memory_int_In_25|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_9, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_In_1|, thread2Thread1of1ForFork1_#t~nondet3#1=|v_thread2Thread1of1ForFork1_#t~nondet3#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_9, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_Out_8|, ~back~0=v_~back~0_Out_22, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_9, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_6|, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_Out_8|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_Out_8|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~flag~0#1, thread2Thread1of1ForFork1_#t~mem4#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~nondet3#1] [2022-12-06 07:37:21,019 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [544] L57-->L57: Formula: (and (= (+ v_~front~0_117 1) v_~front~0_116) (= (ite (and (< v_~front~0_117 v_~n~0_87) (<= 0 v_~front~0_117)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (= v_~sum~0_92 (+ v_~element~0_69 v_~sum~0_93)) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_47| 256) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (= v_~element~0_69 (select (select |v_#memory_int_162| v_~queue~0.base_113) (+ (* v_~front~0_117 4) v_~queue~0.offset_113))) (= (ite (= (ite (< v_~front~0_116 v_~back~0_124) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~cond~0#1_46|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| 0))) InVars {~sum~0=v_~sum~0_93, ~queue~0.offset=v_~queue~0.offset_113, ~back~0=v_~back~0_124, #memory_int=|v_#memory_int_162|, ~queue~0.base=v_~queue~0.base_113, ~n~0=v_~n~0_87, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_47|, ~front~0=v_~front~0_117} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_44|, ~queue~0.offset=v_~queue~0.offset_113, ~back~0=v_~back~0_124, ~queue~0.base=v_~queue~0.base_113, ~sum~0=v_~sum~0_92, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|, ~element~0=v_~element~0_69, #memory_int=|v_#memory_int_162|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50|, ~n~0=v_~n~0_87, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_46|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_56|, ~front~0=v_~front~0_116} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~element~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] and [530] L100-4-->L101-1: Formula: (= (select (select |v_#memory_int_134| |v_ULTIMATE.start_main_~#t1~0#1.base_33|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) |v_ULTIMATE.start_main_#t~mem15#1_24|) InVars {#memory_int=|v_#memory_int_134|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_33|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_37|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_24|, #memory_int=|v_#memory_int_134|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_33|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-06 07:37:22,283 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [368] $Ultimate##0-->L57: Formula: (= (ite (= (ite (< v_~front~0_1 v_~back~0_1) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~cond~0#1_1|) InVars {~back~0=v_~back~0_1, ~front~0=v_~front~0_1} OutVars{~back~0=v_~back~0_1, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_1|, ~front~0=v_~front~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] and [541] L65-4-->L65-4: Formula: (let ((.cse5 (= (mod |v_thread2Thread1of1ForFork1_~flag~0#1_In_5| 256) 0))) (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet3#1_In_3| 256) 0))) (.cse1 (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10| 0))) (.cse2 (= (ite (= (ite .cse5 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~flag~0#1_Out_8|)) (.cse3 (select (select |v_#memory_int_In_25| v_~queue~0.base_In_9) (+ (* v_~back~0_In_8 4) v_~queue~0.offset_In_9))) (.cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|)) (.cse6 (= v_~back~0_Out_22 (+ v_~back~0_In_8 1))) (.cse7 (not (= (ite (and (< v_~back~0_In_8 v_~n~0_In_5) (<= 0 v_~back~0_In_8)) 1 0) 0)))) (or (and .cse0 (= |v_thread2Thread1of1ForFork1_#t~mem4#1_Out_8| |v_thread2Thread1of1ForFork1_#t~mem4#1_In_3|) .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~post5#1_In_3| |v_thread2Thread1of1ForFork1_#t~post5#1_Out_8|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10| (ite (= (+ .cse3 1) 0) 1 0)) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4| |v_thread2Thread1of1ForFork1_#t~mem6#1_In_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10| (ite (= .cse3 1) 1 0)) (not .cse5) (= |v_thread2Thread1of1ForFork1_#t~post7#1_Out_6| |v_thread2Thread1of1ForFork1_#t~post7#1_In_1|) .cse4 .cse6 .cse7)))) InVars {thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_In_3|, ~queue~0.offset=v_~queue~0.offset_In_9, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_In_5|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_In_3|, ~back~0=v_~back~0_In_8, #memory_int=|v_#memory_int_In_25|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_9, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_In_1|, thread2Thread1of1ForFork1_#t~nondet3#1=|v_thread2Thread1of1ForFork1_#t~nondet3#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_9, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_Out_8|, ~back~0=v_~back~0_Out_22, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_9, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_6|, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_Out_8|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_Out_8|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~flag~0#1, thread2Thread1of1ForFork1_#t~mem4#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~nondet3#1] [2022-12-06 07:37:22,664 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [541] L65-4-->L65-4: Formula: (let ((.cse5 (= (mod |v_thread2Thread1of1ForFork1_~flag~0#1_In_5| 256) 0))) (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet3#1_In_3| 256) 0))) (.cse1 (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10| 0))) (.cse2 (= (ite (= (ite .cse5 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~flag~0#1_Out_8|)) (.cse3 (select (select |v_#memory_int_In_25| v_~queue~0.base_In_9) (+ (* v_~back~0_In_8 4) v_~queue~0.offset_In_9))) (.cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|)) (.cse6 (= v_~back~0_Out_22 (+ v_~back~0_In_8 1))) (.cse7 (not (= (ite (and (< v_~back~0_In_8 v_~n~0_In_5) (<= 0 v_~back~0_In_8)) 1 0) 0)))) (or (and .cse0 (= |v_thread2Thread1of1ForFork1_#t~mem4#1_Out_8| |v_thread2Thread1of1ForFork1_#t~mem4#1_In_3|) .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~post5#1_In_3| |v_thread2Thread1of1ForFork1_#t~post5#1_Out_8|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10| (ite (= (+ .cse3 1) 0) 1 0)) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4| |v_thread2Thread1of1ForFork1_#t~mem6#1_In_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10| (ite (= .cse3 1) 1 0)) (not .cse5) (= |v_thread2Thread1of1ForFork1_#t~post7#1_Out_6| |v_thread2Thread1of1ForFork1_#t~post7#1_In_1|) .cse4 .cse6 .cse7)))) InVars {thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_In_3|, ~queue~0.offset=v_~queue~0.offset_In_9, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_In_5|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_In_3|, ~back~0=v_~back~0_In_8, #memory_int=|v_#memory_int_In_25|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_9, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_In_1|, thread2Thread1of1ForFork1_#t~nondet3#1=|v_thread2Thread1of1ForFork1_#t~nondet3#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_9, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_Out_8|, ~back~0=v_~back~0_Out_22, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_9, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_6|, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_Out_8|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_Out_8|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~flag~0#1, thread2Thread1of1ForFork1_#t~mem4#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~nondet3#1] and [559] $Ultimate##0-->L57: Formula: (and (= v_~element~0_111 (select (select |v_#memory_int_217| v_~queue~0.base_149) (+ (* v_~front~0_181 4) v_~queue~0.offset_149))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_84| 0)) (= (+ v_~front~0_181 1) v_~front~0_180) (not (= (mod (ite (= (ite (< v_~front~0_181 v_~back~0_162) 1 0) 0) 0 1) 256) 0)) (= (ite (= (ite (< v_~front~0_180 v_~back~0_162) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~cond~0#1_95|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_84| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_72|) (= (+ v_~element~0_111 v_~sum~0_156) v_~sum~0_155) (= (ite (and (< v_~front~0_181 v_~n~0_117) (<= 0 v_~front~0_181)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_72|)) InVars {~sum~0=v_~sum~0_156, ~queue~0.offset=v_~queue~0.offset_149, ~back~0=v_~back~0_162, #memory_int=|v_#memory_int_217|, ~queue~0.base=v_~queue~0.base_149, ~n~0=v_~n~0_117, ~front~0=v_~front~0_181} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_78|, ~queue~0.offset=v_~queue~0.offset_149, ~back~0=v_~back~0_162, ~queue~0.base=v_~queue~0.base_149, ~sum~0=v_~sum~0_155, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_72|, ~element~0=v_~element~0_111, #memory_int=|v_#memory_int_217|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_84|, ~n~0=v_~n~0_117, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_95|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_90|, ~front~0=v_~front~0_180} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~element~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] [2022-12-06 07:37:22,926 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [541] L65-4-->L65-4: Formula: (let ((.cse5 (= (mod |v_thread2Thread1of1ForFork1_~flag~0#1_In_5| 256) 0))) (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet3#1_In_3| 256) 0))) (.cse1 (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10| 0))) (.cse2 (= (ite (= (ite .cse5 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~flag~0#1_Out_8|)) (.cse3 (select (select |v_#memory_int_In_25| v_~queue~0.base_In_9) (+ (* v_~back~0_In_8 4) v_~queue~0.offset_In_9))) (.cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|)) (.cse6 (= v_~back~0_Out_22 (+ v_~back~0_In_8 1))) (.cse7 (not (= (ite (and (< v_~back~0_In_8 v_~n~0_In_5) (<= 0 v_~back~0_In_8)) 1 0) 0)))) (or (and .cse0 (= |v_thread2Thread1of1ForFork1_#t~mem4#1_Out_8| |v_thread2Thread1of1ForFork1_#t~mem4#1_In_3|) .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~post5#1_In_3| |v_thread2Thread1of1ForFork1_#t~post5#1_Out_8|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10| (ite (= (+ .cse3 1) 0) 1 0)) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4| |v_thread2Thread1of1ForFork1_#t~mem6#1_In_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10| (ite (= .cse3 1) 1 0)) (not .cse5) (= |v_thread2Thread1of1ForFork1_#t~post7#1_Out_6| |v_thread2Thread1of1ForFork1_#t~post7#1_In_1|) .cse4 .cse6 .cse7)))) InVars {thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_In_3|, ~queue~0.offset=v_~queue~0.offset_In_9, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_In_5|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_In_3|, ~back~0=v_~back~0_In_8, #memory_int=|v_#memory_int_In_25|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_9, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_In_1|, thread2Thread1of1ForFork1_#t~nondet3#1=|v_thread2Thread1of1ForFork1_#t~nondet3#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_9, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_Out_8|, ~back~0=v_~back~0_Out_22, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_9, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_6|, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_Out_8|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_Out_8|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~flag~0#1, thread2Thread1of1ForFork1_#t~mem4#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~nondet3#1] and [560] $Ultimate##0-->L65-4: Formula: (and (let ((.cse6 (= (mod |v_thread2Thread1of1ForFork1_~flag~0#1_70| 256) 0))) (let ((.cse0 (= v_~back~0_164 (+ v_~back~0_165 1))) (.cse1 (= (ite (= (ite .cse6 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~flag~0#1_69|)) (.cse2 (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet3#1_62| 256) 0))) (.cse4 (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_51| 0))) (.cse3 (select (select |v_#memory_int_219| v_~queue~0.base_151) (+ v_~queue~0.offset_151 (* v_~back~0_165 4)))) (.cse5 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_51| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|)) (.cse7 (not (= (ite (and (< v_~back~0_165 v_~n~0_119) (<= 0 v_~back~0_165)) 1 0) 0)))) (or (and .cse0 .cse1 .cse2 (= (ite (= (+ .cse3 1) 0) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) .cse4 (= |v_thread2Thread1of1ForFork1_#t~post5#1_38| |v_thread2Thread1of1ForFork1_#t~post5#1_37|) (= |v_thread2Thread1of1ForFork1_#t~mem4#1_39| |v_thread2Thread1of1ForFork1_#t~mem4#1_40|) .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~post7#1_38| |v_thread2Thread1of1ForFork1_#t~post7#1_37|) .cse4 (not .cse6) (= |v_thread2Thread1of1ForFork1_#t~mem6#1_38| |v_thread2Thread1of1ForFork1_#t~mem6#1_37|) (= (ite (= .cse3 1) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) .cse5 .cse7)))) (= (ite (= (ite (< v_~front~0_184 v_~back~0_165) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~cond~0#1_99|)) InVars {thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_38|, ~queue~0.offset=v_~queue~0.offset_151, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_70|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_40|, ~back~0=v_~back~0_165, #memory_int=|v_#memory_int_219|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_38|, ~queue~0.base=v_~queue~0.base_151, ~n~0=v_~n~0_119, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_38|, thread2Thread1of1ForFork1_#t~nondet3#1=|v_thread2Thread1of1ForFork1_#t~nondet3#1_62|, ~front~0=v_~front~0_184} OutVars{~queue~0.offset=v_~queue~0.offset_151, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_69|, ~back~0=v_~back~0_164, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_37|, ~queue~0.base=v_~queue~0.base_151, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_37|, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_51|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_39|, #memory_int=|v_#memory_int_219|, ~n~0=v_~n~0_119, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_99|, ~front~0=v_~front~0_184} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~flag~0#1, thread2Thread1of1ForFork1_#t~mem4#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork0_~cond~0#1, thread2Thread1of1ForFork1_#t~nondet3#1] [2022-12-06 07:37:22,927 WARN L322 ript$VariableManager]: TermVariable LBE54 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:22,927 WARN L322 ript$VariableManager]: TermVariable LBE86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:22,927 WARN L322 ript$VariableManager]: TermVariable LBE69 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:22,927 WARN L322 ript$VariableManager]: TermVariable LBE219 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:22,928 WARN L322 ript$VariableManager]: TermVariable LBE217 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:22,928 WARN L322 ript$VariableManager]: TermVariable LBE227 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:23,356 WARN L322 ript$VariableManager]: TermVariable LBE54 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:23,356 WARN L322 ript$VariableManager]: TermVariable LBE86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:23,356 WARN L322 ript$VariableManager]: TermVariable LBE69 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:23,357 WARN L322 ript$VariableManager]: TermVariable LBE219 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:23,357 WARN L322 ript$VariableManager]: TermVariable LBE217 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:23,357 WARN L322 ript$VariableManager]: TermVariable LBE227 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:23,884 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [561] $Ultimate##0-->L65-4: Formula: (and (= |v_thread2Thread1of1ForFork1_~flag~0#1_73| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_53| 0)) (= |v_thread2Thread1of1ForFork1_#t~mem6#1_42| |v_thread2Thread1of1ForFork1_#t~mem6#1_41|) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet3#1_66| 256) 0)) (= (ite (= (select (select |v_#memory_int_221| v_~queue~0.base_153) (+ (* v_~back~0_169 4) v_~queue~0.offset_153)) 1) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|) (not (= (ite (and (< v_~back~0_169 v_~n~0_121) (<= 0 v_~back~0_169)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_#t~post7#1_42| |v_thread2Thread1of1ForFork1_#t~post7#1_41|) (= (+ v_~back~0_169 1) v_~back~0_168) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_53| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|)) InVars {~queue~0.offset=v_~queue~0.offset_153, ~back~0=v_~back~0_169, #memory_int=|v_#memory_int_221|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_42|, ~queue~0.base=v_~queue~0.base_153, ~n~0=v_~n~0_121, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_42|, thread2Thread1of1ForFork1_#t~nondet3#1=|v_thread2Thread1of1ForFork1_#t~nondet3#1_66|} OutVars{~queue~0.offset=v_~queue~0.offset_153, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_73|, ~back~0=v_~back~0_168, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_41|, ~queue~0.base=v_~queue~0.base_153, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_41|, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_53|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_43|, #memory_int=|v_#memory_int_221|, ~n~0=v_~n~0_121} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~flag~0#1, thread2Thread1of1ForFork1_#t~mem4#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~nondet3#1] and [556] $Ultimate##0-->L65-4: Formula: (let ((.cse1 (+ v_~back~0_155 1)) (.cse0 (select |v_#memory_int_211| v_~queue~0.base_143))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_72| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_60|) (= (+ v_~element~0_99 (select .cse0 (+ (* v_~front~0_164 4) v_~queue~0.offset_143)) v_~sum~0_139) v_~sum~0_137) (not (= (mod (ite (= 0 (ite (< v_~front~0_162 .cse1) 1 0)) 0 1) 256) 0)) (let ((.cse6 (= 0 (mod |v_thread2Thread1of1ForFork1_~flag~0#1_66| 256)))) (let ((.cse2 (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet3#1_58| 256) 0))) (.cse3 (not (= (ite (and (<= 0 v_~back~0_155) (< v_~back~0_155 v_~n~0_111)) 1 0) 0))) (.cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|)) (.cse5 (select .cse0 (+ (* v_~back~0_155 4) v_~queue~0.offset_143))) (.cse7 (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| 0))) (.cse8 (= |v_thread2Thread1of1ForFork1_~flag~0#1_65| (ite (= (ite .cse6 1 0) 0) 0 1))) (.cse9 (= v_~back~0_154 .cse1))) (or (and .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem6#1_34| |v_thread2Thread1of1ForFork1_#t~mem6#1_33|) (= |v_thread2Thread1of1ForFork1_#t~post7#1_34| |v_thread2Thread1of1ForFork1_#t~post7#1_33|) .cse3 .cse4 (= (ite (= .cse5 1) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) (not .cse6) .cse7 .cse8 .cse9) (and .cse2 .cse3 .cse6 .cse4 (= (ite (= (+ .cse5 1) 0) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|) .cse7 .cse8 (= |v_thread2Thread1of1ForFork1_#t~post5#1_34| |v_thread2Thread1of1ForFork1_#t~post5#1_33|) (= |v_thread2Thread1of1ForFork1_#t~mem4#1_36| |v_thread2Thread1of1ForFork1_#t~mem4#1_35|) .cse9)))) (= (ite (= (ite (< v_~front~0_162 v_~back~0_155) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~cond~0#1_83|) (= (ite (and (< v_~front~0_162 (+ v_~n~0_111 1)) (<= 1 v_~front~0_162)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_60|) (= (+ 2 v_~front~0_164) v_~front~0_162) (= v_~element~0_99 (select .cse0 (+ (- 4) (* v_~front~0_162 4) v_~queue~0.offset_143))) (not (= (ite (and (< v_~front~0_164 v_~n~0_111) (<= 0 v_~front~0_164)) 1 0) 0)))) InVars {~queue~0.offset=v_~queue~0.offset_143, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_66|, ~back~0=v_~back~0_155, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_34|, ~queue~0.base=v_~queue~0.base_143, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_34|, thread2Thread1of1ForFork1_#t~nondet3#1=|v_thread2Thread1of1ForFork1_#t~nondet3#1_58|, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_34|, ~sum~0=v_~sum~0_139, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_36|, #memory_int=|v_#memory_int_211|, ~n~0=v_~n~0_111, ~front~0=v_~front~0_164} OutVars{~queue~0.offset=v_~queue~0.offset_143, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_66|, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_65|, ~back~0=v_~back~0_154, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_33|, ~queue~0.base=v_~queue~0.base_143, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_33|, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|, ~sum~0=v_~sum~0_137, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_60|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_35|, ~element~0=v_~element~0_99, #memory_int=|v_#memory_int_211|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_72|, ~n~0=v_~n~0_111, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_83|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_78|, ~front~0=v_~front~0_162} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork1_~flag~0#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~nondet3#1, thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~sum~0, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem4#1, ~element~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] [2022-12-06 07:37:23,884 WARN L322 ript$VariableManager]: TermVariable LBE54 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:23,885 WARN L322 ript$VariableManager]: TermVariable LBE86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:23,885 WARN L322 ript$VariableManager]: TermVariable LBE69 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:23,885 WARN L322 ript$VariableManager]: TermVariable LBE219 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:23,885 WARN L322 ript$VariableManager]: TermVariable LBE217 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:23,885 WARN L322 ript$VariableManager]: TermVariable LBE227 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:24,287 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [561] $Ultimate##0-->L65-4: Formula: (and (= |v_thread2Thread1of1ForFork1_~flag~0#1_73| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_53| 0)) (= |v_thread2Thread1of1ForFork1_#t~mem6#1_42| |v_thread2Thread1of1ForFork1_#t~mem6#1_41|) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet3#1_66| 256) 0)) (= (ite (= (select (select |v_#memory_int_221| v_~queue~0.base_153) (+ (* v_~back~0_169 4) v_~queue~0.offset_153)) 1) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|) (not (= (ite (and (< v_~back~0_169 v_~n~0_121) (<= 0 v_~back~0_169)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_#t~post7#1_42| |v_thread2Thread1of1ForFork1_#t~post7#1_41|) (= (+ v_~back~0_169 1) v_~back~0_168) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_53| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|)) InVars {~queue~0.offset=v_~queue~0.offset_153, ~back~0=v_~back~0_169, #memory_int=|v_#memory_int_221|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_42|, ~queue~0.base=v_~queue~0.base_153, ~n~0=v_~n~0_121, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_42|, thread2Thread1of1ForFork1_#t~nondet3#1=|v_thread2Thread1of1ForFork1_#t~nondet3#1_66|} OutVars{~queue~0.offset=v_~queue~0.offset_153, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_73|, ~back~0=v_~back~0_168, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_41|, ~queue~0.base=v_~queue~0.base_153, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_41|, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_53|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_43|, #memory_int=|v_#memory_int_221|, ~n~0=v_~n~0_121} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~flag~0#1, thread2Thread1of1ForFork1_#t~mem4#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~nondet3#1] and [557] $Ultimate##0-->L57: Formula: (let ((.cse0 (+ 2 v_~front~0_170)) (.cse1 (select |v_#memory_int_213| v_~queue~0.base_145)) (.cse2 (* v_~front~0_170 4))) (and (= v_~front~0_168 (+ 3 v_~front~0_170)) (not (= (mod (ite (= (ite (< .cse0 v_~back~0_158) 1 0) 0) 0 1) 256) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_76| 0)) (= (ite (= (ite (< v_~front~0_168 v_~back~0_158) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~cond~0#1_87|) (not (= (ite (and (<= 0 v_~front~0_170) (< v_~front~0_170 v_~n~0_113)) 1 0) 0)) (= v_~element~0_103 (select .cse1 (+ .cse2 8 v_~queue~0.offset_145))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_76| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|) (= (ite (and (< .cse0 v_~n~0_113) (<= 0 .cse0)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|) (= (+ v_~element~0_103 (select .cse1 (+ .cse2 v_~queue~0.offset_145 4)) (select .cse1 (+ .cse2 v_~queue~0.offset_145)) v_~sum~0_145) v_~sum~0_143))) InVars {~sum~0=v_~sum~0_145, ~queue~0.offset=v_~queue~0.offset_145, ~back~0=v_~back~0_158, #memory_int=|v_#memory_int_213|, ~queue~0.base=v_~queue~0.base_145, ~n~0=v_~n~0_113, ~front~0=v_~front~0_170} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_70|, ~queue~0.offset=v_~queue~0.offset_145, ~back~0=v_~back~0_158, ~queue~0.base=v_~queue~0.base_145, ~sum~0=v_~sum~0_143, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_64|, ~element~0=v_~element~0_103, #memory_int=|v_#memory_int_213|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_76|, ~n~0=v_~n~0_113, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_87|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_82|, ~front~0=v_~front~0_168} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~element~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] [2022-12-06 07:37:24,507 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [561] $Ultimate##0-->L65-4: Formula: (and (= |v_thread2Thread1of1ForFork1_~flag~0#1_73| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_53| 0)) (= |v_thread2Thread1of1ForFork1_#t~mem6#1_42| |v_thread2Thread1of1ForFork1_#t~mem6#1_41|) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet3#1_66| 256) 0)) (= (ite (= (select (select |v_#memory_int_221| v_~queue~0.base_153) (+ (* v_~back~0_169 4) v_~queue~0.offset_153)) 1) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|) (not (= (ite (and (< v_~back~0_169 v_~n~0_121) (<= 0 v_~back~0_169)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_#t~post7#1_42| |v_thread2Thread1of1ForFork1_#t~post7#1_41|) (= (+ v_~back~0_169 1) v_~back~0_168) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_53| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|)) InVars {~queue~0.offset=v_~queue~0.offset_153, ~back~0=v_~back~0_169, #memory_int=|v_#memory_int_221|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_42|, ~queue~0.base=v_~queue~0.base_153, ~n~0=v_~n~0_121, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_42|, thread2Thread1of1ForFork1_#t~nondet3#1=|v_thread2Thread1of1ForFork1_#t~nondet3#1_66|} OutVars{~queue~0.offset=v_~queue~0.offset_153, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_73|, ~back~0=v_~back~0_168, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_41|, ~queue~0.base=v_~queue~0.base_153, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_41|, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_53|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_43|, #memory_int=|v_#memory_int_221|, ~n~0=v_~n~0_121} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~flag~0#1, thread2Thread1of1ForFork1_#t~mem4#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~nondet3#1] and [558] $Ultimate##0-->L101-1: Formula: (let ((.cse0 (+ v_~front~0_176 1)) (.cse1 (select |v_#memory_int_215| v_~queue~0.base_147)) (.cse2 (* v_~front~0_176 4))) (and (not (= (mod (ite (= (ite (< .cse0 v_~back~0_160) 1 0) 0) 0 1) 256) 0)) (= (select (select |v_#memory_int_215| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_53|) |v_ULTIMATE.start_main_#t~mem15#1_48|) (= (+ v_~element~0_107 (select .cse1 (+ .cse2 v_~queue~0.offset_147)) v_~sum~0_151) v_~sum~0_149) (= (ite (and (<= 0 .cse0) (< .cse0 v_~n~0_115)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_68|) (= (ite (= (ite (< v_~front~0_174 v_~back~0_160) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~cond~0#1_91|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_80| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_68|) (= v_~element~0_107 (select .cse1 (+ .cse2 v_~queue~0.offset_147 4))) (= (+ 2 v_~front~0_176) v_~front~0_174) (not (= (ite (and (< v_~front~0_176 v_~n~0_115) (<= 0 v_~front~0_176)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_80| 0)))) InVars {~sum~0=v_~sum~0_151, ~queue~0.offset=v_~queue~0.offset_147, ~back~0=v_~back~0_160, #memory_int=|v_#memory_int_215|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, ~queue~0.base=v_~queue~0.base_147, ~n~0=v_~n~0_115, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_53|, ~front~0=v_~front~0_176} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_74|, ~queue~0.offset=v_~queue~0.offset_147, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_68|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_48|, ~back~0=v_~back~0_160, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, ~queue~0.base=v_~queue~0.base_147, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_53|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_43|, ~sum~0=v_~sum~0_149, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_68|, ~element~0=v_~element~0_107, #memory_int=|v_#memory_int_215|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_80|, ~n~0=v_~n~0_115, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_91|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_86|, ~front~0=v_~front~0_174} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~mem15#1, ~element~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#t~mem1#1, ULTIMATE.start_main_#t~nondet14#1, ~front~0] [2022-12-06 07:37:24,735 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [561] $Ultimate##0-->L65-4: Formula: (and (= |v_thread2Thread1of1ForFork1_~flag~0#1_73| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_53| 0)) (= |v_thread2Thread1of1ForFork1_#t~mem6#1_42| |v_thread2Thread1of1ForFork1_#t~mem6#1_41|) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet3#1_66| 256) 0)) (= (ite (= (select (select |v_#memory_int_221| v_~queue~0.base_153) (+ (* v_~back~0_169 4) v_~queue~0.offset_153)) 1) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|) (not (= (ite (and (< v_~back~0_169 v_~n~0_121) (<= 0 v_~back~0_169)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_#t~post7#1_42| |v_thread2Thread1of1ForFork1_#t~post7#1_41|) (= (+ v_~back~0_169 1) v_~back~0_168) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_53| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|)) InVars {~queue~0.offset=v_~queue~0.offset_153, ~back~0=v_~back~0_169, #memory_int=|v_#memory_int_221|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_42|, ~queue~0.base=v_~queue~0.base_153, ~n~0=v_~n~0_121, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_42|, thread2Thread1of1ForFork1_#t~nondet3#1=|v_thread2Thread1of1ForFork1_#t~nondet3#1_66|} OutVars{~queue~0.offset=v_~queue~0.offset_153, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_73|, ~back~0=v_~back~0_168, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_41|, ~queue~0.base=v_~queue~0.base_153, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_41|, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_53|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_43|, #memory_int=|v_#memory_int_221|, ~n~0=v_~n~0_121} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~flag~0#1, thread2Thread1of1ForFork1_#t~mem4#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~nondet3#1] and [548] $Ultimate##0-->L57: Formula: (and (not (= (mod (ite (= (ite (< v_~front~0_131 v_~back~0_136) 1 0) 0) 0 1) 256) 0)) (= (+ v_~front~0_131 1) v_~front~0_130) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56| 0)) (= (+ v_~element~0_79 v_~sum~0_106) v_~sum~0_105) (= |v_thread1Thread1of1ForFork0_~cond~0#1_57| (ite (= (ite (< v_~front~0_130 v_~back~0_136) 1 0) 0) 0 1)) (= v_~element~0_79 (select (select |v_#memory_int_187| v_~queue~0.base_125) (+ (* v_~front~0_131 4) v_~queue~0.offset_125))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|) (= (ite (and (< v_~front~0_131 v_~n~0_95) (<= 0 v_~front~0_131)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|)) InVars {~sum~0=v_~sum~0_106, ~queue~0.offset=v_~queue~0.offset_125, ~back~0=v_~back~0_136, #memory_int=|v_#memory_int_187|, ~queue~0.base=v_~queue~0.base_125, ~n~0=v_~n~0_95, ~front~0=v_~front~0_131} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_50|, ~queue~0.offset=v_~queue~0.offset_125, ~back~0=v_~back~0_136, ~queue~0.base=v_~queue~0.base_125, ~sum~0=v_~sum~0_105, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_44|, ~element~0=v_~element~0_79, #memory_int=|v_#memory_int_187|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_56|, ~n~0=v_~n~0_95, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_57|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_62|, ~front~0=v_~front~0_130} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~element~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] [2022-12-06 07:37:24,878 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [561] $Ultimate##0-->L65-4: Formula: (and (= |v_thread2Thread1of1ForFork1_~flag~0#1_73| 0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_53| 0)) (= |v_thread2Thread1of1ForFork1_#t~mem6#1_42| |v_thread2Thread1of1ForFork1_#t~mem6#1_41|) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet3#1_66| 256) 0)) (= (ite (= (select (select |v_#memory_int_221| v_~queue~0.base_153) (+ (* v_~back~0_169 4) v_~queue~0.offset_153)) 1) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|) (not (= (ite (and (< v_~back~0_169 v_~n~0_121) (<= 0 v_~back~0_169)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_#t~post7#1_42| |v_thread2Thread1of1ForFork1_#t~post7#1_41|) (= (+ v_~back~0_169 1) v_~back~0_168) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_53| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|)) InVars {~queue~0.offset=v_~queue~0.offset_153, ~back~0=v_~back~0_169, #memory_int=|v_#memory_int_221|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_42|, ~queue~0.base=v_~queue~0.base_153, ~n~0=v_~n~0_121, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_42|, thread2Thread1of1ForFork1_#t~nondet3#1=|v_thread2Thread1of1ForFork1_#t~nondet3#1_66|} OutVars{~queue~0.offset=v_~queue~0.offset_153, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_73|, ~back~0=v_~back~0_168, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_41|, ~queue~0.base=v_~queue~0.base_153, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_41|, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_53|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_43|, #memory_int=|v_#memory_int_221|, ~n~0=v_~n~0_121} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~flag~0#1, thread2Thread1of1ForFork1_#t~mem4#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~nondet3#1] and [555] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (select |v_#memory_int_209| v_~queue~0.base_141)) (.cse1 (* v_~front~0_158 4)) (.cse2 (+ v_~front~0_158 1))) (and (= (+ v_~element~0_95 (select .cse0 (+ .cse1 v_~queue~0.offset_141)) v_~sum~0_133) v_~sum~0_131) (= v_~element~0_95 (select .cse0 (+ .cse1 v_~queue~0.offset_141 4))) (= (mod |v_thread2Thread1of1ForFork1_#t~nondet3#1_54| 256) 0) (= (ite (and (< .cse2 v_~n~0_109) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_56|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_19|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_19| 0) (= (ite (= (ite (< v_~front~0_156 v_~back~0_152) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~cond~0#1_79|) (= (+ 2 v_~front~0_158) v_~front~0_156) (not (= (mod (ite (= (ite (< .cse2 v_~back~0_152) 1 0) 0) 0 1) 256) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_68| 0)) (not (= (ite (and (<= 0 v_~front~0_158) (< v_~front~0_158 v_~n~0_109)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_68| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_56|))) InVars {~sum~0=v_~sum~0_133, ~queue~0.offset=v_~queue~0.offset_141, ~back~0=v_~back~0_152, #memory_int=|v_#memory_int_209|, ~queue~0.base=v_~queue~0.base_141, ~n~0=v_~n~0_109, ~front~0=v_~front~0_158, thread2Thread1of1ForFork1_#t~nondet3#1=|v_thread2Thread1of1ForFork1_#t~nondet3#1_54|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_62|, ~queue~0.offset=v_~queue~0.offset_141, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_19|, ~back~0=v_~back~0_152, ~queue~0.base=v_~queue~0.base_141, ~sum~0=v_~sum~0_131, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_56|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_19|, ~element~0=v_~element~0_95, #memory_int=|v_#memory_int_209|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_68|, ~n~0=v_~n~0_109, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_79|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_74|, ~front~0=v_~front~0_156} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#res#1.base, ~element~0, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0, thread2Thread1of1ForFork1_#t~nondet3#1] [2022-12-06 07:37:25,191 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] $Ultimate##0-->L101-1: Formula: (let ((.cse0 (select |v_#memory_int_233| v_~queue~0.base_165)) (.cse1 (* v_~front~0_201 4)) (.cse2 (+ v_~front~0_201 1))) (and (= |v_thread2Thread1of1ForFork1_~flag~0#1_99| 0) (= (ite (= (ite (< v_~front~0_200 v_~back~0_198) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~cond~0#1_109|) (= (ite (= (select .cse0 (+ v_~queue~0.offset_165 (* v_~back~0_199 4))) 1) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (= (+ v_~back~0_199 1) v_~back~0_198) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_71| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_71| 0)) (not (= (ite (and (< v_~front~0_201 v_~n~0_133) (<= 0 v_~front~0_201)) 1 0) 0)) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet3#1_96| 256) 0)) (= |v_thread2Thread1of1ForFork1_#t~post7#1_72| |v_thread2Thread1of1ForFork1_#t~post7#1_71|) (= v_~element~0_119 (select .cse0 (+ v_~queue~0.offset_165 .cse1 4))) (= |v_thread2Thread1of1ForFork1_#t~mem6#1_72| |v_thread2Thread1of1ForFork1_#t~mem6#1_71|) (not (= (ite (and (<= 0 v_~back~0_199) (< v_~back~0_199 v_~n~0_133)) 1 0) 0)) (= v_~front~0_200 (+ 2 v_~front~0_201)) (= (+ v_~element~0_119 (select .cse0 (+ v_~queue~0.offset_165 .cse1)) v_~sum~0_172) v_~sum~0_171) (= (select (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t1~0#1.base_55|) |v_ULTIMATE.start_main_~#t1~0#1.offset_55|) |v_ULTIMATE.start_main_#t~mem15#1_50|) (= (ite (and (< .cse2 v_~n~0_133) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_80|) (not (= (mod (ite (= (ite (< .cse2 v_~back~0_198) 1 0) 0) 0 1) 256) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_92| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_80|))) InVars {~sum~0=v_~sum~0_172, ~queue~0.offset=v_~queue~0.offset_165, ~back~0=v_~back~0_199, #memory_int=|v_#memory_int_233|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_72|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_55|, ~queue~0.base=v_~queue~0.base_165, ~n~0=v_~n~0_133, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_72|, ~front~0=v_~front~0_201, thread2Thread1of1ForFork1_#t~nondet3#1=|v_thread2Thread1of1ForFork1_#t~nondet3#1_96|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_86|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_70|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, ~sum~0=v_~sum~0_171, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_67|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_69|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_92|, ~front~0=v_~front~0_200, ~queue~0.offset=v_~queue~0.offset_165, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_50|, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_99|, ~back~0=v_~back~0_198, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_71|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_55|, ~queue~0.base=v_~queue~0.base_165, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_71|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_45|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_71|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_80|, ~element~0=v_~element~0_119, #memory_int=|v_#memory_int_233|, ~n~0=v_~n~0_133, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_109|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_98|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~mem15#1, thread2Thread1of1ForFork1_~flag~0#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ULTIMATE.start_main_#t~nondet14#1, thread2Thread1of1ForFork1_#t~nondet3#1, ~sum~0, thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem4#1, ~element~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] and [537] L57-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_4| 0) (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_In_3| 256) 0) (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_4| 0)) InVars {thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_In_3|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_In_3|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 07:37:25,496 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] $Ultimate##0-->L101-1: Formula: (let ((.cse0 (select |v_#memory_int_233| v_~queue~0.base_165)) (.cse1 (* v_~front~0_201 4)) (.cse2 (+ v_~front~0_201 1))) (and (= |v_thread2Thread1of1ForFork1_~flag~0#1_99| 0) (= (ite (= (ite (< v_~front~0_200 v_~back~0_198) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~cond~0#1_109|) (= (ite (= (select .cse0 (+ v_~queue~0.offset_165 (* v_~back~0_199 4))) 1) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (= (+ v_~back~0_199 1) v_~back~0_198) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_71| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_71| 0)) (not (= (ite (and (< v_~front~0_201 v_~n~0_133) (<= 0 v_~front~0_201)) 1 0) 0)) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet3#1_96| 256) 0)) (= |v_thread2Thread1of1ForFork1_#t~post7#1_72| |v_thread2Thread1of1ForFork1_#t~post7#1_71|) (= v_~element~0_119 (select .cse0 (+ v_~queue~0.offset_165 .cse1 4))) (= |v_thread2Thread1of1ForFork1_#t~mem6#1_72| |v_thread2Thread1of1ForFork1_#t~mem6#1_71|) (not (= (ite (and (<= 0 v_~back~0_199) (< v_~back~0_199 v_~n~0_133)) 1 0) 0)) (= v_~front~0_200 (+ 2 v_~front~0_201)) (= (+ v_~element~0_119 (select .cse0 (+ v_~queue~0.offset_165 .cse1)) v_~sum~0_172) v_~sum~0_171) (= (select (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t1~0#1.base_55|) |v_ULTIMATE.start_main_~#t1~0#1.offset_55|) |v_ULTIMATE.start_main_#t~mem15#1_50|) (= (ite (and (< .cse2 v_~n~0_133) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_80|) (not (= (mod (ite (= (ite (< .cse2 v_~back~0_198) 1 0) 0) 0 1) 256) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_92| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_80|))) InVars {~sum~0=v_~sum~0_172, ~queue~0.offset=v_~queue~0.offset_165, ~back~0=v_~back~0_199, #memory_int=|v_#memory_int_233|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_72|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_55|, ~queue~0.base=v_~queue~0.base_165, ~n~0=v_~n~0_133, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_72|, ~front~0=v_~front~0_201, thread2Thread1of1ForFork1_#t~nondet3#1=|v_thread2Thread1of1ForFork1_#t~nondet3#1_96|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_86|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_70|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, ~sum~0=v_~sum~0_171, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_67|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_69|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_92|, ~front~0=v_~front~0_200, ~queue~0.offset=v_~queue~0.offset_165, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_50|, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_99|, ~back~0=v_~back~0_198, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_71|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_55|, ~queue~0.base=v_~queue~0.base_165, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_71|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_45|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_71|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_80|, ~element~0=v_~element~0_119, #memory_int=|v_#memory_int_233|, ~n~0=v_~n~0_133, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_109|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_98|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~mem15#1, thread2Thread1of1ForFork1_~flag~0#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ULTIMATE.start_main_#t~nondet14#1, thread2Thread1of1ForFork1_#t~nondet3#1, ~sum~0, thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem4#1, ~element~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] and [541] L65-4-->L65-4: Formula: (let ((.cse5 (= (mod |v_thread2Thread1of1ForFork1_~flag~0#1_In_5| 256) 0))) (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet3#1_In_3| 256) 0))) (.cse1 (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10| 0))) (.cse2 (= (ite (= (ite .cse5 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~flag~0#1_Out_8|)) (.cse3 (select (select |v_#memory_int_In_25| v_~queue~0.base_In_9) (+ (* v_~back~0_In_8 4) v_~queue~0.offset_In_9))) (.cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|)) (.cse6 (= v_~back~0_Out_22 (+ v_~back~0_In_8 1))) (.cse7 (not (= (ite (and (< v_~back~0_In_8 v_~n~0_In_5) (<= 0 v_~back~0_In_8)) 1 0) 0)))) (or (and .cse0 (= |v_thread2Thread1of1ForFork1_#t~mem4#1_Out_8| |v_thread2Thread1of1ForFork1_#t~mem4#1_In_3|) .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~post5#1_In_3| |v_thread2Thread1of1ForFork1_#t~post5#1_Out_8|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10| (ite (= (+ .cse3 1) 0) 1 0)) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4| |v_thread2Thread1of1ForFork1_#t~mem6#1_In_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10| (ite (= .cse3 1) 1 0)) (not .cse5) (= |v_thread2Thread1of1ForFork1_#t~post7#1_Out_6| |v_thread2Thread1of1ForFork1_#t~post7#1_In_1|) .cse4 .cse6 .cse7)))) InVars {thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_In_3|, ~queue~0.offset=v_~queue~0.offset_In_9, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_In_5|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_In_3|, ~back~0=v_~back~0_In_8, #memory_int=|v_#memory_int_In_25|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_9, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_In_1|, thread2Thread1of1ForFork1_#t~nondet3#1=|v_thread2Thread1of1ForFork1_#t~nondet3#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_9, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_Out_8|, ~back~0=v_~back~0_Out_22, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_9, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_6|, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_Out_8|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_Out_8|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~flag~0#1, thread2Thread1of1ForFork1_#t~mem4#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~nondet3#1] [2022-12-06 07:37:25,496 WARN L322 ript$VariableManager]: TermVariable LBE54 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:25,496 WARN L322 ript$VariableManager]: TermVariable LBE86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:25,496 WARN L322 ript$VariableManager]: TermVariable LBE69 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:25,497 WARN L322 ript$VariableManager]: TermVariable LBE219 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:25,497 WARN L322 ript$VariableManager]: TermVariable LBE217 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:25,497 WARN L322 ript$VariableManager]: TermVariable LBE227 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:25,888 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] $Ultimate##0-->L101-1: Formula: (let ((.cse0 (select |v_#memory_int_233| v_~queue~0.base_165)) (.cse1 (* v_~front~0_201 4)) (.cse2 (+ v_~front~0_201 1))) (and (= |v_thread2Thread1of1ForFork1_~flag~0#1_99| 0) (= (ite (= (ite (< v_~front~0_200 v_~back~0_198) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~cond~0#1_109|) (= (ite (= (select .cse0 (+ v_~queue~0.offset_165 (* v_~back~0_199 4))) 1) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (= (+ v_~back~0_199 1) v_~back~0_198) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_71| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_71| 0)) (not (= (ite (and (< v_~front~0_201 v_~n~0_133) (<= 0 v_~front~0_201)) 1 0) 0)) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet3#1_96| 256) 0)) (= |v_thread2Thread1of1ForFork1_#t~post7#1_72| |v_thread2Thread1of1ForFork1_#t~post7#1_71|) (= v_~element~0_119 (select .cse0 (+ v_~queue~0.offset_165 .cse1 4))) (= |v_thread2Thread1of1ForFork1_#t~mem6#1_72| |v_thread2Thread1of1ForFork1_#t~mem6#1_71|) (not (= (ite (and (<= 0 v_~back~0_199) (< v_~back~0_199 v_~n~0_133)) 1 0) 0)) (= v_~front~0_200 (+ 2 v_~front~0_201)) (= (+ v_~element~0_119 (select .cse0 (+ v_~queue~0.offset_165 .cse1)) v_~sum~0_172) v_~sum~0_171) (= (select (select |v_#memory_int_233| |v_ULTIMATE.start_main_~#t1~0#1.base_55|) |v_ULTIMATE.start_main_~#t1~0#1.offset_55|) |v_ULTIMATE.start_main_#t~mem15#1_50|) (= (ite (and (< .cse2 v_~n~0_133) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_80|) (not (= (mod (ite (= (ite (< .cse2 v_~back~0_198) 1 0) 0) 0 1) 256) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_92| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_80|))) InVars {~sum~0=v_~sum~0_172, ~queue~0.offset=v_~queue~0.offset_165, ~back~0=v_~back~0_199, #memory_int=|v_#memory_int_233|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_72|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_55|, ~queue~0.base=v_~queue~0.base_165, ~n~0=v_~n~0_133, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_72|, ~front~0=v_~front~0_201, thread2Thread1of1ForFork1_#t~nondet3#1=|v_thread2Thread1of1ForFork1_#t~nondet3#1_96|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_86|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_70|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, ~sum~0=v_~sum~0_171, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_67|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_69|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_92|, ~front~0=v_~front~0_200, ~queue~0.offset=v_~queue~0.offset_165, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_50|, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_99|, ~back~0=v_~back~0_198, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_71|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_55|, ~queue~0.base=v_~queue~0.base_165, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_71|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_45|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_71|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_80|, ~element~0=v_~element~0_119, #memory_int=|v_#memory_int_233|, ~n~0=v_~n~0_133, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_109|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_98|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~mem15#1, thread2Thread1of1ForFork1_~flag~0#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ULTIMATE.start_main_#t~nondet14#1, thread2Thread1of1ForFork1_#t~nondet3#1, ~sum~0, thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem4#1, ~element~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] and [544] L57-->L57: Formula: (and (= (+ v_~front~0_117 1) v_~front~0_116) (= (ite (and (< v_~front~0_117 v_~n~0_87) (<= 0 v_~front~0_117)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (= v_~sum~0_92 (+ v_~element~0_69 v_~sum~0_93)) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_47| 256) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|) (= v_~element~0_69 (select (select |v_#memory_int_162| v_~queue~0.base_113) (+ (* v_~front~0_117 4) v_~queue~0.offset_113))) (= (ite (= (ite (< v_~front~0_116 v_~back~0_124) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~cond~0#1_46|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50| 0))) InVars {~sum~0=v_~sum~0_93, ~queue~0.offset=v_~queue~0.offset_113, ~back~0=v_~back~0_124, #memory_int=|v_#memory_int_162|, ~queue~0.base=v_~queue~0.base_113, ~n~0=v_~n~0_87, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_47|, ~front~0=v_~front~0_117} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_44|, ~queue~0.offset=v_~queue~0.offset_113, ~back~0=v_~back~0_124, ~queue~0.base=v_~queue~0.base_113, ~sum~0=v_~sum~0_92, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|, ~element~0=v_~element~0_69, #memory_int=|v_#memory_int_162|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_50|, ~n~0=v_~n~0_87, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_46|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_56|, ~front~0=v_~front~0_116} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~element~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] [2022-12-06 07:37:26,233 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [573] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (+ v_~front~0_213 1)) (.cse1 (select |v_#memory_int_239| v_~queue~0.base_171)) (.cse2 (* v_~front~0_213 4))) (and (= |v_thread2Thread1of1ForFork1_#t~post7#1_84| |v_thread2Thread1of1ForFork1_#t~post7#1_83|) (= |v_thread2Thread1of1ForFork1_~flag~0#1_105| 0) (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_115| 256) 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_77| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_77|) (= (ite (and (<= 0 .cse0) (< .cse0 v_~n~0_139)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_86|) (= v_~back~0_210 (+ v_~back~0_211 1)) (not (= 0 (ite (and (< v_~front~0_213 v_~n~0_139) (<= 0 v_~front~0_213)) 1 0))) (= |v_thread1Thread1of1ForFork0_#res#1.base_15| 0) (not (= (ite (and (<= 0 v_~back~0_211) (< v_~back~0_211 v_~n~0_139)) 1 0) 0)) (= (select (select |v_#memory_int_239| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) |v_ULTIMATE.start_main_~#t1~0#1.offset_57|) |v_ULTIMATE.start_main_#t~mem15#1_52|) (= (+ v_~element~0_125 (select .cse1 (+ .cse2 v_~queue~0.offset_171)) v_~sum~0_184) v_~sum~0_183) (= |v_thread2Thread1of1ForFork1_#t~mem6#1_84| |v_thread2Thread1of1ForFork1_#t~mem6#1_83|) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet3#1_110| 256) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_77| 0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_15| 0) (not (= (mod (ite (= 0 (ite (< .cse0 v_~back~0_210) 1 0)) 0 1) 256) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_86|) (= (ite (= (select .cse1 (+ (* v_~back~0_211 4) v_~queue~0.offset_171)) 1) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_77|) (= v_~element~0_125 (select .cse1 (+ .cse2 v_~queue~0.offset_171 4))) (= (+ 2 v_~front~0_213) v_~front~0_212) (= (ite (= (ite (< v_~front~0_212 v_~back~0_210) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork0_~cond~0#1_115|))) InVars {~sum~0=v_~sum~0_184, ~queue~0.offset=v_~queue~0.offset_171, ~back~0=v_~back~0_211, #memory_int=|v_#memory_int_239|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_84|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_171, ~n~0=v_~n~0_139, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_57|, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_84|, ~front~0=v_~front~0_213, thread2Thread1of1ForFork1_#t~nondet3#1=|v_thread2Thread1of1ForFork1_#t~nondet3#1_110|} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_92|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_72|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_77|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_57|, ~sum~0=v_~sum~0_183, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_73|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_75|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_98|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_15|, ~front~0=v_~front~0_212, ~queue~0.offset=v_~queue~0.offset_171, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_15|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_52|, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_105|, ~back~0=v_~back~0_210, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_83|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_171, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_83|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_47|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_77|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_86|, ~element~0=v_~element~0_125, #memory_int=|v_#memory_int_239|, ~n~0=v_~n~0_139, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_115|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_104|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ULTIMATE.start_main_#t~pre13#1, thread1Thread1of1ForFork0_#res#1.offset, ULTIMATE.start_main_#t~mem15#1, thread2Thread1of1ForFork1_~flag~0#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ULTIMATE.start_main_#t~nondet14#1, thread2Thread1of1ForFork1_#t~nondet3#1, ~sum~0, thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem4#1, ~element~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base, ~front~0] and [541] L65-4-->L65-4: Formula: (let ((.cse5 (= (mod |v_thread2Thread1of1ForFork1_~flag~0#1_In_5| 256) 0))) (let ((.cse0 (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet3#1_In_3| 256) 0))) (.cse1 (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10| 0))) (.cse2 (= (ite (= (ite .cse5 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~flag~0#1_Out_8|)) (.cse3 (select (select |v_#memory_int_In_25| v_~queue~0.base_In_9) (+ (* v_~back~0_In_8 4) v_~queue~0.offset_In_9))) (.cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|)) (.cse6 (= v_~back~0_Out_22 (+ v_~back~0_In_8 1))) (.cse7 (not (= (ite (and (< v_~back~0_In_8 v_~n~0_In_5) (<= 0 v_~back~0_In_8)) 1 0) 0)))) (or (and .cse0 (= |v_thread2Thread1of1ForFork1_#t~mem4#1_Out_8| |v_thread2Thread1of1ForFork1_#t~mem4#1_In_3|) .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~post5#1_In_3| |v_thread2Thread1of1ForFork1_#t~post5#1_Out_8|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10| (ite (= (+ .cse3 1) 0) 1 0)) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4| |v_thread2Thread1of1ForFork1_#t~mem6#1_In_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10| (ite (= .cse3 1) 1 0)) (not .cse5) (= |v_thread2Thread1of1ForFork1_#t~post7#1_Out_6| |v_thread2Thread1of1ForFork1_#t~post7#1_In_1|) .cse4 .cse6 .cse7)))) InVars {thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_In_3|, ~queue~0.offset=v_~queue~0.offset_In_9, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_In_5|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_In_3|, ~back~0=v_~back~0_In_8, #memory_int=|v_#memory_int_In_25|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_9, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_In_1|, thread2Thread1of1ForFork1_#t~nondet3#1=|v_thread2Thread1of1ForFork1_#t~nondet3#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_9, thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_Out_8|, ~back~0=v_~back~0_Out_22, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_Out_4|, ~queue~0.base=v_~queue~0.base_In_9, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_Out_6|, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_Out_8|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_Out_8|, #memory_int=|v_#memory_int_In_25|, ~n~0=v_~n~0_In_5} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~flag~0#1, thread2Thread1of1ForFork1_#t~mem4#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_#t~nondet3#1] [2022-12-06 07:37:26,234 WARN L322 ript$VariableManager]: TermVariable LBE54 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:26,234 WARN L322 ript$VariableManager]: TermVariable LBE86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:26,234 WARN L322 ript$VariableManager]: TermVariable LBE69 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:26,234 WARN L322 ript$VariableManager]: TermVariable LBE219 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:26,234 WARN L322 ript$VariableManager]: TermVariable LBE217 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:26,234 WARN L322 ript$VariableManager]: TermVariable LBE227 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:27,863 WARN L322 ript$VariableManager]: TermVariable LBE69 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:27,863 WARN L322 ript$VariableManager]: TermVariable LBE219 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:27,863 WARN L322 ript$VariableManager]: TermVariable LBE217 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:27,864 WARN L322 ript$VariableManager]: TermVariable LBE227 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:27,864 WARN L322 ript$VariableManager]: TermVariable LBE54 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:27,865 WARN L322 ript$VariableManager]: TermVariable LBE86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:37:27,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:37:28,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:37:28,076 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread2Thread1of1ForFork1_#t~nondet3#1_127 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) 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,079 INFO L158 Benchmark]: Toolchain (without parser) took 24571.28ms. Allocated memory was 200.3MB in the beginning and 375.4MB in the end (delta: 175.1MB). Free memory was 176.4MB in the beginning and 197.6MB in the end (delta: -21.2MB). Peak memory consumption was 220.5MB. Max. memory is 8.0GB. [2022-12-06 07:37:28,079 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 200.3MB. Free memory is still 177.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:37:28,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.92ms. Allocated memory is still 200.3MB. Free memory was 176.4MB in the beginning and 163.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 07:37:28,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.19ms. Allocated memory is still 200.3MB. Free memory was 163.3MB in the beginning and 161.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:37:28,079 INFO L158 Benchmark]: Boogie Preprocessor took 23.53ms. Allocated memory is still 200.3MB. Free memory was 161.2MB in the beginning and 159.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:37:28,080 INFO L158 Benchmark]: RCFGBuilder took 565.57ms. Allocated memory is still 200.3MB. Free memory was 159.6MB in the beginning and 139.7MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-06 07:37:28,080 INFO L158 Benchmark]: TraceAbstraction took 23649.36ms. Allocated memory was 200.3MB in the beginning and 375.4MB in the end (delta: 175.1MB). Free memory was 138.6MB in the beginning and 197.6MB in the end (delta: -59.0MB). Peak memory consumption was 182.7MB. Max. memory is 8.0GB. [2022-12-06 07:37:28,081 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 200.3MB. Free memory is still 177.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 274.92ms. Allocated memory is still 200.3MB. Free memory was 176.4MB in the beginning and 163.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.19ms. Allocated memory is still 200.3MB. Free memory was 163.3MB in the beginning and 161.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.53ms. Allocated memory is still 200.3MB. Free memory was 161.2MB in the beginning and 159.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 565.57ms. Allocated memory is still 200.3MB. Free memory was 159.6MB in the beginning and 139.7MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 23649.36ms. Allocated memory was 200.3MB in the beginning and 375.4MB in the end (delta: 175.1MB). Free memory was 138.6MB in the beginning and 197.6MB in the end (delta: -59.0MB). Peak memory consumption was 182.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 117 PlacesBefore, 22 PlacesAfterwards, 121 TransitionsBefore, 19 TransitionsAfterwards, 1242 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 62 TrivialYvCompositions, 33 ConcurrentYvCompositions, 7 ChoiceCompositions, 103 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 778, independent: 768, independent conditional: 768, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 778, independent: 768, independent conditional: 0, independent unconditional: 768, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 778, independent: 768, independent conditional: 0, independent unconditional: 768, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 778, independent: 768, independent conditional: 0, independent unconditional: 768, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 683, independent: 675, independent conditional: 0, independent unconditional: 675, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 683, independent: 675, independent conditional: 0, independent unconditional: 675, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 778, independent: 93, independent conditional: 0, independent unconditional: 93, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 683, unknown conditional: 0, unknown unconditional: 683] , Statistics on independence cache: Total cache size (in pairs): 1219, Positive cache size: 1211, Positive conditional cache size: 0, Positive unconditional cache size: 1211, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, 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, 21 PlacesBefore, 21 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 8, 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: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 6, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 7, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 25 PlacesBefore, 24 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 10, Positive conditional cache size: 3, Positive unconditional cache size: 7, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 28 PlacesBefore, 27 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 10, Positive conditional cache size: 3, Positive unconditional cache size: 7, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, 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, 28 PlacesBefore, 28 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 10, Positive conditional cache size: 3, Positive unconditional cache size: 7, Negative cache size: 3, Negative conditional cache size: 1, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread2Thread1of1ForFork1_#t~nondet3#1_127 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread2Thread1of1ForFork1_#t~nondet3#1_127 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 07:37:28,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...