/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:18:38,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:18:38,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:18:38,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:18:38,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:18:38,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:18:38,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:18:38,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:18:38,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:18:38,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:18:38,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:18:38,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:18:38,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:18:38,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:18:38,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:18:38,895 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:18:38,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:18:38,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:18:38,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:18:38,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:18:38,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:18:38,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:18:38,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:18:38,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:18:38,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:18:38,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:18:38,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:18:38,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:18:38,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:18:38,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:18:38,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:18:38,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:18:38,915 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:18:38,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:18:38,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:18:38,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:18:38,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:18:38,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:18:38,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:18:38,917 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:18:38,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:18:38,922 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:18:38,948 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:18:38,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:18:38,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:18:38,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:18:38,950 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:18:38,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:18:38,951 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:18:38,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:18:38,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:18:38,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:18:38,952 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:18:38,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:18:38,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:18:38,952 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:18:38,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:18:38,953 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:18:38,953 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:18:38,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:18:38,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:18:38,953 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:18:38,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:18:38,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:18:38,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:18:38,953 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:18:38,953 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:18:38,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:18:38,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:18:38,954 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:18:38,954 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:18:39,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:18:39,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:18:39,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:18:39,245 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:18:39,246 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:18:39,247 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c [2022-12-06 05:18:40,337 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:18:40,552 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:18:40,553 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c [2022-12-06 05:18:40,559 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9481dd2ba/1b80938e1a9f4c00a50ead38a68f1ca4/FLAGa4b40c0df [2022-12-06 05:18:40,579 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9481dd2ba/1b80938e1a9f4c00a50ead38a68f1ca4 [2022-12-06 05:18:40,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:18:40,583 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:18:40,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:18:40,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:18:40,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:18:40,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:18:40" (1/1) ... [2022-12-06 05:18:40,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@de4b8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:40, skipping insertion in model container [2022-12-06 05:18:40,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:18:40" (1/1) ... [2022-12-06 05:18:40,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:18:40,621 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:18:40,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:40,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:40,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:40,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:40,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:40,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:40,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:40,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:40,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:40,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:40,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:40,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:40,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:40,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:40,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:40,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:40,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:40,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:40,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:40,761 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:40,774 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/parallel-parallel-sum-2.wvr.c[4225,4238] [2022-12-06 05:18:40,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:18:40,795 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:18:40,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:40,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:40,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:40,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:40,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:40,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:40,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:40,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:40,823 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:40,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:40,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:40,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:40,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:40,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:40,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:40,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:40,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:40,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:40,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:40,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:40,840 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/parallel-parallel-sum-2.wvr.c[4225,4238] [2022-12-06 05:18:40,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:18:40,852 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:18:40,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:40 WrapperNode [2022-12-06 05:18:40,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:18:40,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:18:40,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:18:40,854 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:18:40,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:40" (1/1) ... [2022-12-06 05:18:40,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:40" (1/1) ... [2022-12-06 05:18:40,919 INFO L138 Inliner]: procedures = 29, calls = 88, calls flagged for inlining = 22, calls inlined = 32, statements flattened = 386 [2022-12-06 05:18:40,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:18:40,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:18:40,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:18:40,920 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:18:40,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:40" (1/1) ... [2022-12-06 05:18:40,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:40" (1/1) ... [2022-12-06 05:18:40,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:40" (1/1) ... [2022-12-06 05:18:40,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:40" (1/1) ... [2022-12-06 05:18:40,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:40" (1/1) ... [2022-12-06 05:18:40,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:40" (1/1) ... [2022-12-06 05:18:40,959 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:40" (1/1) ... [2022-12-06 05:18:40,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:40" (1/1) ... [2022-12-06 05:18:40,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:18:40,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:18:40,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:18:40,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:18:40,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:40" (1/1) ... [2022-12-06 05:18:40,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:18:40,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:18:40,999 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:18:41,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:18:41,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:18:41,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:18:41,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:18:41,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:18:41,033 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:18:41,033 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:18:41,033 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:18:41,033 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:18:41,033 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:18:41,033 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:18:41,033 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 05:18:41,034 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 05:18:41,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:18:41,034 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-12-06 05:18:41,034 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-12-06 05:18:41,035 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-12-06 05:18:41,035 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-12-06 05:18:41,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:18:41,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:18:41,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:18:41,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:18:41,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:18:41,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:18:41,040 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:18:41,151 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:18:41,152 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:18:41,668 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:18:41,859 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:18:41,859 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-06 05:18:41,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:18:41 BoogieIcfgContainer [2022-12-06 05:18:41,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:18:41,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:18:41,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:18:41,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:18:41,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:18:40" (1/3) ... [2022-12-06 05:18:41,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583c0658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:18:41, skipping insertion in model container [2022-12-06 05:18:41,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:40" (2/3) ... [2022-12-06 05:18:41,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583c0658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:18:41, skipping insertion in model container [2022-12-06 05:18:41,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:18:41" (3/3) ... [2022-12-06 05:18:41,870 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-2.wvr.c [2022-12-06 05:18:41,887 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:18:41,887 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:18:41,887 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:18:42,012 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2022-12-06 05:18:42,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 289 places, 293 transitions, 658 flow [2022-12-06 05:18:42,156 INFO L130 PetriNetUnfolder]: 21/249 cut-off events. [2022-12-06 05:18:42,156 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:18:42,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 249 events. 21/249 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 283 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 212. Up to 3 conditions per place. [2022-12-06 05:18:42,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 289 places, 293 transitions, 658 flow [2022-12-06 05:18:42,178 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 239 places, 241 transitions, 530 flow [2022-12-06 05:18:42,179 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:42,200 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 239 places, 241 transitions, 530 flow [2022-12-06 05:18:42,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 241 transitions, 530 flow [2022-12-06 05:18:42,309 INFO L130 PetriNetUnfolder]: 21/241 cut-off events. [2022-12-06 05:18:42,309 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:18:42,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 241 events. 21/241 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 282 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 212. Up to 3 conditions per place. [2022-12-06 05:18:42,322 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 239 places, 241 transitions, 530 flow [2022-12-06 05:18:42,323 INFO L188 LiptonReduction]: Number of co-enabled transitions 8352 [2022-12-06 05:18:52,307 INFO L203 LiptonReduction]: Total number of compositions: 184 [2022-12-06 05:18:52,318 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:18:52,324 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;@44ec86c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:18:52,324 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-12-06 05:18:52,339 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-06 05:18:52,340 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:18:52,340 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:52,341 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:52,341 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 05:18:52,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:52,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1141140935, now seen corresponding path program 1 times [2022-12-06 05:18:52,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:52,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668406794] [2022-12-06 05:18:52,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:52,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:52,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 05:18:52,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:52,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668406794] [2022-12-06 05:18:52,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668406794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:52,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:52,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:18:52,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743710158] [2022-12-06 05:18:52,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:52,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 05:18:52,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:52,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 05:18:52,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 05:18:52,662 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 58 [2022-12-06 05:18:52,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 164 flow. Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:52,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:52,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 58 [2022-12-06 05:18:52,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:53,091 INFO L130 PetriNetUnfolder]: 3214/4245 cut-off events. [2022-12-06 05:18:53,091 INFO L131 PetriNetUnfolder]: For 787/787 co-relation queries the response was YES. [2022-12-06 05:18:53,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9422 conditions, 4245 events. 3214/4245 cut-off events. For 787/787 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 14775 event pairs, 1953 based on Foata normal form. 0/2955 useless extension candidates. Maximal degree in co-relation 9103. Up to 4099 conditions per place. [2022-12-06 05:18:53,112 INFO L137 encePairwiseOnDemand]: 57/58 looper letters, 41 selfloop transitions, 0 changer transitions 0/57 dead transitions. [2022-12-06 05:18:53,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 57 transitions, 244 flow [2022-12-06 05:18:53,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 05:18:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 05:18:53,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-12-06 05:18:53,122 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2022-12-06 05:18:53,123 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 164 flow. Second operand 2 states and 74 transitions. [2022-12-06 05:18:53,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 57 transitions, 244 flow [2022-12-06 05:18:53,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 57 transitions, 212 flow, removed 0 selfloop flow, removed 12 redundant places. [2022-12-06 05:18:53,136 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 130 flow [2022-12-06 05:18:53,138 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=130, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2022-12-06 05:18:53,140 INFO L294 CegarLoopForPetriNet]: 67 programPoint places, -11 predicate places. [2022-12-06 05:18:53,140 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:53,141 INFO L89 Accepts]: Start accepts. Operand has 56 places, 57 transitions, 130 flow [2022-12-06 05:18:53,144 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:53,144 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:53,144 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 57 transitions, 130 flow [2022-12-06 05:18:53,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 57 transitions, 130 flow [2022-12-06 05:18:53,151 INFO L130 PetriNetUnfolder]: 9/57 cut-off events. [2022-12-06 05:18:53,151 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:18:53,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 57 events. 9/57 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2022-12-06 05:18:53,152 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 57 transitions, 130 flow [2022-12-06 05:18:53,152 INFO L188 LiptonReduction]: Number of co-enabled transitions 1408 [2022-12-06 05:18:53,209 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:18:53,210 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-06 05:18:53,210 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 57 transitions, 130 flow [2022-12-06 05:18:53,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:53,211 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:53,211 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:53,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:18:53,211 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 05:18:53,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:53,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1645174705, now seen corresponding path program 1 times [2022-12-06 05:18:53,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:53,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293067460] [2022-12-06 05:18:53,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:53,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:53,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:53,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:53,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293067460] [2022-12-06 05:18:53,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293067460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:53,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:53,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:53,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740041295] [2022-12-06 05:18:53,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:53,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:18:53,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:53,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:18:53,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:18:53,772 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2022-12-06 05:18:53,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 57 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:53,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:53,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2022-12-06 05:18:53,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:54,723 INFO L130 PetriNetUnfolder]: 8121/10855 cut-off events. [2022-12-06 05:18:54,723 INFO L131 PetriNetUnfolder]: For 348/348 co-relation queries the response was YES. [2022-12-06 05:18:54,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22167 conditions, 10855 events. 8121/10855 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 47477 event pairs, 4054 based on Foata normal form. 82/8206 useless extension candidates. Maximal degree in co-relation 5475. Up to 4099 conditions per place. [2022-12-06 05:18:54,750 INFO L137 encePairwiseOnDemand]: 50/57 looper letters, 40 selfloop transitions, 2 changer transitions 63/121 dead transitions. [2022-12-06 05:18:54,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 121 transitions, 496 flow [2022-12-06 05:18:54,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:18:54,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:18:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2022-12-06 05:18:54,755 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6701754385964912 [2022-12-06 05:18:54,755 INFO L175 Difference]: Start difference. First operand has 55 places, 57 transitions, 130 flow. Second operand 5 states and 191 transitions. [2022-12-06 05:18:54,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 121 transitions, 496 flow [2022-12-06 05:18:54,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 121 transitions, 496 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 05:18:54,759 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 156 flow [2022-12-06 05:18:54,759 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2022-12-06 05:18:54,760 INFO L294 CegarLoopForPetriNet]: 67 programPoint places, -5 predicate places. [2022-12-06 05:18:54,760 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:54,760 INFO L89 Accepts]: Start accepts. Operand has 62 places, 58 transitions, 156 flow [2022-12-06 05:18:54,762 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:54,762 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:54,762 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 58 transitions, 156 flow [2022-12-06 05:18:54,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 58 transitions, 156 flow [2022-12-06 05:18:54,770 INFO L130 PetriNetUnfolder]: 13/71 cut-off events. [2022-12-06 05:18:54,770 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:18:54,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 71 events. 13/71 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 86. Up to 7 conditions per place. [2022-12-06 05:18:54,771 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 58 transitions, 156 flow [2022-12-06 05:18:54,771 INFO L188 LiptonReduction]: Number of co-enabled transitions 1400 [2022-12-06 05:18:56,169 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:18:56,170 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1410 [2022-12-06 05:18:56,170 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 152 flow [2022-12-06 05:18:56,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:56,171 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:56,171 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:56,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:18:56,171 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 05:18:56,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash -710630545, now seen corresponding path program 1 times [2022-12-06 05:18:56,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:56,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614044180] [2022-12-06 05:18:56,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:56,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:56,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:56,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614044180] [2022-12-06 05:18:56,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614044180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:56,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:56,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:56,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692272820] [2022-12-06 05:18:56,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:56,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:18:56,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:56,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:18:56,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:18:56,738 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2022-12-06 05:18:56,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:56,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:56,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2022-12-06 05:18:56,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:57,963 INFO L130 PetriNetUnfolder]: 9425/12139 cut-off events. [2022-12-06 05:18:57,963 INFO L131 PetriNetUnfolder]: For 5076/5076 co-relation queries the response was YES. [2022-12-06 05:18:57,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28865 conditions, 12139 events. 9425/12139 cut-off events. For 5076/5076 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 49161 event pairs, 2527 based on Foata normal form. 1/10567 useless extension candidates. Maximal degree in co-relation 28855. Up to 4567 conditions per place. [2022-12-06 05:18:58,036 INFO L137 encePairwiseOnDemand]: 48/57 looper letters, 117 selfloop transitions, 10 changer transitions 9/152 dead transitions. [2022-12-06 05:18:58,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 152 transitions, 691 flow [2022-12-06 05:18:58,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:18:58,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:18:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 233 transitions. [2022-12-06 05:18:58,038 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6812865497076024 [2022-12-06 05:18:58,039 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 152 flow. Second operand 6 states and 233 transitions. [2022-12-06 05:18:58,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 152 transitions, 691 flow [2022-12-06 05:18:58,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 152 transitions, 659 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-06 05:18:58,065 INFO L231 Difference]: Finished difference. Result has 64 places, 65 transitions, 211 flow [2022-12-06 05:18:58,065 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=64, PETRI_TRANSITIONS=65} [2022-12-06 05:18:58,066 INFO L294 CegarLoopForPetriNet]: 67 programPoint places, -3 predicate places. [2022-12-06 05:18:58,066 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:58,066 INFO L89 Accepts]: Start accepts. Operand has 64 places, 65 transitions, 211 flow [2022-12-06 05:18:58,068 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:58,068 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:58,068 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 65 transitions, 211 flow [2022-12-06 05:18:58,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 65 transitions, 211 flow [2022-12-06 05:18:58,094 INFO L130 PetriNetUnfolder]: 82/210 cut-off events. [2022-12-06 05:18:58,094 INFO L131 PetriNetUnfolder]: For 70/87 co-relation queries the response was YES. [2022-12-06 05:18:58,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 210 events. 82/210 cut-off events. For 70/87 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 719 event pairs, 4 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 376. Up to 60 conditions per place. [2022-12-06 05:18:58,098 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 65 transitions, 211 flow [2022-12-06 05:18:58,098 INFO L188 LiptonReduction]: Number of co-enabled transitions 1758 [2022-12-06 05:18:58,112 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:18:58,113 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 05:18:58,113 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 211 flow [2022-12-06 05:18:58,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:58,113 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:58,113 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:58,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:18:58,114 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 05:18:58,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:58,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1364708157, now seen corresponding path program 2 times [2022-12-06 05:18:58,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:58,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457484227] [2022-12-06 05:18:58,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:58,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:58,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:58,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:58,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457484227] [2022-12-06 05:18:58,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457484227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:58,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:58,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:18:58,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417452697] [2022-12-06 05:18:58,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:58,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:18:58,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:58,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:18:58,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:18:58,567 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2022-12-06 05:18:58,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 211 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:58,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:58,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2022-12-06 05:18:58,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:59,610 INFO L130 PetriNetUnfolder]: 9413/12113 cut-off events. [2022-12-06 05:18:59,610 INFO L131 PetriNetUnfolder]: For 8100/8100 co-relation queries the response was YES. [2022-12-06 05:18:59,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31942 conditions, 12113 events. 9413/12113 cut-off events. For 8100/8100 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 48919 event pairs, 2599 based on Foata normal form. 1/11274 useless extension candidates. Maximal degree in co-relation 31929. Up to 4567 conditions per place. [2022-12-06 05:18:59,667 INFO L137 encePairwiseOnDemand]: 48/57 looper letters, 112 selfloop transitions, 12 changer transitions 9/149 dead transitions. [2022-12-06 05:18:59,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 149 transitions, 716 flow [2022-12-06 05:18:59,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:18:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:18:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 228 transitions. [2022-12-06 05:18:59,669 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 05:18:59,669 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 211 flow. Second operand 6 states and 228 transitions. [2022-12-06 05:18:59,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 149 transitions, 716 flow [2022-12-06 05:18:59,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 149 transitions, 708 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 05:18:59,684 INFO L231 Difference]: Finished difference. Result has 70 places, 68 transitions, 264 flow [2022-12-06 05:18:59,684 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=264, PETRI_PLACES=70, PETRI_TRANSITIONS=68} [2022-12-06 05:18:59,684 INFO L294 CegarLoopForPetriNet]: 67 programPoint places, 3 predicate places. [2022-12-06 05:18:59,685 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:59,685 INFO L89 Accepts]: Start accepts. Operand has 70 places, 68 transitions, 264 flow [2022-12-06 05:18:59,699 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:59,699 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:59,699 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 68 transitions, 264 flow [2022-12-06 05:18:59,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 68 transitions, 264 flow [2022-12-06 05:18:59,749 INFO L130 PetriNetUnfolder]: 83/205 cut-off events. [2022-12-06 05:18:59,749 INFO L131 PetriNetUnfolder]: For 109/130 co-relation queries the response was YES. [2022-12-06 05:18:59,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 205 events. 83/205 cut-off events. For 109/130 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 673 event pairs, 3 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 404. Up to 58 conditions per place. [2022-12-06 05:18:59,753 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 68 transitions, 264 flow [2022-12-06 05:18:59,753 INFO L188 LiptonReduction]: Number of co-enabled transitions 1818 [2022-12-06 05:18:59,768 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:18:59,769 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 05:18:59,769 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 68 transitions, 264 flow [2022-12-06 05:18:59,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:59,770 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:59,770 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:59,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:18:59,770 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 05:18:59,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:59,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1401372854, now seen corresponding path program 1 times [2022-12-06 05:18:59,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:59,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267260488] [2022-12-06 05:18:59,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:59,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:00,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:00,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267260488] [2022-12-06 05:19:00,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267260488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:00,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:00,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:19:00,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87515879] [2022-12-06 05:19:00,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:00,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:00,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:00,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:00,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:00,045 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2022-12-06 05:19:00,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 68 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:00,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:00,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2022-12-06 05:19:00,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:01,621 INFO L130 PetriNetUnfolder]: 14216/18664 cut-off events. [2022-12-06 05:19:01,621 INFO L131 PetriNetUnfolder]: For 18711/18711 co-relation queries the response was YES. [2022-12-06 05:19:01,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50847 conditions, 18664 events. 14216/18664 cut-off events. For 18711/18711 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 85270 event pairs, 6254 based on Foata normal form. 888/18213 useless extension candidates. Maximal degree in co-relation 50828. Up to 12364 conditions per place. [2022-12-06 05:19:01,713 INFO L137 encePairwiseOnDemand]: 51/57 looper letters, 89 selfloop transitions, 6 changer transitions 1/112 dead transitions. [2022-12-06 05:19:01,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 112 transitions, 624 flow [2022-12-06 05:19:01,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:01,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-12-06 05:19:01,714 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6359649122807017 [2022-12-06 05:19:01,714 INFO L175 Difference]: Start difference. First operand has 69 places, 68 transitions, 264 flow. Second operand 4 states and 145 transitions. [2022-12-06 05:19:01,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 112 transitions, 624 flow [2022-12-06 05:19:01,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 112 transitions, 586 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:01,737 INFO L231 Difference]: Finished difference. Result has 71 places, 73 transitions, 309 flow [2022-12-06 05:19:01,738 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=309, PETRI_PLACES=71, PETRI_TRANSITIONS=73} [2022-12-06 05:19:01,740 INFO L294 CegarLoopForPetriNet]: 67 programPoint places, 4 predicate places. [2022-12-06 05:19:01,740 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:01,740 INFO L89 Accepts]: Start accepts. Operand has 71 places, 73 transitions, 309 flow [2022-12-06 05:19:01,742 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:01,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:01,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 73 transitions, 309 flow [2022-12-06 05:19:01,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 73 transitions, 309 flow [2022-12-06 05:19:01,761 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1261] L117-->L117: Formula: (let ((.cse0 (+ |v_thread6Thread1of1ForFork4_plus_~a#1_9| |v_thread6Thread1of1ForFork4_plus_~b#1_9|))) (and (<= |v_thread6Thread1of1ForFork4_plus_#res#1_9| 2147483647) (= |v_thread6Thread1of1ForFork4_plus_#in~b#1_9| |v_thread6Thread1of1ForFork4_plus_~b#1_9|) (= v_~i2~0_93 (+ v_~i2~0_94 1)) (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_17| (ite (or (<= .cse0 2147483647) (<= |v_thread6Thread1of1ForFork4_plus_~b#1_9| 0)) 1 0)) (= |v_thread6Thread1of1ForFork4_plus_#in~a#1_9| |v_thread6Thread1of1ForFork4_plus_~a#1_9|) (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_17| |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_17|) (not (= (ite (< v_~i2~0_94 v_~n~0_91) 1 0) 0)) (= v_~s22~0_64 |v_thread6Thread1of1ForFork4_plus_#in~a#1_9|) (<= 0 (+ 2147483648 |v_thread6Thread1of1ForFork4_plus_#res#1_9|)) (= |v_thread6Thread1of1ForFork4_plus_#in~b#1_9| v_~t22~0_33) (not (= (mod |v_thread6Thread1of1ForFork4_#t~nondet20#1_20| 256) 0)) (= .cse0 |v_thread6Thread1of1ForFork4_plus_#res#1_9|) (= v_~t22~0_33 (select (select |v_#memory_int_137| v_~x~0.base_85) (+ (* v_~i2~0_93 4) v_~x~0.offset_85))) (= v_~s22~0_63 |v_thread6Thread1of1ForFork4_plus_#res#1_9|))) InVars {thread6Thread1of1ForFork4_#t~nondet20#1=|v_thread6Thread1of1ForFork4_#t~nondet20#1_20|, ~x~0.base=v_~x~0.base_85, ~x~0.offset=v_~x~0.offset_85, #memory_int=|v_#memory_int_137|, ~i2~0=v_~i2~0_94, ~n~0=v_~n~0_91, ~s22~0=v_~s22~0_64} OutVars{~x~0.base=v_~x~0.base_85, ~x~0.offset=v_~x~0.offset_85, ~t22~0=v_~t22~0_33, thread6Thread1of1ForFork4_plus_~a#1=|v_thread6Thread1of1ForFork4_plus_~a#1_9|, ~i2~0=v_~i2~0_93, thread6Thread1of1ForFork4_plus_#in~a#1=|v_thread6Thread1of1ForFork4_plus_#in~a#1_9|, thread6Thread1of1ForFork4_plus_#in~b#1=|v_thread6Thread1of1ForFork4_plus_#in~b#1_9|, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_17|, thread6Thread1of1ForFork4_plus_~b#1=|v_thread6Thread1of1ForFork4_plus_~b#1_9|, thread6Thread1of1ForFork4_#t~ret23#1=|v_thread6Thread1of1ForFork4_#t~ret23#1_9|, #memory_int=|v_#memory_int_137|, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_17|, thread6Thread1of1ForFork4_#t~mem22#1=|v_thread6Thread1of1ForFork4_#t~mem22#1_13|, thread6Thread1of1ForFork4_plus_#res#1=|v_thread6Thread1of1ForFork4_plus_#res#1_9|, ~n~0=v_~n~0_91, ~s22~0=v_~s22~0_63, thread6Thread1of1ForFork4_#t~post21#1=|v_thread6Thread1of1ForFork4_#t~post21#1_13|} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_#t~nondet20#1, ~t22~0, thread6Thread1of1ForFork4_plus_~a#1, ~i2~0, thread6Thread1of1ForFork4_plus_#in~a#1, thread6Thread1of1ForFork4_plus_#in~b#1, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork4_plus_~b#1, thread6Thread1of1ForFork4_#t~ret23#1, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread6Thread1of1ForFork4_#t~mem22#1, thread6Thread1of1ForFork4_plus_#res#1, ~s22~0, thread6Thread1of1ForFork4_#t~post21#1][54], [Black: 324#(and (<= ~s21~0 ~x2~0) (= ~s11~0 0) (<= ~s21~0 ~s22~0) (<= ~s22~0 ~s21~0) (<= ~x2~0 ~s21~0) (= ~s12~0 0)), 79#L56true, 304#true, Black: 320#(and (= ~s11~0 0) (<= ~s21~0 ~s22~0) (<= ~s22~0 ~s21~0) (= ~s12~0 0)), 191#L117true, 275#L127-4true, Black: 300#(and (= (+ ~n~0 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~s11~0 0) (<= (+ ~s11~0 ~n~0 1) ~i2~0)), Black: 332#(and (or (= ~s11~0 0) (= ~s12~0 0)) (or (not (= ~s11~0 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 335#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~s11~0 0) (<= (+ ~s11~0 ~n~0) ~i2~0)), 112#L71true, 200#L102true, 199#L81-4true, Black: 307#(and (<= ~s11~0 ~s21~0) (<= ~s22~0 ~s11~0) (= ~s11~0 0) (<= ~s21~0 ~s22~0) (= ~s12~0 0)), Black: 311#(and (<= ~s11~0 ~s21~0) (= ~s11~0 0) (<= ~s22~0 0) (<= ~s21~0 ~s22~0) (<= 0 ~x1~0) (<= ~x1~0 ~s22~0) (= ~s12~0 0)), 196#L161-4true, 330#true]) [2022-12-06 05:19:01,763 INFO L382 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-06 05:19:01,763 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-06 05:19:01,763 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-06 05:19:01,763 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-06 05:19:01,769 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1261] L117-->L117: Formula: (let ((.cse0 (+ |v_thread6Thread1of1ForFork4_plus_~a#1_9| |v_thread6Thread1of1ForFork4_plus_~b#1_9|))) (and (<= |v_thread6Thread1of1ForFork4_plus_#res#1_9| 2147483647) (= |v_thread6Thread1of1ForFork4_plus_#in~b#1_9| |v_thread6Thread1of1ForFork4_plus_~b#1_9|) (= v_~i2~0_93 (+ v_~i2~0_94 1)) (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_17| (ite (or (<= .cse0 2147483647) (<= |v_thread6Thread1of1ForFork4_plus_~b#1_9| 0)) 1 0)) (= |v_thread6Thread1of1ForFork4_plus_#in~a#1_9| |v_thread6Thread1of1ForFork4_plus_~a#1_9|) (= |v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_17| |v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_17|) (not (= (ite (< v_~i2~0_94 v_~n~0_91) 1 0) 0)) (= v_~s22~0_64 |v_thread6Thread1of1ForFork4_plus_#in~a#1_9|) (<= 0 (+ 2147483648 |v_thread6Thread1of1ForFork4_plus_#res#1_9|)) (= |v_thread6Thread1of1ForFork4_plus_#in~b#1_9| v_~t22~0_33) (not (= (mod |v_thread6Thread1of1ForFork4_#t~nondet20#1_20| 256) 0)) (= .cse0 |v_thread6Thread1of1ForFork4_plus_#res#1_9|) (= v_~t22~0_33 (select (select |v_#memory_int_137| v_~x~0.base_85) (+ (* v_~i2~0_93 4) v_~x~0.offset_85))) (= v_~s22~0_63 |v_thread6Thread1of1ForFork4_plus_#res#1_9|))) InVars {thread6Thread1of1ForFork4_#t~nondet20#1=|v_thread6Thread1of1ForFork4_#t~nondet20#1_20|, ~x~0.base=v_~x~0.base_85, ~x~0.offset=v_~x~0.offset_85, #memory_int=|v_#memory_int_137|, ~i2~0=v_~i2~0_94, ~n~0=v_~n~0_91, ~s22~0=v_~s22~0_64} OutVars{~x~0.base=v_~x~0.base_85, ~x~0.offset=v_~x~0.offset_85, ~t22~0=v_~t22~0_33, thread6Thread1of1ForFork4_plus_~a#1=|v_thread6Thread1of1ForFork4_plus_~a#1_9|, ~i2~0=v_~i2~0_93, thread6Thread1of1ForFork4_plus_#in~a#1=|v_thread6Thread1of1ForFork4_plus_#in~a#1_9|, thread6Thread1of1ForFork4_plus_#in~b#1=|v_thread6Thread1of1ForFork4_plus_#in~b#1_9|, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1_17|, thread6Thread1of1ForFork4_plus_~b#1=|v_thread6Thread1of1ForFork4_plus_~b#1_9|, thread6Thread1of1ForFork4_#t~ret23#1=|v_thread6Thread1of1ForFork4_#t~ret23#1_9|, #memory_int=|v_#memory_int_137|, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_17|, thread6Thread1of1ForFork4_#t~mem22#1=|v_thread6Thread1of1ForFork4_#t~mem22#1_13|, thread6Thread1of1ForFork4_plus_#res#1=|v_thread6Thread1of1ForFork4_plus_#res#1_9|, ~n~0=v_~n~0_91, ~s22~0=v_~s22~0_63, thread6Thread1of1ForFork4_#t~post21#1=|v_thread6Thread1of1ForFork4_#t~post21#1_13|} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_#t~nondet20#1, ~t22~0, thread6Thread1of1ForFork4_plus_~a#1, ~i2~0, thread6Thread1of1ForFork4_plus_#in~a#1, thread6Thread1of1ForFork4_plus_#in~b#1, thread6Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork4_plus_~b#1, thread6Thread1of1ForFork4_#t~ret23#1, thread6Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread6Thread1of1ForFork4_#t~mem22#1, thread6Thread1of1ForFork4_plus_#res#1, ~s22~0, thread6Thread1of1ForFork4_#t~post21#1][54], [Black: 324#(and (<= ~s21~0 ~x2~0) (= ~s11~0 0) (<= ~s21~0 ~s22~0) (<= ~s22~0 ~s21~0) (<= ~x2~0 ~s21~0) (= ~s12~0 0)), 304#true, Black: 320#(and (= ~s11~0 0) (<= ~s21~0 ~s22~0) (<= ~s22~0 ~s21~0) (= ~s12~0 0)), 191#L117true, 275#L127-4true, Black: 300#(and (= (+ ~n~0 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~s11~0 0) (<= (+ ~s11~0 ~n~0 1) ~i2~0)), Black: 332#(and (or (= ~s11~0 0) (= ~s12~0 0)) (or (not (= ~s11~0 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 335#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~s11~0 0) (<= (+ ~s11~0 ~n~0) ~i2~0)), 200#L102true, Black: 307#(and (<= ~s11~0 ~s21~0) (<= ~s22~0 ~s11~0) (= ~s11~0 0) (<= ~s21~0 ~s22~0) (= ~s12~0 0)), Black: 311#(and (<= ~s11~0 ~s21~0) (= ~s11~0 0) (<= ~s22~0 0) (<= ~s21~0 ~s22~0) (<= 0 ~x1~0) (<= ~x1~0 ~s22~0) (= ~s12~0 0)), 228#L78-3true, 196#L161-4true, 330#true]) [2022-12-06 05:19:01,770 INFO L382 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-06 05:19:01,770 INFO L385 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-06 05:19:01,770 INFO L385 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-06 05:19:01,770 INFO L385 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-06 05:19:01,774 INFO L130 PetriNetUnfolder]: 103/285 cut-off events. [2022-12-06 05:19:01,774 INFO L131 PetriNetUnfolder]: For 206/227 co-relation queries the response was YES. [2022-12-06 05:19:01,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 285 events. 103/285 cut-off events. For 206/227 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1129 event pairs, 3 based on Foata normal form. 2/241 useless extension candidates. Maximal degree in co-relation 531. Up to 78 conditions per place. [2022-12-06 05:19:01,778 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 73 transitions, 309 flow [2022-12-06 05:19:01,778 INFO L188 LiptonReduction]: Number of co-enabled transitions 1944 [2022-12-06 05:19:04,860 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:19:04,860 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3120 [2022-12-06 05:19:04,861 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 306 flow [2022-12-06 05:19:04,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:04,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:04,861 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:04,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:19:04,861 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 05:19:04,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:04,861 INFO L85 PathProgramCache]: Analyzing trace with hash 907418301, now seen corresponding path program 1 times [2022-12-06 05:19:04,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:04,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968474893] [2022-12-06 05:19:04,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:04,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:05,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:05,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:05,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968474893] [2022-12-06 05:19:05,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968474893] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:19:05,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862125264] [2022-12-06 05:19:05,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:05,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:19:05,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:19:05,138 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:19:05,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:19:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:05,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 05:19:05,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:19:05,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:05,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:19:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:05,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862125264] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:19:05,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:19:05,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-12-06 05:19:05,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012678710] [2022-12-06 05:19:05,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:19:05,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:19:05,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:05,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:19:05,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:19:05,618 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 58 [2022-12-06 05:19:05,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 306 flow. Second operand has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:05,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:05,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 58 [2022-12-06 05:19:05,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:07,319 INFO L130 PetriNetUnfolder]: 14125/18579 cut-off events. [2022-12-06 05:19:07,319 INFO L131 PetriNetUnfolder]: For 18298/18298 co-relation queries the response was YES. [2022-12-06 05:19:07,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50054 conditions, 18579 events. 14125/18579 cut-off events. For 18298/18298 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 85154 event pairs, 4450 based on Foata normal form. 592/17798 useless extension candidates. Maximal degree in co-relation 45072. Up to 6979 conditions per place. [2022-12-06 05:19:07,450 INFO L137 encePairwiseOnDemand]: 50/58 looper letters, 141 selfloop transitions, 12 changer transitions 22/191 dead transitions. [2022-12-06 05:19:07,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 191 transitions, 1009 flow [2022-12-06 05:19:07,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:19:07,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:19:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 285 transitions. [2022-12-06 05:19:07,452 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7019704433497537 [2022-12-06 05:19:07,452 INFO L175 Difference]: Start difference. First operand has 70 places, 72 transitions, 306 flow. Second operand 7 states and 285 transitions. [2022-12-06 05:19:07,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 191 transitions, 1009 flow [2022-12-06 05:19:07,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 191 transitions, 998 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 05:19:07,485 INFO L231 Difference]: Finished difference. Result has 76 places, 70 transitions, 317 flow [2022-12-06 05:19:07,485 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=317, PETRI_PLACES=76, PETRI_TRANSITIONS=70} [2022-12-06 05:19:07,485 INFO L294 CegarLoopForPetriNet]: 67 programPoint places, 9 predicate places. [2022-12-06 05:19:07,486 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:07,486 INFO L89 Accepts]: Start accepts. Operand has 76 places, 70 transitions, 317 flow [2022-12-06 05:19:07,487 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:07,487 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:07,487 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 70 transitions, 317 flow [2022-12-06 05:19:07,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 70 transitions, 317 flow [2022-12-06 05:19:07,515 INFO L130 PetriNetUnfolder]: 80/211 cut-off events. [2022-12-06 05:19:07,516 INFO L131 PetriNetUnfolder]: For 360/393 co-relation queries the response was YES. [2022-12-06 05:19:07,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 211 events. 80/211 cut-off events. For 360/393 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 727 event pairs, 1 based on Foata normal form. 2/182 useless extension candidates. Maximal degree in co-relation 489. Up to 59 conditions per place. [2022-12-06 05:19:07,521 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 70 transitions, 317 flow [2022-12-06 05:19:07,521 INFO L188 LiptonReduction]: Number of co-enabled transitions 1882 [2022-12-06 05:19:07,537 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:19:07,538 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-06 05:19:07,538 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 70 transitions, 317 flow [2022-12-06 05:19:07,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:07,538 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:07,538 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:07,560 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 05:19:07,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-06 05:19:07,746 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 05:19:07,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:07,747 INFO L85 PathProgramCache]: Analyzing trace with hash 958440413, now seen corresponding path program 1 times [2022-12-06 05:19:07,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:07,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636563395] [2022-12-06 05:19:07,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:07,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:19:07,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:07,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636563395] [2022-12-06 05:19:07,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636563395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:19:07,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:19:07,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:19:07,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218482656] [2022-12-06 05:19:07,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:19:07,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:19:07,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:07,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:19:07,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:19:07,962 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2022-12-06 05:19:07,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 transitions, 317 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:07,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:07,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2022-12-06 05:19:07,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:10,087 INFO L130 PetriNetUnfolder]: 22336/28317 cut-off events. [2022-12-06 05:19:10,087 INFO L131 PetriNetUnfolder]: For 50462/50462 co-relation queries the response was YES. [2022-12-06 05:19:10,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85382 conditions, 28317 events. 22336/28317 cut-off events. For 50462/50462 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 122894 event pairs, 6715 based on Foata normal form. 106/26389 useless extension candidates. Maximal degree in co-relation 85370. Up to 11839 conditions per place. [2022-12-06 05:19:10,229 INFO L137 encePairwiseOnDemand]: 51/57 looper letters, 109 selfloop transitions, 11 changer transitions 2/138 dead transitions. [2022-12-06 05:19:10,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 138 transitions, 838 flow [2022-12-06 05:19:10,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:19:10,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:19:10,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2022-12-06 05:19:10,231 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7456140350877193 [2022-12-06 05:19:10,231 INFO L175 Difference]: Start difference. First operand has 74 places, 70 transitions, 317 flow. Second operand 4 states and 170 transitions. [2022-12-06 05:19:10,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 138 transitions, 838 flow [2022-12-06 05:19:10,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 138 transitions, 782 flow, removed 23 selfloop flow, removed 3 redundant places. [2022-12-06 05:19:10,707 INFO L231 Difference]: Finished difference. Result has 74 places, 74 transitions, 361 flow [2022-12-06 05:19:10,708 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=361, PETRI_PLACES=74, PETRI_TRANSITIONS=74} [2022-12-06 05:19:10,708 INFO L294 CegarLoopForPetriNet]: 67 programPoint places, 7 predicate places. [2022-12-06 05:19:10,708 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:19:10,708 INFO L89 Accepts]: Start accepts. Operand has 74 places, 74 transitions, 361 flow [2022-12-06 05:19:10,709 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:19:10,709 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:19:10,709 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 74 transitions, 361 flow [2022-12-06 05:19:10,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 74 transitions, 361 flow [2022-12-06 05:19:10,732 INFO L130 PetriNetUnfolder]: 105/253 cut-off events. [2022-12-06 05:19:10,732 INFO L131 PetriNetUnfolder]: For 461/486 co-relation queries the response was YES. [2022-12-06 05:19:10,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 253 events. 105/253 cut-off events. For 461/486 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 892 event pairs, 4 based on Foata normal form. 3/215 useless extension candidates. Maximal degree in co-relation 656. Up to 79 conditions per place. [2022-12-06 05:19:10,736 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 74 transitions, 361 flow [2022-12-06 05:19:10,736 INFO L188 LiptonReduction]: Number of co-enabled transitions 2054 [2022-12-06 05:19:10,745 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:19:10,745 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 05:19:10,746 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 361 flow [2022-12-06 05:19:10,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:10,746 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:19:10,746 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:19:10,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:19:10,746 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 05:19:10,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:19:10,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1677482446, now seen corresponding path program 1 times [2022-12-06 05:19:10,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:19:10,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596099973] [2022-12-06 05:19:10,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:10,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:19:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:12,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:19:12,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596099973] [2022-12-06 05:19:12,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596099973] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:19:12,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002138922] [2022-12-06 05:19:12,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:19:12,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:19:12,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:19:12,912 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:19:12,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:19:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:19:13,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-06 05:19:13,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:19:13,760 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 15 treesize of output 7 [2022-12-06 05:19:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:13,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:19:13,958 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:19:13,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2022-12-06 05:19:13,974 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 05:19:13,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 14 [2022-12-06 05:19:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:19:14,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002138922] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:19:14,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:19:14,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6, 6] total 24 [2022-12-06 05:19:14,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232680399] [2022-12-06 05:19:14,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:19:14,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 05:19:14,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:19:14,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 05:19:14,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2022-12-06 05:19:14,189 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 57 [2022-12-06 05:19:14,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 361 flow. Second operand has 25 states, 25 states have (on average 11.8) internal successors, (295), 25 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:19:14,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:19:14,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 57 [2022-12-06 05:19:14,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:19:54,521 INFO L130 PetriNetUnfolder]: 188447/240522 cut-off events. [2022-12-06 05:19:54,521 INFO L131 PetriNetUnfolder]: For 448579/448579 co-relation queries the response was YES. [2022-12-06 05:19:55,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725794 conditions, 240522 events. 188447/240522 cut-off events. For 448579/448579 co-relation queries the response was YES. Maximal size of possible extension queue 4710. Compared 1346534 event pairs, 14357 based on Foata normal form. 11383/235212 useless extension candidates. Maximal degree in co-relation 410916. Up to 40997 conditions per place. [2022-12-06 05:19:55,740 INFO L137 encePairwiseOnDemand]: 37/57 looper letters, 1976 selfloop transitions, 406 changer transitions 344/2733 dead transitions. [2022-12-06 05:19:55,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 2733 transitions, 15306 flow [2022-12-06 05:19:55,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2022-12-06 05:19:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2022-12-06 05:19:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 3897 transitions. [2022-12-06 05:19:55,748 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4143540669856459 [2022-12-06 05:19:55,749 INFO L175 Difference]: Start difference. First operand has 73 places, 74 transitions, 361 flow. Second operand 165 states and 3897 transitions. [2022-12-06 05:19:55,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 2733 transitions, 15306 flow [2022-12-06 05:20:12,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 2733 transitions, 14988 flow, removed 159 selfloop flow, removed 1 redundant places. [2022-12-06 05:20:12,735 INFO L231 Difference]: Finished difference. Result has 313 places, 584 transitions, 5617 flow [2022-12-06 05:20:12,735 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=165, PETRI_FLOW=5617, PETRI_PLACES=313, PETRI_TRANSITIONS=584} [2022-12-06 05:20:12,736 INFO L294 CegarLoopForPetriNet]: 67 programPoint places, 246 predicate places. [2022-12-06 05:20:12,736 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:12,736 INFO L89 Accepts]: Start accepts. Operand has 313 places, 584 transitions, 5617 flow [2022-12-06 05:20:12,743 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:12,743 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:12,743 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 313 places, 584 transitions, 5617 flow [2022-12-06 05:20:12,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 292 places, 584 transitions, 5617 flow [2022-12-06 05:20:13,415 INFO L130 PetriNetUnfolder]: 1736/3996 cut-off events. [2022-12-06 05:20:13,416 INFO L131 PetriNetUnfolder]: For 131176/131805 co-relation queries the response was YES. [2022-12-06 05:20:13,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21440 conditions, 3996 events. 1736/3996 cut-off events. For 131176/131805 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 31123 event pairs, 74 based on Foata normal form. 39/3366 useless extension candidates. Maximal degree in co-relation 21131. Up to 970 conditions per place. [2022-12-06 05:20:13,526 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 292 places, 584 transitions, 5617 flow [2022-12-06 05:20:13,526 INFO L188 LiptonReduction]: Number of co-enabled transitions 12662 [2022-12-06 05:20:13,533 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1237] L124-4-->thread4EXIT: Formula: (= (store |v_#valid_181| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_38| 0) |v_#valid_180|) InVars {#valid=|v_#valid_181|, thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_38|} OutVars{#valid=|v_#valid_180|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_27|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, thread4Thread1of1ForFork5_~#t6~0#1.offset] and [972] $Ultimate##0-->L78: Formula: (and (= |v_#length_1| (store |v_#length_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 4)) (not (= |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 0)) (< |v_#StackHeapBarrier_1| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 1)) (= (select |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) 0) (= |v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t2~0#1.offset, #valid, #length, thread1Thread1of1ForFork2_~#t2~0#1.base] [2022-12-06 05:20:13,574 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1237] L124-4-->thread4EXIT: Formula: (= (store |v_#valid_181| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_38| 0) |v_#valid_180|) InVars {#valid=|v_#valid_181|, thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_38|} OutVars{#valid=|v_#valid_180|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_27|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, thread4Thread1of1ForFork5_~#t6~0#1.offset] and [972] $Ultimate##0-->L78: Formula: (and (= |v_#length_1| (store |v_#length_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 4)) (not (= |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 0)) (< |v_#StackHeapBarrier_1| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 1)) (= (select |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) 0) (= |v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t2~0#1.offset, #valid, #length, thread1Thread1of1ForFork2_~#t2~0#1.base] [2022-12-06 05:20:13,623 WARN L322 ript$VariableManager]: TermVariable LBE677 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:13,623 WARN L322 ript$VariableManager]: TermVariable LBE662 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:13,623 WARN L322 ript$VariableManager]: TermVariable LBE340 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:13,624 WARN L322 ript$VariableManager]: TermVariable LBE361 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:13,624 WARN L322 ript$VariableManager]: TermVariable LBE371 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:13,624 WARN L322 ript$VariableManager]: TermVariable LBE580 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:14,012 WARN L322 ript$VariableManager]: TermVariable LBE622 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:14,013 WARN L322 ript$VariableManager]: TermVariable LBE610 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:14,013 WARN L322 ript$VariableManager]: TermVariable LBE86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:14,013 WARN L322 ript$VariableManager]: TermVariable LBE592 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:14,013 WARN L322 ript$VariableManager]: TermVariable LBE107 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:14,013 WARN L322 ript$VariableManager]: TermVariable LBE117 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:14,432 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1324] L83-2-->L78-3: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork2_plus_~a#1_Out_10|))) (and (<= v_~x1~0_Out_34 2147483647) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_Out_10|) (= v_~x1~0_Out_34 |v_thread1Thread1of1ForFork2_plus_#res#1_Out_10|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_Out_10| |v_thread1Thread1of1ForFork2_plus_~a#1_Out_10|) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_Out_10| |v_thread1Thread1of1ForFork2_plus_~b#1_Out_10|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_16| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_12|) (= v_~s21~0_In_6 |v_thread1Thread1of1ForFork2_plus_#in~b#1_Out_10|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_Out_10| v_~s11~0_In_7) (<= 0 (+ v_~x1~0_Out_34 2147483648)) (not (= (ite (= v_~i1~0_In_5 v_~n~0_In_13) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_Out_10| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_12|) (= |v_#valid_Out_44| (store |v_#valid_In_28| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_In_5| 0)))) InVars {~s11~0=v_~s11~0_In_7, #valid=|v_#valid_In_28|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_In_5|, ~i1~0=v_~i1~0_In_5, ~s21~0=v_~s21~0_In_6, ~n~0=v_~n~0_In_13} OutVars{thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_Out_10|, thread1Thread1of1ForFork2_#t~mem14#1=|v_thread1Thread1of1ForFork2_#t~mem14#1_Out_4|, ~s11~0=v_~s11~0_In_7, thread1Thread1of1ForFork2_#t~ret15#1=|v_thread1Thread1of1ForFork2_#t~ret15#1_Out_10|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_Out_10|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_Out_10|, ~i1~0=v_~i1~0_In_5, ~x1~0=v_~x1~0_Out_34, #valid=|v_#valid_Out_44|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_12|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_Out_10|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_In_5|, ~s21~0=v_~s21~0_In_6, ~n~0=v_~n~0_In_13, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_16|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_Out_10|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem14#1, thread1Thread1of1ForFork2_#t~ret15#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, ~x1~0, #valid, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] and [1237] L124-4-->thread4EXIT: Formula: (= (store |v_#valid_181| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_38| 0) |v_#valid_180|) InVars {#valid=|v_#valid_181|, thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_38|} OutVars{#valid=|v_#valid_180|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_27|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, thread4Thread1of1ForFork5_~#t6~0#1.offset] [2022-12-06 05:20:14,581 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1237] L124-4-->thread4EXIT: Formula: (= (store |v_#valid_181| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_38| 0) |v_#valid_180|) InVars {#valid=|v_#valid_181|, thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_38|} OutVars{#valid=|v_#valid_180|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_27|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, thread4Thread1of1ForFork5_~#t6~0#1.offset] and [1248] L78-3-->thread1EXIT: Formula: (= |v_#valid_194| (store |v_#valid_195| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_44| 0)) InVars {#valid=|v_#valid_195|, thread1Thread1of1ForFork2_~#t3~0#1.base=|v_thread1Thread1of1ForFork2_~#t3~0#1.base_44|} OutVars{thread1Thread1of1ForFork2_~#t3~0#1.offset=|v_thread1Thread1of1ForFork2_~#t3~0#1.offset_31|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_25|, #valid=|v_#valid_194|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_35|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t3~0#1.offset, thread1Thread1of1ForFork2_~#t2~0#1.offset, #valid, thread1Thread1of1ForFork2_~#t2~0#1.base, thread1Thread1of1ForFork2_~#t3~0#1.base] [2022-12-06 05:20:14,861 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1341] L83-2-->thread4EXIT: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_72| |v_thread1Thread1of1ForFork2_plus_~b#1_72|))) (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_96| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_88|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_72| v_~s11~0_223) (= |v_#valid_646| (store (store |v_#valid_648| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_147| 0) |v_thread4Thread1of1ForFork5_~#t6~0#1.base_132| 0)) (= |v_thread1Thread1of1ForFork2_plus_~a#1_72| |v_thread1Thread1of1ForFork2_plus_#in~a#1_72|) (= |v_thread1Thread1of1ForFork2_plus_~b#1_72| |v_thread1Thread1of1ForFork2_plus_#in~b#1_72|) (= v_~s21~0_167 |v_thread1Thread1of1ForFork2_plus_#in~b#1_72|) (= |v_thread1Thread1of1ForFork2_#res#1.base_72| 0) (= |v_thread1Thread1of1ForFork2_plus_#res#1_72| .cse0) (= v_~x1~0_136 |v_thread1Thread1of1ForFork2_plus_#res#1_72|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_72| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_88|) (not (= (ite (= v_~i1~0_251 v_~n~0_263) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_72| 0) (<= 0 (+ v_~x1~0_136 2147483648)) (<= v_~x1~0_136 2147483647))) InVars {~s11~0=v_~s11~0_223, #valid=|v_#valid_648|, thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_132|, ~i1~0=v_~i1~0_251, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_147|, ~s21~0=v_~s21~0_167, ~n~0=v_~n~0_263} OutVars{thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_72|, thread1Thread1of1ForFork2_#t~mem14#1=|v_thread1Thread1of1ForFork2_#t~mem14#1_82|, ~s11~0=v_~s11~0_223, thread1Thread1of1ForFork2_#t~ret15#1=|v_thread1Thread1of1ForFork2_#t~ret15#1_72|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_72|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_72|, ~i1~0=v_~i1~0_251, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_101|, ~x1~0=v_~x1~0_136, #valid=|v_#valid_646|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_88|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_72|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_72|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_147|, ~s21~0=v_~s21~0_167, ~n~0=v_~n~0_263, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_72|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_96|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_72|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem14#1, thread1Thread1of1ForFork2_#t~ret15#1, thread4Thread1of1ForFork5_~#t6~0#1.base, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork5_~#t6~0#1.offset, ~x1~0, #valid, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] and [1248] L78-3-->thread1EXIT: Formula: (= |v_#valid_194| (store |v_#valid_195| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_44| 0)) InVars {#valid=|v_#valid_195|, thread1Thread1of1ForFork2_~#t3~0#1.base=|v_thread1Thread1of1ForFork2_~#t3~0#1.base_44|} OutVars{thread1Thread1of1ForFork2_~#t3~0#1.offset=|v_thread1Thread1of1ForFork2_~#t3~0#1.offset_31|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_25|, #valid=|v_#valid_194|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_35|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t3~0#1.offset, thread1Thread1of1ForFork2_~#t2~0#1.offset, #valid, thread1Thread1of1ForFork2_~#t2~0#1.base, thread1Thread1of1ForFork2_~#t3~0#1.base] [2022-12-06 05:20:14,999 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1296] L129-2-->L124-4: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork5_plus_~a#1_29| |v_thread4Thread1of1ForFork5_plus_~b#1_29|))) (and (= 0 |v_thread4Thread1of1ForFork5_#res#1.base_29|) (= |v_thread4Thread1of1ForFork5_plus_#res#1_29| v_~x2~0_69) (= |v_#valid_264| (store |v_#valid_265| |v_thread4Thread1of1ForFork5_~#t5~0#1.base_66| 0)) (= |v_thread4Thread1of1ForFork5_plus_#res#1_29| .cse0) (= |v_thread4Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_49| |v_thread4Thread1of1ForFork5_assume_abort_if_not_~cond#1_53|) (<= 0 (+ v_~x2~0_69 2147483648)) (= |v_thread4Thread1of1ForFork5_plus_#in~b#1_29| v_~s22~0_81) (<= v_~x2~0_69 2147483647) (= |v_thread4Thread1of1ForFork5_plus_#in~a#1_29| |v_thread4Thread1of1ForFork5_plus_~a#1_29|) (= |v_thread4Thread1of1ForFork5_plus_#in~a#1_29| v_~s12~0_56) (= |v_thread4Thread1of1ForFork5_#res#1.offset_29| 0) (not (= (ite (= v_~i2~0_107 v_~n~0_113) 1 0) 0)) (= |v_thread4Thread1of1ForFork5_plus_#in~b#1_29| |v_thread4Thread1of1ForFork5_plus_~b#1_29|) (= (ite (or (<= |v_thread4Thread1of1ForFork5_plus_~b#1_29| 0) (<= .cse0 2147483647)) 1 0) |v_thread4Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_49|))) InVars {~s12~0=v_~s12~0_56, #valid=|v_#valid_265|, thread4Thread1of1ForFork5_~#t5~0#1.base=|v_thread4Thread1of1ForFork5_~#t5~0#1.base_66|, ~i2~0=v_~i2~0_107, ~n~0=v_~n~0_113, ~s22~0=v_~s22~0_81} OutVars{~s12~0=v_~s12~0_56, ~x2~0=v_~x2~0_69, thread4Thread1of1ForFork5_plus_~b#1=|v_thread4Thread1of1ForFork5_plus_~b#1_29|, thread4Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork5_assume_abort_if_not_~cond#1_53|, thread4Thread1of1ForFork5_~#t5~0#1.offset=|v_thread4Thread1of1ForFork5_~#t5~0#1.offset_47|, thread4Thread1of1ForFork5_#res#1.base=|v_thread4Thread1of1ForFork5_#res#1.base_29|, thread4Thread1of1ForFork5_plus_#in~b#1=|v_thread4Thread1of1ForFork5_plus_#in~b#1_29|, thread4Thread1of1ForFork5_plus_#res#1=|v_thread4Thread1of1ForFork5_plus_#res#1_29|, thread4Thread1of1ForFork5_#t~ret30#1=|v_thread4Thread1of1ForFork5_#t~ret30#1_29|, thread4Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_49|, ~i2~0=v_~i2~0_107, thread4Thread1of1ForFork5_#t~mem29#1=|v_thread4Thread1of1ForFork5_#t~mem29#1_17|, thread4Thread1of1ForFork5_plus_#in~a#1=|v_thread4Thread1of1ForFork5_plus_#in~a#1_29|, #valid=|v_#valid_264|, ~n~0=v_~n~0_113, thread4Thread1of1ForFork5_#res#1.offset=|v_thread4Thread1of1ForFork5_#res#1.offset_29|, thread4Thread1of1ForFork5_plus_~a#1=|v_thread4Thread1of1ForFork5_plus_~a#1_29|, ~s22~0=v_~s22~0_81} AuxVars[] AssignedVars[~x2~0, thread4Thread1of1ForFork5_plus_~b#1, thread4Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork5_~#t5~0#1.offset, thread4Thread1of1ForFork5_#res#1.base, thread4Thread1of1ForFork5_plus_#in~b#1, thread4Thread1of1ForFork5_plus_#res#1, thread4Thread1of1ForFork5_#t~ret30#1, thread4Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork5_#t~mem29#1, thread4Thread1of1ForFork5_plus_#in~a#1, #valid, thread4Thread1of1ForFork5_~#t5~0#1.base, thread4Thread1of1ForFork5_#res#1.offset, thread4Thread1of1ForFork5_plus_~a#1] and [972] $Ultimate##0-->L78: Formula: (and (= |v_#length_1| (store |v_#length_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 4)) (not (= |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 0)) (< |v_#StackHeapBarrier_1| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 1)) (= (select |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) 0) (= |v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t2~0#1.offset, #valid, #length, thread1Thread1of1ForFork2_~#t2~0#1.base] [2022-12-06 05:20:15,295 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1237] L124-4-->thread4EXIT: Formula: (= (store |v_#valid_181| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_38| 0) |v_#valid_180|) InVars {#valid=|v_#valid_181|, thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_38|} OutVars{#valid=|v_#valid_180|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_27|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, thread4Thread1of1ForFork5_~#t6~0#1.offset] and [1344] L83-2-->thread1EXIT: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_76| |v_thread1Thread1of1ForFork2_plus_~b#1_76|))) (and (= |v_thread1Thread1of1ForFork2_#res#1.base_76| 0) (<= 0 (+ v_~x1~0_140 2147483648)) (= |v_thread1Thread1of1ForFork2_#res#1.offset_76| 0) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_92| (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_76| 0)) 1 0)) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_76|) (<= v_~x1~0_140 2147483647) (= |v_thread1Thread1of1ForFork2_plus_~a#1_76| |v_thread1Thread1of1ForFork2_plus_#in~a#1_76|) (= |v_#valid_664| (store (store |v_#valid_666| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_156| 0) |v_thread1Thread1of1ForFork2_~#t3~0#1.base_131| 0)) (= v_~s21~0_171 |v_thread1Thread1of1ForFork2_plus_#in~b#1_76|) (not (= (ite (= v_~i1~0_255 v_~n~0_267) 1 0) 0)) (= v_~x1~0_140 |v_thread1Thread1of1ForFork2_plus_#res#1_76|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_100| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_92|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_76| v_~s11~0_227) (= |v_thread1Thread1of1ForFork2_plus_~b#1_76| |v_thread1Thread1of1ForFork2_plus_#in~b#1_76|))) InVars {~s11~0=v_~s11~0_227, #valid=|v_#valid_666|, thread1Thread1of1ForFork2_~#t3~0#1.base=|v_thread1Thread1of1ForFork2_~#t3~0#1.base_131|, ~i1~0=v_~i1~0_255, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_156|, ~s21~0=v_~s21~0_171, ~n~0=v_~n~0_267} OutVars{thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_76|, thread1Thread1of1ForFork2_#t~mem14#1=|v_thread1Thread1of1ForFork2_#t~mem14#1_86|, ~s11~0=v_~s11~0_227, thread1Thread1of1ForFork2_~#t3~0#1.offset=|v_thread1Thread1of1ForFork2_~#t3~0#1.offset_103|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_83|, thread1Thread1of1ForFork2_#t~ret15#1=|v_thread1Thread1of1ForFork2_#t~ret15#1_76|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_76|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_76|, ~i1~0=v_~i1~0_255, ~x1~0=v_~x1~0_140, #valid=|v_#valid_664|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_92|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_76|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_76|, ~s21~0=v_~s21~0_171, ~n~0=v_~n~0_267, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_76|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_100|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_76|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem14#1, thread1Thread1of1ForFork2_~#t3~0#1.offset, thread1Thread1of1ForFork2_~#t2~0#1.offset, thread1Thread1of1ForFork2_#t~ret15#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_~#t3~0#1.base, ~x1~0, #valid, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_~#t2~0#1.base, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 05:20:15,483 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1296] L129-2-->L124-4: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork5_plus_~a#1_29| |v_thread4Thread1of1ForFork5_plus_~b#1_29|))) (and (= 0 |v_thread4Thread1of1ForFork5_#res#1.base_29|) (= |v_thread4Thread1of1ForFork5_plus_#res#1_29| v_~x2~0_69) (= |v_#valid_264| (store |v_#valid_265| |v_thread4Thread1of1ForFork5_~#t5~0#1.base_66| 0)) (= |v_thread4Thread1of1ForFork5_plus_#res#1_29| .cse0) (= |v_thread4Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_49| |v_thread4Thread1of1ForFork5_assume_abort_if_not_~cond#1_53|) (<= 0 (+ v_~x2~0_69 2147483648)) (= |v_thread4Thread1of1ForFork5_plus_#in~b#1_29| v_~s22~0_81) (<= v_~x2~0_69 2147483647) (= |v_thread4Thread1of1ForFork5_plus_#in~a#1_29| |v_thread4Thread1of1ForFork5_plus_~a#1_29|) (= |v_thread4Thread1of1ForFork5_plus_#in~a#1_29| v_~s12~0_56) (= |v_thread4Thread1of1ForFork5_#res#1.offset_29| 0) (not (= (ite (= v_~i2~0_107 v_~n~0_113) 1 0) 0)) (= |v_thread4Thread1of1ForFork5_plus_#in~b#1_29| |v_thread4Thread1of1ForFork5_plus_~b#1_29|) (= (ite (or (<= |v_thread4Thread1of1ForFork5_plus_~b#1_29| 0) (<= .cse0 2147483647)) 1 0) |v_thread4Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_49|))) InVars {~s12~0=v_~s12~0_56, #valid=|v_#valid_265|, thread4Thread1of1ForFork5_~#t5~0#1.base=|v_thread4Thread1of1ForFork5_~#t5~0#1.base_66|, ~i2~0=v_~i2~0_107, ~n~0=v_~n~0_113, ~s22~0=v_~s22~0_81} OutVars{~s12~0=v_~s12~0_56, ~x2~0=v_~x2~0_69, thread4Thread1of1ForFork5_plus_~b#1=|v_thread4Thread1of1ForFork5_plus_~b#1_29|, thread4Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork5_assume_abort_if_not_~cond#1_53|, thread4Thread1of1ForFork5_~#t5~0#1.offset=|v_thread4Thread1of1ForFork5_~#t5~0#1.offset_47|, thread4Thread1of1ForFork5_#res#1.base=|v_thread4Thread1of1ForFork5_#res#1.base_29|, thread4Thread1of1ForFork5_plus_#in~b#1=|v_thread4Thread1of1ForFork5_plus_#in~b#1_29|, thread4Thread1of1ForFork5_plus_#res#1=|v_thread4Thread1of1ForFork5_plus_#res#1_29|, thread4Thread1of1ForFork5_#t~ret30#1=|v_thread4Thread1of1ForFork5_#t~ret30#1_29|, thread4Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_49|, ~i2~0=v_~i2~0_107, thread4Thread1of1ForFork5_#t~mem29#1=|v_thread4Thread1of1ForFork5_#t~mem29#1_17|, thread4Thread1of1ForFork5_plus_#in~a#1=|v_thread4Thread1of1ForFork5_plus_#in~a#1_29|, #valid=|v_#valid_264|, ~n~0=v_~n~0_113, thread4Thread1of1ForFork5_#res#1.offset=|v_thread4Thread1of1ForFork5_#res#1.offset_29|, thread4Thread1of1ForFork5_plus_~a#1=|v_thread4Thread1of1ForFork5_plus_~a#1_29|, ~s22~0=v_~s22~0_81} AuxVars[] AssignedVars[~x2~0, thread4Thread1of1ForFork5_plus_~b#1, thread4Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork5_~#t5~0#1.offset, thread4Thread1of1ForFork5_#res#1.base, thread4Thread1of1ForFork5_plus_#in~b#1, thread4Thread1of1ForFork5_plus_#res#1, thread4Thread1of1ForFork5_#t~ret30#1, thread4Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork5_#t~mem29#1, thread4Thread1of1ForFork5_plus_#in~a#1, #valid, thread4Thread1of1ForFork5_~#t5~0#1.base, thread4Thread1of1ForFork5_#res#1.offset, thread4Thread1of1ForFork5_plus_~a#1] and [972] $Ultimate##0-->L78: Formula: (and (= |v_#length_1| (store |v_#length_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 4)) (not (= |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 0)) (< |v_#StackHeapBarrier_1| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 1)) (= (select |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) 0) (= |v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t2~0#1.offset, #valid, #length, thread1Thread1of1ForFork2_~#t2~0#1.base] [2022-12-06 05:20:15,714 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1248] L78-3-->thread1EXIT: Formula: (= |v_#valid_194| (store |v_#valid_195| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_44| 0)) InVars {#valid=|v_#valid_195|, thread1Thread1of1ForFork2_~#t3~0#1.base=|v_thread1Thread1of1ForFork2_~#t3~0#1.base_44|} OutVars{thread1Thread1of1ForFork2_~#t3~0#1.offset=|v_thread1Thread1of1ForFork2_~#t3~0#1.offset_31|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_25|, #valid=|v_#valid_194|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_35|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t3~0#1.offset, thread1Thread1of1ForFork2_~#t2~0#1.offset, #valid, thread1Thread1of1ForFork2_~#t2~0#1.base, thread1Thread1of1ForFork2_~#t3~0#1.base] and [972] $Ultimate##0-->L78: Formula: (and (= |v_#length_1| (store |v_#length_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 4)) (not (= |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 0)) (< |v_#StackHeapBarrier_1| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 1)) (= (select |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) 0) (= |v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t2~0#1.offset, #valid, #length, thread1Thread1of1ForFork2_~#t2~0#1.base] [2022-12-06 05:20:15,745 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1237] L124-4-->thread4EXIT: Formula: (= (store |v_#valid_181| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_38| 0) |v_#valid_180|) InVars {#valid=|v_#valid_181|, thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_38|} OutVars{#valid=|v_#valid_180|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_27|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, thread4Thread1of1ForFork5_~#t6~0#1.offset] and [972] $Ultimate##0-->L78: Formula: (and (= |v_#length_1| (store |v_#length_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 4)) (not (= |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 0)) (< |v_#StackHeapBarrier_1| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 1)) (= (select |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) 0) (= |v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t2~0#1.offset, #valid, #length, thread1Thread1of1ForFork2_~#t2~0#1.base] [2022-12-06 05:20:15,785 WARN L322 ript$VariableManager]: TermVariable LBE665 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:15,786 WARN L322 ript$VariableManager]: TermVariable LBE577 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:15,786 WARN L322 ript$VariableManager]: TermVariable LBE278 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:15,786 WARN L322 ript$VariableManager]: TermVariable LBE575 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:15,786 WARN L322 ript$VariableManager]: TermVariable LBE299 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:15,786 WARN L322 ript$VariableManager]: TermVariable LBE309 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:16,127 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1237] L124-4-->thread4EXIT: Formula: (= (store |v_#valid_181| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_38| 0) |v_#valid_180|) InVars {#valid=|v_#valid_181|, thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_38|} OutVars{#valid=|v_#valid_180|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_27|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, thread4Thread1of1ForFork5_~#t6~0#1.offset] and [1324] L83-2-->L78-3: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork2_plus_~a#1_Out_10|))) (and (<= v_~x1~0_Out_34 2147483647) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_Out_10|) (= v_~x1~0_Out_34 |v_thread1Thread1of1ForFork2_plus_#res#1_Out_10|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_Out_10| |v_thread1Thread1of1ForFork2_plus_~a#1_Out_10|) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_Out_10| |v_thread1Thread1of1ForFork2_plus_~b#1_Out_10|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_16| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_12|) (= v_~s21~0_In_6 |v_thread1Thread1of1ForFork2_plus_#in~b#1_Out_10|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_Out_10| v_~s11~0_In_7) (<= 0 (+ v_~x1~0_Out_34 2147483648)) (not (= (ite (= v_~i1~0_In_5 v_~n~0_In_13) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_Out_10| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_12|) (= |v_#valid_Out_44| (store |v_#valid_In_28| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_In_5| 0)))) InVars {~s11~0=v_~s11~0_In_7, #valid=|v_#valid_In_28|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_In_5|, ~i1~0=v_~i1~0_In_5, ~s21~0=v_~s21~0_In_6, ~n~0=v_~n~0_In_13} OutVars{thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_Out_10|, thread1Thread1of1ForFork2_#t~mem14#1=|v_thread1Thread1of1ForFork2_#t~mem14#1_Out_4|, ~s11~0=v_~s11~0_In_7, thread1Thread1of1ForFork2_#t~ret15#1=|v_thread1Thread1of1ForFork2_#t~ret15#1_Out_10|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_Out_10|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_Out_10|, ~i1~0=v_~i1~0_In_5, ~x1~0=v_~x1~0_Out_34, #valid=|v_#valid_Out_44|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_12|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_Out_10|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_In_5|, ~s21~0=v_~s21~0_In_6, ~n~0=v_~n~0_In_13, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_16|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_Out_10|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem14#1, thread1Thread1of1ForFork2_#t~ret15#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, ~x1~0, #valid, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 05:20:16,390 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1324] L83-2-->L78-3: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork2_plus_~a#1_Out_10|))) (and (<= v_~x1~0_Out_34 2147483647) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_Out_10|) (= v_~x1~0_Out_34 |v_thread1Thread1of1ForFork2_plus_#res#1_Out_10|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_Out_10| |v_thread1Thread1of1ForFork2_plus_~a#1_Out_10|) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_Out_10| |v_thread1Thread1of1ForFork2_plus_~b#1_Out_10|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_16| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_12|) (= v_~s21~0_In_6 |v_thread1Thread1of1ForFork2_plus_#in~b#1_Out_10|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_Out_10| v_~s11~0_In_7) (<= 0 (+ v_~x1~0_Out_34 2147483648)) (not (= (ite (= v_~i1~0_In_5 v_~n~0_In_13) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_Out_10| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_12|) (= |v_#valid_Out_44| (store |v_#valid_In_28| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_In_5| 0)))) InVars {~s11~0=v_~s11~0_In_7, #valid=|v_#valid_In_28|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_In_5|, ~i1~0=v_~i1~0_In_5, ~s21~0=v_~s21~0_In_6, ~n~0=v_~n~0_In_13} OutVars{thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_Out_10|, thread1Thread1of1ForFork2_#t~mem14#1=|v_thread1Thread1of1ForFork2_#t~mem14#1_Out_4|, ~s11~0=v_~s11~0_In_7, thread1Thread1of1ForFork2_#t~ret15#1=|v_thread1Thread1of1ForFork2_#t~ret15#1_Out_10|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_Out_10|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_Out_10|, ~i1~0=v_~i1~0_In_5, ~x1~0=v_~x1~0_Out_34, #valid=|v_#valid_Out_44|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_12|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_Out_10|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_In_5|, ~s21~0=v_~s21~0_In_6, ~n~0=v_~n~0_In_13, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_16|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_Out_10|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem14#1, thread1Thread1of1ForFork2_#t~ret15#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, ~x1~0, #valid, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] and [1342] L124-4-->thread1EXIT: Formula: (= (store (store |v_#valid_654| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_136| 0) |v_thread1Thread1of1ForFork2_~#t3~0#1.base_123| 0) |v_#valid_652|) InVars {#valid=|v_#valid_654|, thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_136|, thread1Thread1of1ForFork2_~#t3~0#1.base=|v_thread1Thread1of1ForFork2_~#t3~0#1.base_123|} OutVars{thread1Thread1of1ForFork2_~#t3~0#1.offset=|v_thread1Thread1of1ForFork2_~#t3~0#1.offset_99|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_79|, #valid=|v_#valid_652|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_149|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_103|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t3~0#1.offset, thread1Thread1of1ForFork2_~#t2~0#1.offset, #valid, thread4Thread1of1ForFork5_~#t6~0#1.base, thread1Thread1of1ForFork2_~#t2~0#1.base, thread1Thread1of1ForFork2_~#t3~0#1.base, thread4Thread1of1ForFork5_~#t6~0#1.offset] [2022-12-06 05:20:16,537 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1237] L124-4-->thread4EXIT: Formula: (= (store |v_#valid_181| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_38| 0) |v_#valid_180|) InVars {#valid=|v_#valid_181|, thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_38|} OutVars{#valid=|v_#valid_180|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_27|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, thread4Thread1of1ForFork5_~#t6~0#1.offset] and [973] L78-->L78-1: Formula: (and (not (= |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1| 0)) (< |v_#StackHeapBarrier_2| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1|) (= |v_#valid_3| (store |v_#valid_4| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1| 1)) (= (store |v_#length_4| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1| 4) |v_#length_3|) (= |v_thread1Thread1of1ForFork2_~#t3~0#1.offset_1| 0) (= (select |v_#valid_4| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, thread1Thread1of1ForFork2_~#t3~0#1.base=|v_thread1Thread1of1ForFork2_~#t3~0#1.base_1|, thread1Thread1of1ForFork2_~#t3~0#1.offset=|v_thread1Thread1of1ForFork2_~#t3~0#1.offset_1|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t3~0#1.offset, #valid, #length, thread1Thread1of1ForFork2_~#t3~0#1.base] [2022-12-06 05:20:16,640 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1248] L78-3-->thread1EXIT: Formula: (= |v_#valid_194| (store |v_#valid_195| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_44| 0)) InVars {#valid=|v_#valid_195|, thread1Thread1of1ForFork2_~#t3~0#1.base=|v_thread1Thread1of1ForFork2_~#t3~0#1.base_44|} OutVars{thread1Thread1of1ForFork2_~#t3~0#1.offset=|v_thread1Thread1of1ForFork2_~#t3~0#1.offset_31|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_25|, #valid=|v_#valid_194|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_35|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t3~0#1.offset, thread1Thread1of1ForFork2_~#t2~0#1.offset, #valid, thread1Thread1of1ForFork2_~#t2~0#1.base, thread1Thread1of1ForFork2_~#t3~0#1.base] and [1025] L124-->L124-1: Formula: (and (< |v_#StackHeapBarrier_4| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1|) (not (= |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1| 0)) (= (select |v_#valid_14| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1|) 0) (= (store |v_#valid_14| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1| 1) |v_#valid_13|) (= (store |v_#length_8| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1| 4) |v_#length_7|) (= |v_thread4Thread1of1ForFork5_~#t6~0#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, #valid=|v_#valid_14|} OutVars{thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_7|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_1|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, #length, thread4Thread1of1ForFork5_~#t6~0#1.offset] [2022-12-06 05:20:16,675 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1237] L124-4-->thread4EXIT: Formula: (= (store |v_#valid_181| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_38| 0) |v_#valid_180|) InVars {#valid=|v_#valid_181|, thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_38|} OutVars{#valid=|v_#valid_180|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_27|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, thread4Thread1of1ForFork5_~#t6~0#1.offset] and [973] L78-->L78-1: Formula: (and (not (= |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1| 0)) (< |v_#StackHeapBarrier_2| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1|) (= |v_#valid_3| (store |v_#valid_4| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1| 1)) (= (store |v_#length_4| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1| 4) |v_#length_3|) (= |v_thread1Thread1of1ForFork2_~#t3~0#1.offset_1| 0) (= (select |v_#valid_4| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, thread1Thread1of1ForFork2_~#t3~0#1.base=|v_thread1Thread1of1ForFork2_~#t3~0#1.base_1|, thread1Thread1of1ForFork2_~#t3~0#1.offset=|v_thread1Thread1of1ForFork2_~#t3~0#1.offset_1|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t3~0#1.offset, #valid, #length, thread1Thread1of1ForFork2_~#t3~0#1.base] [2022-12-06 05:20:16,829 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1237] L124-4-->thread4EXIT: Formula: (= (store |v_#valid_181| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_38| 0) |v_#valid_180|) InVars {#valid=|v_#valid_181|, thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_38|} OutVars{#valid=|v_#valid_180|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_27|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, thread4Thread1of1ForFork5_~#t6~0#1.offset] and [972] $Ultimate##0-->L78: Formula: (and (= |v_#length_1| (store |v_#length_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 4)) (not (= |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 0)) (< |v_#StackHeapBarrier_1| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 1)) (= (select |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) 0) (= |v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t2~0#1.offset, #valid, #length, thread1Thread1of1ForFork2_~#t2~0#1.base] [2022-12-06 05:20:16,860 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1248] L78-3-->thread1EXIT: Formula: (= |v_#valid_194| (store |v_#valid_195| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_44| 0)) InVars {#valid=|v_#valid_195|, thread1Thread1of1ForFork2_~#t3~0#1.base=|v_thread1Thread1of1ForFork2_~#t3~0#1.base_44|} OutVars{thread1Thread1of1ForFork2_~#t3~0#1.offset=|v_thread1Thread1of1ForFork2_~#t3~0#1.offset_31|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_25|, #valid=|v_#valid_194|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_35|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t3~0#1.offset, thread1Thread1of1ForFork2_~#t2~0#1.offset, #valid, thread1Thread1of1ForFork2_~#t2~0#1.base, thread1Thread1of1ForFork2_~#t3~0#1.base] and [972] $Ultimate##0-->L78: Formula: (and (= |v_#length_1| (store |v_#length_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 4)) (not (= |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 0)) (< |v_#StackHeapBarrier_1| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 1)) (= (select |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) 0) (= |v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t2~0#1.offset, #valid, #length, thread1Thread1of1ForFork2_~#t2~0#1.base] [2022-12-06 05:20:16,891 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1025] L124-->L124-1: Formula: (and (< |v_#StackHeapBarrier_4| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1|) (not (= |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1| 0)) (= (select |v_#valid_14| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1|) 0) (= (store |v_#valid_14| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1| 1) |v_#valid_13|) (= (store |v_#length_8| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1| 4) |v_#length_7|) (= |v_thread4Thread1of1ForFork5_~#t6~0#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, #valid=|v_#valid_14|} OutVars{thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_7|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_1|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, #length, thread4Thread1of1ForFork5_~#t6~0#1.offset] and [972] $Ultimate##0-->L78: Formula: (and (= |v_#length_1| (store |v_#length_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 4)) (not (= |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 0)) (< |v_#StackHeapBarrier_1| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 1)) (= (select |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) 0) (= |v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t2~0#1.offset, #valid, #length, thread1Thread1of1ForFork2_~#t2~0#1.base] [2022-12-06 05:20:16,952 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1237] L124-4-->thread4EXIT: Formula: (= (store |v_#valid_181| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_38| 0) |v_#valid_180|) InVars {#valid=|v_#valid_181|, thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_38|} OutVars{#valid=|v_#valid_180|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_27|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, thread4Thread1of1ForFork5_~#t6~0#1.offset] and [973] L78-->L78-1: Formula: (and (not (= |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1| 0)) (< |v_#StackHeapBarrier_2| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1|) (= |v_#valid_3| (store |v_#valid_4| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1| 1)) (= (store |v_#length_4| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1| 4) |v_#length_3|) (= |v_thread1Thread1of1ForFork2_~#t3~0#1.offset_1| 0) (= (select |v_#valid_4| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, thread1Thread1of1ForFork2_~#t3~0#1.base=|v_thread1Thread1of1ForFork2_~#t3~0#1.base_1|, thread1Thread1of1ForFork2_~#t3~0#1.offset=|v_thread1Thread1of1ForFork2_~#t3~0#1.offset_1|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t3~0#1.offset, #valid, #length, thread1Thread1of1ForFork2_~#t3~0#1.base] [2022-12-06 05:20:17,129 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1324] L83-2-->L78-3: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork2_plus_~a#1_Out_10|))) (and (<= v_~x1~0_Out_34 2147483647) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_Out_10|) (= v_~x1~0_Out_34 |v_thread1Thread1of1ForFork2_plus_#res#1_Out_10|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_Out_10| |v_thread1Thread1of1ForFork2_plus_~a#1_Out_10|) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_Out_10| |v_thread1Thread1of1ForFork2_plus_~b#1_Out_10|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_16| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_12|) (= v_~s21~0_In_6 |v_thread1Thread1of1ForFork2_plus_#in~b#1_Out_10|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_Out_10| v_~s11~0_In_7) (<= 0 (+ v_~x1~0_Out_34 2147483648)) (not (= (ite (= v_~i1~0_In_5 v_~n~0_In_13) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_Out_10| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_12|) (= |v_#valid_Out_44| (store |v_#valid_In_28| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_In_5| 0)))) InVars {~s11~0=v_~s11~0_In_7, #valid=|v_#valid_In_28|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_In_5|, ~i1~0=v_~i1~0_In_5, ~s21~0=v_~s21~0_In_6, ~n~0=v_~n~0_In_13} OutVars{thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_Out_10|, thread1Thread1of1ForFork2_#t~mem14#1=|v_thread1Thread1of1ForFork2_#t~mem14#1_Out_4|, ~s11~0=v_~s11~0_In_7, thread1Thread1of1ForFork2_#t~ret15#1=|v_thread1Thread1of1ForFork2_#t~ret15#1_Out_10|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_Out_10|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_Out_10|, ~i1~0=v_~i1~0_In_5, ~x1~0=v_~x1~0_Out_34, #valid=|v_#valid_Out_44|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_12|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_Out_10|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_In_5|, ~s21~0=v_~s21~0_In_6, ~n~0=v_~n~0_In_13, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_16|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_Out_10|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem14#1, thread1Thread1of1ForFork2_#t~ret15#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, ~x1~0, #valid, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] and [1024] $Ultimate##0-->L124: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_thread4Thread1of1ForFork5_~#t5~0#1.base_1| 4)) (= (select |v_#valid_12| |v_thread4Thread1of1ForFork5_~#t5~0#1.base_1|) 0) (= (store |v_#valid_12| |v_thread4Thread1of1ForFork5_~#t5~0#1.base_1| 1) |v_#valid_11|) (not (= |v_thread4Thread1of1ForFork5_~#t5~0#1.base_1| 0)) (= |v_thread4Thread1of1ForFork5_~#t5~0#1.offset_1| 0) (< |v_#StackHeapBarrier_3| |v_thread4Thread1of1ForFork5_~#t5~0#1.base_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, thread4Thread1of1ForFork5_~#t5~0#1.base=|v_thread4Thread1of1ForFork5_~#t5~0#1.base_1|, thread4Thread1of1ForFork5_~#t5~0#1.offset=|v_thread4Thread1of1ForFork5_~#t5~0#1.offset_1|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[thread4Thread1of1ForFork5_~#t5~0#1.offset, #valid, #length, thread4Thread1of1ForFork5_~#t5~0#1.base] [2022-12-06 05:20:17,243 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1324] L83-2-->L78-3: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork2_plus_~a#1_Out_10|))) (and (<= v_~x1~0_Out_34 2147483647) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_Out_10|) (= v_~x1~0_Out_34 |v_thread1Thread1of1ForFork2_plus_#res#1_Out_10|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_Out_10| |v_thread1Thread1of1ForFork2_plus_~a#1_Out_10|) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_Out_10| |v_thread1Thread1of1ForFork2_plus_~b#1_Out_10|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_16| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_12|) (= v_~s21~0_In_6 |v_thread1Thread1of1ForFork2_plus_#in~b#1_Out_10|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_Out_10| v_~s11~0_In_7) (<= 0 (+ v_~x1~0_Out_34 2147483648)) (not (= (ite (= v_~i1~0_In_5 v_~n~0_In_13) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_Out_10| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_12|) (= |v_#valid_Out_44| (store |v_#valid_In_28| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_In_5| 0)))) InVars {~s11~0=v_~s11~0_In_7, #valid=|v_#valid_In_28|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_In_5|, ~i1~0=v_~i1~0_In_5, ~s21~0=v_~s21~0_In_6, ~n~0=v_~n~0_In_13} OutVars{thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_Out_10|, thread1Thread1of1ForFork2_#t~mem14#1=|v_thread1Thread1of1ForFork2_#t~mem14#1_Out_4|, ~s11~0=v_~s11~0_In_7, thread1Thread1of1ForFork2_#t~ret15#1=|v_thread1Thread1of1ForFork2_#t~ret15#1_Out_10|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_Out_10|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_Out_10|, ~i1~0=v_~i1~0_In_5, ~x1~0=v_~x1~0_Out_34, #valid=|v_#valid_Out_44|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_12|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_Out_10|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_In_5|, ~s21~0=v_~s21~0_In_6, ~n~0=v_~n~0_In_13, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_16|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_Out_10|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem14#1, thread1Thread1of1ForFork2_#t~ret15#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, ~x1~0, #valid, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] and [1025] L124-->L124-1: Formula: (and (< |v_#StackHeapBarrier_4| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1|) (not (= |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1| 0)) (= (select |v_#valid_14| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1|) 0) (= (store |v_#valid_14| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1| 1) |v_#valid_13|) (= (store |v_#length_8| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1| 4) |v_#length_7|) (= |v_thread4Thread1of1ForFork5_~#t6~0#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, #valid=|v_#valid_14|} OutVars{thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_7|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_1|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, #length, thread4Thread1of1ForFork5_~#t6~0#1.offset] [2022-12-06 05:20:17,361 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1237] L124-4-->thread4EXIT: Formula: (= (store |v_#valid_181| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_38| 0) |v_#valid_180|) InVars {#valid=|v_#valid_181|, thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_38|} OutVars{#valid=|v_#valid_180|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_27|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, thread4Thread1of1ForFork5_~#t6~0#1.offset] and [1324] L83-2-->L78-3: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork2_plus_~a#1_Out_10|))) (and (<= v_~x1~0_Out_34 2147483647) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_Out_10|) (= v_~x1~0_Out_34 |v_thread1Thread1of1ForFork2_plus_#res#1_Out_10|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_Out_10| |v_thread1Thread1of1ForFork2_plus_~a#1_Out_10|) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_Out_10| |v_thread1Thread1of1ForFork2_plus_~b#1_Out_10|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_16| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_12|) (= v_~s21~0_In_6 |v_thread1Thread1of1ForFork2_plus_#in~b#1_Out_10|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_Out_10| v_~s11~0_In_7) (<= 0 (+ v_~x1~0_Out_34 2147483648)) (not (= (ite (= v_~i1~0_In_5 v_~n~0_In_13) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_Out_10| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_12|) (= |v_#valid_Out_44| (store |v_#valid_In_28| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_In_5| 0)))) InVars {~s11~0=v_~s11~0_In_7, #valid=|v_#valid_In_28|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_In_5|, ~i1~0=v_~i1~0_In_5, ~s21~0=v_~s21~0_In_6, ~n~0=v_~n~0_In_13} OutVars{thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_Out_10|, thread1Thread1of1ForFork2_#t~mem14#1=|v_thread1Thread1of1ForFork2_#t~mem14#1_Out_4|, ~s11~0=v_~s11~0_In_7, thread1Thread1of1ForFork2_#t~ret15#1=|v_thread1Thread1of1ForFork2_#t~ret15#1_Out_10|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_Out_10|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_Out_10|, ~i1~0=v_~i1~0_In_5, ~x1~0=v_~x1~0_Out_34, #valid=|v_#valid_Out_44|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_12|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_Out_10|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_In_5|, ~s21~0=v_~s21~0_In_6, ~n~0=v_~n~0_In_13, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_16|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_Out_10|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem14#1, thread1Thread1of1ForFork2_#t~ret15#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, ~x1~0, #valid, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 05:20:17,447 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1025] L124-->L124-1: Formula: (and (< |v_#StackHeapBarrier_4| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1|) (not (= |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1| 0)) (= (select |v_#valid_14| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1|) 0) (= (store |v_#valid_14| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1| 1) |v_#valid_13|) (= (store |v_#length_8| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1| 4) |v_#length_7|) (= |v_thread4Thread1of1ForFork5_~#t6~0#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, #valid=|v_#valid_14|} OutVars{thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_7|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_1|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, #length, thread4Thread1of1ForFork5_~#t6~0#1.offset] and [1028] L126-1-->L126-2: Formula: (= |v_#memory_int_9| (store |v_#memory_int_10| |v_thread4Thread1of1ForFork5_~#t5~0#1.base_3| (store (select |v_#memory_int_10| |v_thread4Thread1of1ForFork5_~#t5~0#1.base_3|) |v_thread4Thread1of1ForFork5_~#t5~0#1.offset_3| |v_thread4Thread1of1ForFork5_#t~pre24#1_3|))) InVars {#memory_int=|v_#memory_int_10|, thread4Thread1of1ForFork5_~#t5~0#1.base=|v_thread4Thread1of1ForFork5_~#t5~0#1.base_3|, thread4Thread1of1ForFork5_#t~pre24#1=|v_thread4Thread1of1ForFork5_#t~pre24#1_3|, thread4Thread1of1ForFork5_~#t5~0#1.offset=|v_thread4Thread1of1ForFork5_~#t5~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, thread4Thread1of1ForFork5_~#t5~0#1.base=|v_thread4Thread1of1ForFork5_~#t5~0#1.base_3|, thread4Thread1of1ForFork5_#t~pre24#1=|v_thread4Thread1of1ForFork5_#t~pre24#1_3|, thread4Thread1of1ForFork5_~#t5~0#1.offset=|v_thread4Thread1of1ForFork5_~#t5~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] [2022-12-06 05:20:17,588 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1237] L124-4-->thread4EXIT: Formula: (= (store |v_#valid_181| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_38| 0) |v_#valid_180|) InVars {#valid=|v_#valid_181|, thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_38|} OutVars{#valid=|v_#valid_180|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_27|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, thread4Thread1of1ForFork5_~#t6~0#1.offset] and [973] L78-->L78-1: Formula: (and (not (= |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1| 0)) (< |v_#StackHeapBarrier_2| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1|) (= |v_#valid_3| (store |v_#valid_4| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1| 1)) (= (store |v_#length_4| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1| 4) |v_#length_3|) (= |v_thread1Thread1of1ForFork2_~#t3~0#1.offset_1| 0) (= (select |v_#valid_4| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, thread1Thread1of1ForFork2_~#t3~0#1.base=|v_thread1Thread1of1ForFork2_~#t3~0#1.base_1|, thread1Thread1of1ForFork2_~#t3~0#1.offset=|v_thread1Thread1of1ForFork2_~#t3~0#1.offset_1|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t3~0#1.offset, #valid, #length, thread1Thread1of1ForFork2_~#t3~0#1.base] [2022-12-06 05:20:17,715 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1024] $Ultimate##0-->L124: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_thread4Thread1of1ForFork5_~#t5~0#1.base_1| 4)) (= (select |v_#valid_12| |v_thread4Thread1of1ForFork5_~#t5~0#1.base_1|) 0) (= (store |v_#valid_12| |v_thread4Thread1of1ForFork5_~#t5~0#1.base_1| 1) |v_#valid_11|) (not (= |v_thread4Thread1of1ForFork5_~#t5~0#1.base_1| 0)) (= |v_thread4Thread1of1ForFork5_~#t5~0#1.offset_1| 0) (< |v_#StackHeapBarrier_3| |v_thread4Thread1of1ForFork5_~#t5~0#1.base_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, thread4Thread1of1ForFork5_~#t5~0#1.base=|v_thread4Thread1of1ForFork5_~#t5~0#1.base_1|, thread4Thread1of1ForFork5_~#t5~0#1.offset=|v_thread4Thread1of1ForFork5_~#t5~0#1.offset_1|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[thread4Thread1of1ForFork5_~#t5~0#1.offset, #valid, #length, thread4Thread1of1ForFork5_~#t5~0#1.base] and [1258] L56-->L56: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork0_plus_~a#1_11| |v_thread2Thread1of1ForFork0_plus_~b#1_11|))) (and (<= 0 (+ |v_thread2Thread1of1ForFork0_plus_#res#1_11| 2147483648)) (<= |v_thread2Thread1of1ForFork0_plus_#res#1_11| 2147483647) (= |v_thread2Thread1of1ForFork0_plus_#res#1_11| v_~s11~0_67) (= |v_thread2Thread1of1ForFork0_plus_#in~a#1_11| v_~s11~0_68) (= v_~t11~0_41 (select (select |v_#memory_int_133| v_~x~0.base_81) (+ (* v_~i1~0_99 4) v_~x~0.offset_81))) (not (= (ite (< v_~i1~0_100 v_~n~0_89) 1 0) 0)) (= |v_thread2Thread1of1ForFork0_plus_#res#1_11| .cse0) (= v_~t11~0_41 |v_thread2Thread1of1ForFork0_plus_#in~b#1_11|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|) (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet1#1_28| 256) 0)) (= |v_thread2Thread1of1ForFork0_plus_~a#1_11| |v_thread2Thread1of1ForFork0_plus_#in~a#1_11|) (= (+ v_~i1~0_100 1) v_~i1~0_99) (= |v_thread2Thread1of1ForFork0_plus_~b#1_11| |v_thread2Thread1of1ForFork0_plus_#in~b#1_11|) (= (ite (or (<= |v_thread2Thread1of1ForFork0_plus_~b#1_11| 0) (<= .cse0 2147483647)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|))) InVars {~s11~0=v_~s11~0_68, ~x~0.base=v_~x~0.base_81, ~x~0.offset=v_~x~0.offset_81, #memory_int=|v_#memory_int_133|, ~i1~0=v_~i1~0_100, ~n~0=v_~n~0_89, thread2Thread1of1ForFork0_#t~nondet1#1=|v_thread2Thread1of1ForFork0_#t~nondet1#1_28|} OutVars{thread2Thread1of1ForFork0_#t~mem3#1=|v_thread2Thread1of1ForFork0_#t~mem3#1_13|, thread2Thread1of1ForFork0_plus_#in~a#1=|v_thread2Thread1of1ForFork0_plus_#in~a#1_11|, ~s11~0=v_~s11~0_67, ~x~0.base=v_~x~0.base_81, ~x~0.offset=v_~x~0.offset_81, thread2Thread1of1ForFork0_plus_~a#1=|v_thread2Thread1of1ForFork0_plus_~a#1_11|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|, ~i1~0=v_~i1~0_99, thread2Thread1of1ForFork0_#t~ret4#1=|v_thread2Thread1of1ForFork0_#t~ret4#1_11|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|, thread2Thread1of1ForFork0_plus_#in~b#1=|v_thread2Thread1of1ForFork0_plus_#in~b#1_11|, ~t11~0=v_~t11~0_41, thread2Thread1of1ForFork0_plus_~b#1=|v_thread2Thread1of1ForFork0_plus_~b#1_11|, thread2Thread1of1ForFork0_plus_#res#1=|v_thread2Thread1of1ForFork0_plus_#res#1_11|, #memory_int=|v_#memory_int_133|, thread2Thread1of1ForFork0_#t~post2#1=|v_thread2Thread1of1ForFork0_#t~post2#1_13|, ~n~0=v_~n~0_89} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~mem3#1, thread2Thread1of1ForFork0_plus_#in~a#1, ~s11~0, thread2Thread1of1ForFork0_plus_~a#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~i1~0, thread2Thread1of1ForFork0_#t~nondet1#1, thread2Thread1of1ForFork0_#t~ret4#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_plus_#in~b#1, ~t11~0, thread2Thread1of1ForFork0_plus_~b#1, thread2Thread1of1ForFork0_plus_#res#1, thread2Thread1of1ForFork0_#t~post2#1] [2022-12-06 05:20:17,845 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1024] $Ultimate##0-->L124: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_thread4Thread1of1ForFork5_~#t5~0#1.base_1| 4)) (= (select |v_#valid_12| |v_thread4Thread1of1ForFork5_~#t5~0#1.base_1|) 0) (= (store |v_#valid_12| |v_thread4Thread1of1ForFork5_~#t5~0#1.base_1| 1) |v_#valid_11|) (not (= |v_thread4Thread1of1ForFork5_~#t5~0#1.base_1| 0)) (= |v_thread4Thread1of1ForFork5_~#t5~0#1.offset_1| 0) (< |v_#StackHeapBarrier_3| |v_thread4Thread1of1ForFork5_~#t5~0#1.base_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, thread4Thread1of1ForFork5_~#t5~0#1.base=|v_thread4Thread1of1ForFork5_~#t5~0#1.base_1|, thread4Thread1of1ForFork5_~#t5~0#1.offset=|v_thread4Thread1of1ForFork5_~#t5~0#1.offset_1|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[thread4Thread1of1ForFork5_~#t5~0#1.offset, #valid, #length, thread4Thread1of1ForFork5_~#t5~0#1.base] and [1249] L71-->L71: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork3_plus_~a#1_7| |v_thread3Thread1of1ForFork3_plus_~b#1_7|))) (and (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_15| |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_15|) (= (+ v_~i1~0_94 1) v_~i1~0_93) (= |v_thread3Thread1of1ForFork3_plus_#in~a#1_7| |v_thread3Thread1of1ForFork3_plus_~a#1_7|) (= v_~s21~0_48 |v_thread3Thread1of1ForFork3_plus_#in~a#1_7|) (not (= (ite (< v_~i1~0_94 v_~n~0_83) 1 0) 0)) (= (select (select |v_#memory_int_131| v_~x~0.base_79) (+ (* v_~i1~0_93 4) v_~x~0.offset_79)) v_~t21~0_35) (= v_~s21~0_47 |v_thread3Thread1of1ForFork3_plus_#res#1_7|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork3_plus_~b#1_7| 0)) 1 0) |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_15|) (= v_~t21~0_35 |v_thread3Thread1of1ForFork3_plus_#in~b#1_7|) (not (= (mod |v_thread3Thread1of1ForFork3_#t~nondet5#1_30| 256) 0)) (<= 0 (+ v_~s21~0_47 2147483648)) (<= v_~s21~0_47 2147483647) (= |v_thread3Thread1of1ForFork3_plus_#in~b#1_7| |v_thread3Thread1of1ForFork3_plus_~b#1_7|) (= |v_thread3Thread1of1ForFork3_plus_#res#1_7| .cse0))) InVars {thread3Thread1of1ForFork3_#t~nondet5#1=|v_thread3Thread1of1ForFork3_#t~nondet5#1_30|, ~x~0.base=v_~x~0.base_79, ~x~0.offset=v_~x~0.offset_79, #memory_int=|v_#memory_int_131|, ~i1~0=v_~i1~0_94, ~s21~0=v_~s21~0_48, ~n~0=v_~n~0_83} OutVars{thread3Thread1of1ForFork3_plus_#res#1=|v_thread3Thread1of1ForFork3_plus_#res#1_7|, ~x~0.base=v_~x~0.base_79, ~x~0.offset=v_~x~0.offset_79, ~t21~0=v_~t21~0_35, thread3Thread1of1ForFork3_plus_#in~a#1=|v_thread3Thread1of1ForFork3_plus_#in~a#1_7|, ~i1~0=v_~i1~0_93, thread3Thread1of1ForFork3_#t~ret8#1=|v_thread3Thread1of1ForFork3_#t~ret8#1_7|, thread3Thread1of1ForFork3_#t~mem7#1=|v_thread3Thread1of1ForFork3_#t~mem7#1_13|, thread3Thread1of1ForFork3_#t~post6#1=|v_thread3Thread1of1ForFork3_#t~post6#1_13|, thread3Thread1of1ForFork3_plus_#in~b#1=|v_thread3Thread1of1ForFork3_plus_#in~b#1_7|, thread3Thread1of1ForFork3_plus_~a#1=|v_thread3Thread1of1ForFork3_plus_~a#1_7|, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_15|, #memory_int=|v_#memory_int_131|, thread3Thread1of1ForFork3_plus_~b#1=|v_thread3Thread1of1ForFork3_plus_~b#1_7|, ~s21~0=v_~s21~0_47, ~n~0=v_~n~0_83, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~nondet5#1, thread3Thread1of1ForFork3_plus_#res#1, ~t21~0, thread3Thread1of1ForFork3_plus_#in~a#1, ~i1~0, thread3Thread1of1ForFork3_#t~ret8#1, thread3Thread1of1ForFork3_#t~mem7#1, thread3Thread1of1ForFork3_#t~post6#1, thread3Thread1of1ForFork3_plus_#in~b#1, thread3Thread1of1ForFork3_plus_~a#1, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_plus_~b#1, ~s21~0, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1] [2022-12-06 05:20:18,022 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1237] L124-4-->thread4EXIT: Formula: (= (store |v_#valid_181| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_38| 0) |v_#valid_180|) InVars {#valid=|v_#valid_181|, thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_38|} OutVars{#valid=|v_#valid_180|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_27|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, thread4Thread1of1ForFork5_~#t6~0#1.offset] and [973] L78-->L78-1: Formula: (and (not (= |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1| 0)) (< |v_#StackHeapBarrier_2| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1|) (= |v_#valid_3| (store |v_#valid_4| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1| 1)) (= (store |v_#length_4| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1| 4) |v_#length_3|) (= |v_thread1Thread1of1ForFork2_~#t3~0#1.offset_1| 0) (= (select |v_#valid_4| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_1|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, thread1Thread1of1ForFork2_~#t3~0#1.base=|v_thread1Thread1of1ForFork2_~#t3~0#1.base_1|, thread1Thread1of1ForFork2_~#t3~0#1.offset=|v_thread1Thread1of1ForFork2_~#t3~0#1.offset_1|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t3~0#1.offset, #valid, #length, thread1Thread1of1ForFork2_~#t3~0#1.base] [2022-12-06 05:20:18,046 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1237] L124-4-->thread4EXIT: Formula: (= (store |v_#valid_181| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_38| 0) |v_#valid_180|) InVars {#valid=|v_#valid_181|, thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_38|} OutVars{#valid=|v_#valid_180|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_27|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, thread4Thread1of1ForFork5_~#t6~0#1.offset] and [1343] L83-2-->thread1EXIT: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~a#1_74| |v_thread1Thread1of1ForFork2_plus_~b#1_74|))) (and (= |v_thread1Thread1of1ForFork2_#res#1.offset_74| 0) (= |v_thread1Thread1of1ForFork2_plus_~a#1_74| |v_thread1Thread1of1ForFork2_plus_#in~a#1_74|) (= v_~s21~0_169 |v_thread1Thread1of1ForFork2_plus_#in~b#1_74|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_98| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_90|) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_74|) (not (= (ite (= v_~i1~0_253 v_~n~0_265) 1 0) 0)) (<= v_~x1~0_138 2147483647) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_74| v_~s11~0_225) (= |v_thread1Thread1of1ForFork2_plus_~b#1_74| |v_thread1Thread1of1ForFork2_plus_#in~b#1_74|) (= |v_thread1Thread1of1ForFork2_#res#1.base_74| 0) (= (ite (or (<= |v_thread1Thread1of1ForFork2_plus_~b#1_74| 0) (<= .cse0 2147483647)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_90|) (<= 0 (+ v_~x1~0_138 2147483648)) (= v_~x1~0_138 |v_thread1Thread1of1ForFork2_plus_#res#1_74|) (= |v_#valid_658| (store (store |v_#valid_660| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_152| 0) |v_thread1Thread1of1ForFork2_~#t3~0#1.base_127| 0)))) InVars {~s11~0=v_~s11~0_225, #valid=|v_#valid_660|, thread1Thread1of1ForFork2_~#t3~0#1.base=|v_thread1Thread1of1ForFork2_~#t3~0#1.base_127|, ~i1~0=v_~i1~0_253, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_152|, ~s21~0=v_~s21~0_169, ~n~0=v_~n~0_265} OutVars{thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_74|, thread1Thread1of1ForFork2_#t~mem14#1=|v_thread1Thread1of1ForFork2_#t~mem14#1_84|, ~s11~0=v_~s11~0_225, thread1Thread1of1ForFork2_~#t3~0#1.offset=|v_thread1Thread1of1ForFork2_~#t3~0#1.offset_101|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_81|, thread1Thread1of1ForFork2_#t~ret15#1=|v_thread1Thread1of1ForFork2_#t~ret15#1_74|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_74|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_74|, ~i1~0=v_~i1~0_253, ~x1~0=v_~x1~0_138, #valid=|v_#valid_658|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_90|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_74|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_74|, ~s21~0=v_~s21~0_169, ~n~0=v_~n~0_265, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_74|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_98|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_74|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem14#1, thread1Thread1of1ForFork2_~#t3~0#1.offset, thread1Thread1of1ForFork2_~#t2~0#1.offset, thread1Thread1of1ForFork2_#t~ret15#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, thread1Thread1of1ForFork2_~#t3~0#1.base, ~x1~0, #valid, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_~#t2~0#1.base, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 05:20:18,127 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1025] L124-->L124-1: Formula: (and (< |v_#StackHeapBarrier_4| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1|) (not (= |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1| 0)) (= (select |v_#valid_14| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1|) 0) (= (store |v_#valid_14| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1| 1) |v_#valid_13|) (= (store |v_#length_8| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1| 4) |v_#length_7|) (= |v_thread4Thread1of1ForFork5_~#t6~0#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, #valid=|v_#valid_14|} OutVars{thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_7|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_1|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, #length, thread4Thread1of1ForFork5_~#t6~0#1.offset] and [1248] L78-3-->thread1EXIT: Formula: (= |v_#valid_194| (store |v_#valid_195| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_44| 0)) InVars {#valid=|v_#valid_195|, thread1Thread1of1ForFork2_~#t3~0#1.base=|v_thread1Thread1of1ForFork2_~#t3~0#1.base_44|} OutVars{thread1Thread1of1ForFork2_~#t3~0#1.offset=|v_thread1Thread1of1ForFork2_~#t3~0#1.offset_31|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_25|, #valid=|v_#valid_194|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_35|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t3~0#1.offset, thread1Thread1of1ForFork2_~#t2~0#1.offset, #valid, thread1Thread1of1ForFork2_~#t2~0#1.base, thread1Thread1of1ForFork2_~#t3~0#1.base] [2022-12-06 05:20:18,229 WARN L322 ript$VariableManager]: TermVariable LBE676 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:18,230 WARN L322 ript$VariableManager]: TermVariable LBE148 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:18,230 WARN L322 ript$VariableManager]: TermVariable LBE169 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:18,230 WARN L322 ript$VariableManager]: TermVariable LBE179 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:18,230 WARN L322 ript$VariableManager]: TermVariable LBE609 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:18,230 WARN L322 ript$VariableManager]: TermVariable LBE629 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:20:18,447 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1350] L129-2-->thread4EXIT: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork5_plus_~a#1_68| |v_thread4Thread1of1ForFork5_plus_~b#1_68|))) (and (<= 0 (+ v_~x2~0_132 2147483648)) (= |v_thread4Thread1of1ForFork5_plus_#in~a#1_68| |v_thread4Thread1of1ForFork5_plus_~a#1_68|) (= |v_thread4Thread1of1ForFork5_plus_#in~b#1_68| |v_thread4Thread1of1ForFork5_plus_~b#1_68|) (= 0 |v_thread4Thread1of1ForFork5_#res#1.base_68|) (= (store (store |v_#valid_702| |v_thread4Thread1of1ForFork5_~#t5~0#1.base_179| 0) |v_thread4Thread1of1ForFork5_~#t6~0#1.base_152| 0) |v_#valid_700|) (= |v_thread4Thread1of1ForFork5_plus_#res#1_68| v_~x2~0_132) (= |v_thread4Thread1of1ForFork5_plus_#in~b#1_68| v_~s22~0_183) (<= v_~x2~0_132 2147483647) (= |v_thread4Thread1of1ForFork5_#res#1.offset_68| 0) (= (ite (or (<= |v_thread4Thread1of1ForFork5_plus_~b#1_68| 0) (<= .cse0 2147483647)) 1 0) |v_thread4Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_92|) (= |v_thread4Thread1of1ForFork5_plus_#res#1_68| .cse0) (= |v_thread4Thread1of1ForFork5_plus_#in~a#1_68| v_~s12~0_152) (not (= (ite (= v_~i2~0_224 v_~n~0_279) 1 0) 0)) (= |v_thread4Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_92| |v_thread4Thread1of1ForFork5_assume_abort_if_not_~cond#1_96|))) InVars {~s12~0=v_~s12~0_152, #valid=|v_#valid_702|, thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_152|, ~i2~0=v_~i2~0_224, thread4Thread1of1ForFork5_~#t5~0#1.base=|v_thread4Thread1of1ForFork5_~#t5~0#1.base_179|, ~n~0=v_~n~0_279, ~s22~0=v_~s22~0_183} OutVars{~s12~0=v_~s12~0_152, ~x2~0=v_~x2~0_132, thread4Thread1of1ForFork5_plus_~b#1=|v_thread4Thread1of1ForFork5_plus_~b#1_68|, thread4Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork5_assume_abort_if_not_~cond#1_96|, thread4Thread1of1ForFork5_~#t5~0#1.offset=|v_thread4Thread1of1ForFork5_~#t5~0#1.offset_125|, thread4Thread1of1ForFork5_#res#1.base=|v_thread4Thread1of1ForFork5_#res#1.base_68|, thread4Thread1of1ForFork5_plus_#in~b#1=|v_thread4Thread1of1ForFork5_plus_#in~b#1_68|, thread4Thread1of1ForFork5_plus_#res#1=|v_thread4Thread1of1ForFork5_plus_#res#1_68|, thread4Thread1of1ForFork5_#t~ret30#1=|v_thread4Thread1of1ForFork5_#t~ret30#1_68|, thread4Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_92|, ~i2~0=v_~i2~0_224, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_111|, thread4Thread1of1ForFork5_#t~mem29#1=|v_thread4Thread1of1ForFork5_#t~mem29#1_58|, thread4Thread1of1ForFork5_plus_#in~a#1=|v_thread4Thread1of1ForFork5_plus_#in~a#1_68|, #valid=|v_#valid_700|, ~n~0=v_~n~0_279, thread4Thread1of1ForFork5_#res#1.offset=|v_thread4Thread1of1ForFork5_#res#1.offset_68|, thread4Thread1of1ForFork5_plus_~a#1=|v_thread4Thread1of1ForFork5_plus_~a#1_68|, ~s22~0=v_~s22~0_183} AuxVars[] AssignedVars[~x2~0, thread4Thread1of1ForFork5_plus_~b#1, thread4Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork5_~#t5~0#1.offset, thread4Thread1of1ForFork5_#res#1.base, thread4Thread1of1ForFork5_plus_#in~b#1, thread4Thread1of1ForFork5_plus_#res#1, thread4Thread1of1ForFork5_#t~ret30#1, thread4Thread1of1ForFork5_~#t6~0#1.base, thread4Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork5_~#t6~0#1.offset, thread4Thread1of1ForFork5_#t~mem29#1, thread4Thread1of1ForFork5_plus_#in~a#1, #valid, thread4Thread1of1ForFork5_~#t5~0#1.base, thread4Thread1of1ForFork5_#res#1.offset, thread4Thread1of1ForFork5_plus_~a#1] and [1368] $Ultimate##0-->L78-1: Formula: (let ((.cse0 (store |v_#valid_798| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_213| 1))) (and (not (= |v_thread1Thread1of1ForFork2_~#t2~0#1.base_213| 0)) (< |v_#StackHeapBarrier_243| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_213|) (= |v_#valid_796| (store .cse0 |v_thread1Thread1of1ForFork2_~#t3~0#1.base_184| 1)) (= |v_thread1Thread1of1ForFork2_~#t2~0#1.offset_124| 0) (= (select .cse0 |v_thread1Thread1of1ForFork2_~#t3~0#1.base_184|) 0) (< |v_#StackHeapBarrier_243| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_184|) (not (= |v_thread1Thread1of1ForFork2_~#t3~0#1.base_184| 0)) (= |v_thread1Thread1of1ForFork2_~#t3~0#1.offset_136| 0) (= (store (store |v_#length_509| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_213| 4) |v_thread1Thread1of1ForFork2_~#t3~0#1.base_184| 4) |v_#length_507|) (= (select |v_#valid_798| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_213|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_243|, #valid=|v_#valid_798|, #length=|v_#length_509|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_243|, thread1Thread1of1ForFork2_~#t3~0#1.offset=|v_thread1Thread1of1ForFork2_~#t3~0#1.offset_136|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_124|, #valid=|v_#valid_796|, #length=|v_#length_507|, thread1Thread1of1ForFork2_~#t3~0#1.base=|v_thread1Thread1of1ForFork2_~#t3~0#1.base_184|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_213|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t3~0#1.offset, thread1Thread1of1ForFork2_~#t2~0#1.offset, #valid, #length, thread1Thread1of1ForFork2_~#t3~0#1.base, thread1Thread1of1ForFork2_~#t2~0#1.base] [2022-12-06 05:20:18,572 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1237] L124-4-->thread4EXIT: Formula: (= (store |v_#valid_181| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_38| 0) |v_#valid_180|) InVars {#valid=|v_#valid_181|, thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_38|} OutVars{#valid=|v_#valid_180|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_27|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, thread4Thread1of1ForFork5_~#t6~0#1.offset] and [1248] L78-3-->thread1EXIT: Formula: (= |v_#valid_194| (store |v_#valid_195| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_44| 0)) InVars {#valid=|v_#valid_195|, thread1Thread1of1ForFork2_~#t3~0#1.base=|v_thread1Thread1of1ForFork2_~#t3~0#1.base_44|} OutVars{thread1Thread1of1ForFork2_~#t3~0#1.offset=|v_thread1Thread1of1ForFork2_~#t3~0#1.offset_31|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_25|, #valid=|v_#valid_194|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_35|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t3~0#1.offset, thread1Thread1of1ForFork2_~#t2~0#1.offset, #valid, thread1Thread1of1ForFork2_~#t2~0#1.base, thread1Thread1of1ForFork2_~#t3~0#1.base] [2022-12-06 05:20:18,684 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [972] $Ultimate##0-->L78: Formula: (and (= |v_#length_1| (store |v_#length_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 4)) (not (= |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 0)) (< |v_#StackHeapBarrier_1| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 1)) (= (select |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) 0) (= |v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t2~0#1.offset, #valid, #length, thread1Thread1of1ForFork2_~#t2~0#1.base] and [1025] L124-->L124-1: Formula: (and (< |v_#StackHeapBarrier_4| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1|) (not (= |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1| 0)) (= (select |v_#valid_14| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1|) 0) (= (store |v_#valid_14| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1| 1) |v_#valid_13|) (= (store |v_#length_8| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_1| 4) |v_#length_7|) (= |v_thread4Thread1of1ForFork5_~#t6~0#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, #valid=|v_#valid_14|} OutVars{thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_7|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_1|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, #length, thread4Thread1of1ForFork5_~#t6~0#1.offset] [2022-12-06 05:20:18,792 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1296] L129-2-->L124-4: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork5_plus_~a#1_29| |v_thread4Thread1of1ForFork5_plus_~b#1_29|))) (and (= 0 |v_thread4Thread1of1ForFork5_#res#1.base_29|) (= |v_thread4Thread1of1ForFork5_plus_#res#1_29| v_~x2~0_69) (= |v_#valid_264| (store |v_#valid_265| |v_thread4Thread1of1ForFork5_~#t5~0#1.base_66| 0)) (= |v_thread4Thread1of1ForFork5_plus_#res#1_29| .cse0) (= |v_thread4Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_49| |v_thread4Thread1of1ForFork5_assume_abort_if_not_~cond#1_53|) (<= 0 (+ v_~x2~0_69 2147483648)) (= |v_thread4Thread1of1ForFork5_plus_#in~b#1_29| v_~s22~0_81) (<= v_~x2~0_69 2147483647) (= |v_thread4Thread1of1ForFork5_plus_#in~a#1_29| |v_thread4Thread1of1ForFork5_plus_~a#1_29|) (= |v_thread4Thread1of1ForFork5_plus_#in~a#1_29| v_~s12~0_56) (= |v_thread4Thread1of1ForFork5_#res#1.offset_29| 0) (not (= (ite (= v_~i2~0_107 v_~n~0_113) 1 0) 0)) (= |v_thread4Thread1of1ForFork5_plus_#in~b#1_29| |v_thread4Thread1of1ForFork5_plus_~b#1_29|) (= (ite (or (<= |v_thread4Thread1of1ForFork5_plus_~b#1_29| 0) (<= .cse0 2147483647)) 1 0) |v_thread4Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_49|))) InVars {~s12~0=v_~s12~0_56, #valid=|v_#valid_265|, thread4Thread1of1ForFork5_~#t5~0#1.base=|v_thread4Thread1of1ForFork5_~#t5~0#1.base_66|, ~i2~0=v_~i2~0_107, ~n~0=v_~n~0_113, ~s22~0=v_~s22~0_81} OutVars{~s12~0=v_~s12~0_56, ~x2~0=v_~x2~0_69, thread4Thread1of1ForFork5_plus_~b#1=|v_thread4Thread1of1ForFork5_plus_~b#1_29|, thread4Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork5_assume_abort_if_not_~cond#1_53|, thread4Thread1of1ForFork5_~#t5~0#1.offset=|v_thread4Thread1of1ForFork5_~#t5~0#1.offset_47|, thread4Thread1of1ForFork5_#res#1.base=|v_thread4Thread1of1ForFork5_#res#1.base_29|, thread4Thread1of1ForFork5_plus_#in~b#1=|v_thread4Thread1of1ForFork5_plus_#in~b#1_29|, thread4Thread1of1ForFork5_plus_#res#1=|v_thread4Thread1of1ForFork5_plus_#res#1_29|, thread4Thread1of1ForFork5_#t~ret30#1=|v_thread4Thread1of1ForFork5_#t~ret30#1_29|, thread4Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_49|, ~i2~0=v_~i2~0_107, thread4Thread1of1ForFork5_#t~mem29#1=|v_thread4Thread1of1ForFork5_#t~mem29#1_17|, thread4Thread1of1ForFork5_plus_#in~a#1=|v_thread4Thread1of1ForFork5_plus_#in~a#1_29|, #valid=|v_#valid_264|, ~n~0=v_~n~0_113, thread4Thread1of1ForFork5_#res#1.offset=|v_thread4Thread1of1ForFork5_#res#1.offset_29|, thread4Thread1of1ForFork5_plus_~a#1=|v_thread4Thread1of1ForFork5_plus_~a#1_29|, ~s22~0=v_~s22~0_81} AuxVars[] AssignedVars[~x2~0, thread4Thread1of1ForFork5_plus_~b#1, thread4Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork5_~#t5~0#1.offset, thread4Thread1of1ForFork5_#res#1.base, thread4Thread1of1ForFork5_plus_#in~b#1, thread4Thread1of1ForFork5_plus_#res#1, thread4Thread1of1ForFork5_#t~ret30#1, thread4Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork5_#t~mem29#1, thread4Thread1of1ForFork5_plus_#in~a#1, #valid, thread4Thread1of1ForFork5_~#t5~0#1.base, thread4Thread1of1ForFork5_#res#1.offset, thread4Thread1of1ForFork5_plus_~a#1] and [972] $Ultimate##0-->L78: Formula: (and (= |v_#length_1| (store |v_#length_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 4)) (not (= |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 0)) (< |v_#StackHeapBarrier_1| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1| 1)) (= (select |v_#valid_2| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|) 0) (= |v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_1|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t2~0#1.offset, #valid, #length, thread1Thread1of1ForFork2_~#t2~0#1.base] [2022-12-06 05:20:19,032 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1237] L124-4-->thread4EXIT: Formula: (= (store |v_#valid_181| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_38| 0) |v_#valid_180|) InVars {#valid=|v_#valid_181|, thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_38|} OutVars{#valid=|v_#valid_180|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_27|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, thread4Thread1of1ForFork5_~#t6~0#1.offset] and [1324] L83-2-->L78-3: Formula: (let ((.cse0 (+ |v_thread1Thread1of1ForFork2_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork2_plus_~a#1_Out_10|))) (and (<= v_~x1~0_Out_34 2147483647) (= .cse0 |v_thread1Thread1of1ForFork2_plus_#res#1_Out_10|) (= v_~x1~0_Out_34 |v_thread1Thread1of1ForFork2_plus_#res#1_Out_10|) (= |v_thread1Thread1of1ForFork2_#res#1.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_Out_10| |v_thread1Thread1of1ForFork2_plus_~a#1_Out_10|) (= |v_thread1Thread1of1ForFork2_plus_#in~b#1_Out_10| |v_thread1Thread1of1ForFork2_plus_~b#1_Out_10|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_16| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_12|) (= v_~s21~0_In_6 |v_thread1Thread1of1ForFork2_plus_#in~b#1_Out_10|) (= |v_thread1Thread1of1ForFork2_plus_#in~a#1_Out_10| v_~s11~0_In_7) (<= 0 (+ v_~x1~0_Out_34 2147483648)) (not (= (ite (= v_~i1~0_In_5 v_~n~0_In_13) 1 0) 0)) (= |v_thread1Thread1of1ForFork2_#res#1.base_Out_4| 0) (= (ite (or (<= .cse0 2147483647) (<= |v_thread1Thread1of1ForFork2_plus_~b#1_Out_10| 0)) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_12|) (= |v_#valid_Out_44| (store |v_#valid_In_28| |v_thread1Thread1of1ForFork2_~#t2~0#1.base_In_5| 0)))) InVars {~s11~0=v_~s11~0_In_7, #valid=|v_#valid_In_28|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_In_5|, ~i1~0=v_~i1~0_In_5, ~s21~0=v_~s21~0_In_6, ~n~0=v_~n~0_In_13} OutVars{thread1Thread1of1ForFork2_plus_#in~b#1=|v_thread1Thread1of1ForFork2_plus_#in~b#1_Out_10|, thread1Thread1of1ForFork2_#t~mem14#1=|v_thread1Thread1of1ForFork2_#t~mem14#1_Out_4|, ~s11~0=v_~s11~0_In_7, thread1Thread1of1ForFork2_#t~ret15#1=|v_thread1Thread1of1ForFork2_#t~ret15#1_Out_10|, thread1Thread1of1ForFork2_plus_~b#1=|v_thread1Thread1of1ForFork2_plus_~b#1_Out_10|, thread1Thread1of1ForFork2_plus_#in~a#1=|v_thread1Thread1of1ForFork2_plus_#in~a#1_Out_10|, ~i1~0=v_~i1~0_In_5, ~x1~0=v_~x1~0_Out_34, #valid=|v_#valid_Out_44|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_12|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_Out_4|, thread1Thread1of1ForFork2_plus_~a#1=|v_thread1Thread1of1ForFork2_plus_~a#1_Out_10|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_In_5|, ~s21~0=v_~s21~0_In_6, ~n~0=v_~n~0_In_13, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_Out_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_16|, thread1Thread1of1ForFork2_plus_#res#1=|v_thread1Thread1of1ForFork2_plus_#res#1_Out_10|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_plus_#in~b#1, thread1Thread1of1ForFork2_#t~mem14#1, thread1Thread1of1ForFork2_#t~ret15#1, thread1Thread1of1ForFork2_plus_~b#1, thread1Thread1of1ForFork2_plus_#in~a#1, ~x1~0, #valid, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_plus_~a#1, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_plus_#res#1] [2022-12-06 05:20:19,122 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1237] L124-4-->thread4EXIT: Formula: (= (store |v_#valid_181| |v_thread4Thread1of1ForFork5_~#t6~0#1.base_38| 0) |v_#valid_180|) InVars {#valid=|v_#valid_181|, thread4Thread1of1ForFork5_~#t6~0#1.base=|v_thread4Thread1of1ForFork5_~#t6~0#1.base_38|} OutVars{#valid=|v_#valid_180|, thread4Thread1of1ForFork5_~#t6~0#1.offset=|v_thread4Thread1of1ForFork5_~#t6~0#1.offset_27|} AuxVars[] AssignedVars[#valid, thread4Thread1of1ForFork5_~#t6~0#1.base, thread4Thread1of1ForFork5_~#t6~0#1.offset] and [1248] L78-3-->thread1EXIT: Formula: (= |v_#valid_194| (store |v_#valid_195| |v_thread1Thread1of1ForFork2_~#t3~0#1.base_44| 0)) InVars {#valid=|v_#valid_195|, thread1Thread1of1ForFork2_~#t3~0#1.base=|v_thread1Thread1of1ForFork2_~#t3~0#1.base_44|} OutVars{thread1Thread1of1ForFork2_~#t3~0#1.offset=|v_thread1Thread1of1ForFork2_~#t3~0#1.offset_31|, thread1Thread1of1ForFork2_~#t2~0#1.offset=|v_thread1Thread1of1ForFork2_~#t2~0#1.offset_25|, #valid=|v_#valid_194|, thread1Thread1of1ForFork2_~#t2~0#1.base=|v_thread1Thread1of1ForFork2_~#t2~0#1.base_35|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~#t3~0#1.offset, thread1Thread1of1ForFork2_~#t2~0#1.offset, #valid, thread1Thread1of1ForFork2_~#t2~0#1.base, thread1Thread1of1ForFork2_~#t3~0#1.base] [2022-12-06 05:20:19,247 INFO L203 LiptonReduction]: Total number of compositions: 35 [2022-12-06 05:20:19,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6512 [2022-12-06 05:20:19,248 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 563 transitions, 5713 flow [2022-12-06 05:20:19,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.8) internal successors, (295), 25 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:19,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:19,248 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:19,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:20:19,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-06 05:20:19,469 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-12-06 05:20:19,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:19,470 INFO L85 PathProgramCache]: Analyzing trace with hash 606717587, now seen corresponding path program 1 times [2022-12-06 05:20:19,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:19,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506218813] [2022-12-06 05:20:19,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:19,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:20,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:20,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506218813] [2022-12-06 05:20:20,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506218813] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:20:20,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661494730] [2022-12-06 05:20:20,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:20,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:20:20,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:20:20,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:20:20,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:20:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:21,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-06 05:20:21,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:20:21,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:20:21,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-06 05:20:21,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:20:21,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-06 05:20:21,623 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 15 treesize of output 7 [2022-12-06 05:20:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:21,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:20:22,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:20:22,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 282 treesize of output 204 [2022-12-06 05:20:22,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 164 [2022-12-06 05:20:22,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 150 [2022-12-06 05:20:22,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 05:20:22,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 05:20:22,123 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 05:20:22,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 14 [2022-12-06 05:20:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:22,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661494730] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:20:22,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:20:22,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2022-12-06 05:20:22,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877246271] [2022-12-06 05:20:22,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:20:22,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-06 05:20:22,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:22,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-06 05:20:22,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=798, Unknown=21, NotChecked=0, Total=930 [2022-12-06 05:20:22,336 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 102 [2022-12-06 05:20:22,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 563 transitions, 5713 flow. Second operand has 31 states, 31 states have (on average 10.741935483870968) internal successors, (333), 31 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:20:22,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:22,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 102 [2022-12-06 05:20:22,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand