/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 01:48:31,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 01:48:31,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 01:48:31,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 01:48:31,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 01:48:31,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 01:48:31,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 01:48:31,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 01:48:31,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 01:48:31,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 01:48:31,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 01:48:31,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 01:48:31,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 01:48:31,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 01:48:31,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 01:48:31,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 01:48:31,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 01:48:31,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 01:48:31,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 01:48:31,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 01:48:31,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 01:48:31,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 01:48:31,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 01:48:31,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 01:48:31,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 01:48:31,996 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 01:48:31,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 01:48:31,997 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 01:48:31,998 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 01:48:31,999 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 01:48:31,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 01:48:32,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 01:48:32,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 01:48:32,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 01:48:32,016 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 01:48:32,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 01:48:32,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 01:48:32,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 01:48:32,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 01:48:32,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 01:48:32,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 01:48:32,020 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 01:48:32,051 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 01:48:32,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 01:48:32,053 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 01:48:32,053 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 01:48:32,054 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 01:48:32,054 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 01:48:32,054 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 01:48:32,055 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 01:48:32,055 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 01:48:32,055 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 01:48:32,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 01:48:32,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 01:48:32,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 01:48:32,057 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 01:48:32,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 01:48:32,057 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 01:48:32,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 01:48:32,057 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 01:48:32,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 01:48:32,058 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 01:48:32,058 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 01:48:32,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:48:32,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 01:48:32,058 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 01:48:32,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 01:48:32,059 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 01:48:32,059 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 01:48:32,059 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 01:48:32,059 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-13 01:48:32,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 01:48:32,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 01:48:32,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 01:48:32,396 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 01:48:32,396 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 01:48:32,397 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2022-12-13 01:48:33,460 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 01:48:33,688 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 01:48:33,689 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2022-12-13 01:48:33,697 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d249e16c/134eba62ef30495bb5f246fde3c6dd24/FLAGd2357008e [2022-12-13 01:48:33,712 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d249e16c/134eba62ef30495bb5f246fde3c6dd24 [2022-12-13 01:48:33,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 01:48:33,716 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 01:48:33,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 01:48:33,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 01:48:33,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 01:48:33,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:48:33" (1/1) ... [2022-12-13 01:48:33,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ed9db86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:33, skipping insertion in model container [2022-12-13 01:48:33,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:48:33" (1/1) ... [2022-12-13 01:48:33,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 01:48:33,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 01:48:33,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,905 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-ticket-6.wvr.c[4400,4413] [2022-12-13 01:48:33,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:48:33,925 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 01:48:33,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:48:33,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:48:33,974 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-ticket-6.wvr.c[4400,4413] [2022-12-13 01:48:33,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:48:33,999 INFO L208 MainTranslator]: Completed translation [2022-12-13 01:48:33,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:33 WrapperNode [2022-12-13 01:48:34,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 01:48:34,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 01:48:34,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 01:48:34,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 01:48:34,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:33" (1/1) ... [2022-12-13 01:48:34,029 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:33" (1/1) ... [2022-12-13 01:48:34,071 INFO L138 Inliner]: procedures = 25, calls = 100, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 278 [2022-12-13 01:48:34,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 01:48:34,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 01:48:34,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 01:48:34,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 01:48:34,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:33" (1/1) ... [2022-12-13 01:48:34,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:33" (1/1) ... [2022-12-13 01:48:34,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:33" (1/1) ... [2022-12-13 01:48:34,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:33" (1/1) ... [2022-12-13 01:48:34,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:33" (1/1) ... [2022-12-13 01:48:34,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:33" (1/1) ... [2022-12-13 01:48:34,119 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:33" (1/1) ... [2022-12-13 01:48:34,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:33" (1/1) ... [2022-12-13 01:48:34,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 01:48:34,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 01:48:34,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 01:48:34,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 01:48:34,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:33" (1/1) ... [2022-12-13 01:48:34,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:48:34,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:48:34,164 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-13 01:48:34,191 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-13 01:48:34,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 01:48:34,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 01:48:34,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 01:48:34,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 01:48:34,214 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 01:48:34,214 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 01:48:34,214 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 01:48:34,215 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 01:48:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 01:48:34,215 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 01:48:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 01:48:34,215 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 01:48:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 01:48:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-12-13 01:48:34,216 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-12-13 01:48:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-12-13 01:48:34,216 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-12-13 01:48:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 01:48:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 01:48:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 01:48:34,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 01:48:34,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 01:48:34,218 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 01:48:34,368 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 01:48:34,370 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 01:48:34,657 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 01:48:34,830 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 01:48:34,831 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 01:48:34,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:48:34 BoogieIcfgContainer [2022-12-13 01:48:34,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 01:48:34,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 01:48:34,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 01:48:34,838 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 01:48:34,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:48:33" (1/3) ... [2022-12-13 01:48:34,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d99ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:48:34, skipping insertion in model container [2022-12-13 01:48:34,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:48:33" (2/3) ... [2022-12-13 01:48:34,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d99ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:48:34, skipping insertion in model container [2022-12-13 01:48:34,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:48:34" (3/3) ... [2022-12-13 01:48:34,840 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-6.wvr.c [2022-12-13 01:48:34,856 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 01:48:34,856 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 01:48:34,856 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 01:48:34,960 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2022-12-13 01:48:35,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 181 transitions, 410 flow [2022-12-13 01:48:35,113 INFO L130 PetriNetUnfolder]: 2/175 cut-off events. [2022-12-13 01:48:35,113 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 01:48:35,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 175 events. 2/175 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 78 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-12-13 01:48:35,119 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 181 transitions, 410 flow [2022-12-13 01:48:35,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 159 transitions, 354 flow [2022-12-13 01:48:35,127 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:48:35,154 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 159 transitions, 354 flow [2022-12-13 01:48:35,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 159 transitions, 354 flow [2022-12-13 01:48:35,235 INFO L130 PetriNetUnfolder]: 2/159 cut-off events. [2022-12-13 01:48:35,235 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 01:48:35,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 159 events. 2/159 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-12-13 01:48:35,241 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 159 transitions, 354 flow [2022-12-13 01:48:35,241 INFO L226 LiptonReduction]: Number of co-enabled transitions 3042 [2022-12-13 01:48:42,792 INFO L241 LiptonReduction]: Total number of compositions: 121 [2022-12-13 01:48:42,805 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 01:48:42,810 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;@15af218a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 01:48:42,811 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 01:48:42,820 INFO L130 PetriNetUnfolder]: 0/37 cut-off events. [2022-12-13 01:48:42,820 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 01:48:42,820 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:48:42,821 INFO L214 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] [2022-12-13 01:48:42,821 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 01:48:42,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:48:42,825 INFO L85 PathProgramCache]: Analyzing trace with hash -152965531, now seen corresponding path program 1 times [2022-12-13 01:48:42,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:48:42,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781142581] [2022-12-13 01:48:42,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:48:42,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:48:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:48:44,435 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-13 01:48:44,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:48:44,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781142581] [2022-12-13 01:48:44,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781142581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:48:44,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:48:44,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:48:44,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699381991] [2022-12-13 01:48:44,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:48:44,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:48:44,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:48:44,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:48:44,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:48:44,467 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 01:48:44,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 38 transitions, 112 flow. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-13 01:48:44,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:48:44,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 01:48:44,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:48:46,986 INFO L130 PetriNetUnfolder]: 18703/24423 cut-off events. [2022-12-13 01:48:46,987 INFO L131 PetriNetUnfolder]: For 1753/1753 co-relation queries the response was YES. [2022-12-13 01:48:47,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50812 conditions, 24423 events. 18703/24423 cut-off events. For 1753/1753 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 112611 event pairs, 9560 based on Foata normal form. 1/24424 useless extension candidates. Maximal degree in co-relation 49901. Up to 16400 conditions per place. [2022-12-13 01:48:47,141 INFO L137 encePairwiseOnDemand]: 23/38 looper letters, 76 selfloop transitions, 19 changer transitions 24/119 dead transitions. [2022-12-13 01:48:47,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 119 transitions, 557 flow [2022-12-13 01:48:47,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:48:47,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:48:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2022-12-13 01:48:47,153 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45112781954887216 [2022-12-13 01:48:47,155 INFO L175 Difference]: Start difference. First operand has 57 places, 38 transitions, 112 flow. Second operand 7 states and 120 transitions. [2022-12-13 01:48:47,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 119 transitions, 557 flow [2022-12-13 01:48:47,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 119 transitions, 503 flow, removed 0 selfloop flow, removed 12 redundant places. [2022-12-13 01:48:47,220 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 220 flow [2022-12-13 01:48:47,222 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2022-12-13 01:48:47,224 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, -2 predicate places. [2022-12-13 01:48:47,225 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:48:47,225 INFO L89 Accepts]: Start accepts. Operand has 55 places, 56 transitions, 220 flow [2022-12-13 01:48:47,231 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:48:47,231 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:48:47,231 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 56 transitions, 220 flow [2022-12-13 01:48:47,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 56 transitions, 220 flow [2022-12-13 01:48:47,471 INFO L130 PetriNetUnfolder]: 1361/2362 cut-off events. [2022-12-13 01:48:47,471 INFO L131 PetriNetUnfolder]: For 668/1427 co-relation queries the response was YES. [2022-12-13 01:48:47,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6172 conditions, 2362 events. 1361/2362 cut-off events. For 668/1427 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 15965 event pairs, 813 based on Foata normal form. 0/2046 useless extension candidates. Maximal degree in co-relation 6164. Up to 1792 conditions per place. [2022-12-13 01:48:47,505 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 56 transitions, 220 flow [2022-12-13 01:48:47,505 INFO L226 LiptonReduction]: Number of co-enabled transitions 588 [2022-12-13 01:48:47,729 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [661] L124-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork4_#res#1.offset_29| 0) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| 0)) (= v_~b~0_189 (ite (= (ite (or (= v_~x~0_136 1) (not (= (mod v_~b~0_190 256) 0))) 1 0) 0) 0 1)) (= |v_thread5Thread1of1ForFork4_#res#1.base_29| 0) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (ite (<= v_~m5~0_59 v_~s~0_585) 1 0) |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (+ v_~s~0_585 1) v_~s~0_584)) InVars {~b~0=v_~b~0_190, ~m5~0=v_~m5~0_59, ~x~0=v_~x~0_136, ~s~0=v_~s~0_585} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_29|, ~b~0=v_~b~0_189, ~m5~0=v_~m5~0_59, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_29|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_39|, ~x~0=v_~x~0_136, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31|, ~s~0=v_~s~0_584} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0] [2022-12-13 01:48:47,810 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [675] L86-->thread3EXIT: Formula: (and (= (+ v_~s~0_637 1) v_~s~0_636) (= v_~b~0_239 (ite (= (ite (or (not (= (mod v_~b~0_240 256) 0)) (= v_~x~0_163 1)) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork5_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39| |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39|) (not (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39| 0)) (= |v_thread3Thread1of1ForFork5_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39| (ite (<= v_~m3~0_65 v_~s~0_637) 1 0))) InVars {~m3~0=v_~m3~0_65, ~b~0=v_~b~0_240, ~x~0=v_~x~0_163, ~s~0=v_~s~0_637} OutVars{~m3~0=v_~m3~0_65, thread3Thread1of1ForFork5_#res#1.base=|v_thread3Thread1of1ForFork5_#res#1.base_7|, ~b~0=v_~b~0_239, thread3Thread1of1ForFork5_#res#1.offset=|v_thread3Thread1of1ForFork5_#res#1.offset_7|, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39|, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39|, thread3Thread1of1ForFork5_#t~post6#1=|v_thread3Thread1of1ForFork5_#t~post6#1_59|, ~x~0=v_~x~0_163, ~s~0=v_~s~0_636} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_#res#1.base, ~b~0, thread3Thread1of1ForFork5_#res#1.offset, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_#t~post6#1, ~s~0] [2022-12-13 01:48:47,930 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [658] L143-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (= (ite (<= v_~m6~0_49 v_~s~0_537) 1 0) |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (not (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| 0)) (= |v_thread6Thread1of1ForFork0_#res#1.offset_41| 0) (= (+ v_~s~0_537 1) v_~s~0_536) (= |v_thread6Thread1of1ForFork0_#res#1.base_41| 0) (= v_~b~0_165 (ite (= (ite (or (not (= (mod v_~b~0_166 256) 0)) (= v_~x~0_121 1)) 1 0) 0) 0 1))) InVars {~b~0=v_~b~0_166, ~m6~0=v_~m6~0_49, ~x~0=v_~x~0_121, ~s~0=v_~s~0_537} OutVars{thread6Thread1of1ForFork0_#res#1.base=|v_thread6Thread1of1ForFork0_#res#1.base_41|, ~b~0=v_~b~0_165, ~m6~0=v_~m6~0_49, thread6Thread1of1ForFork0_#t~post12#1=|v_thread6Thread1of1ForFork0_#t~post12#1_45|, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29|, thread6Thread1of1ForFork0_#res#1.offset=|v_thread6Thread1of1ForFork0_#res#1.offset_41|, ~x~0=v_~x~0_121, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|, ~s~0=v_~s~0_536} AuxVars[] AssignedVars[thread6Thread1of1ForFork0_#res#1.base, ~b~0, thread6Thread1of1ForFork0_#t~post12#1, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork0_#res#1.offset, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-13 01:48:48,009 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [691] L105-->thread4EXIT: Formula: (and (= v_~b~0_281 (ite (= (ite (or (not (= (mod v_~b~0_282 256) 0)) (= v_~x~0_191 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~s~0_685 1) v_~s~0_684) (= |v_thread4Thread1of1ForFork2_#res#1.base_25| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_25| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m4~0_71 v_~s~0_685) 1 0))) InVars {~b~0=v_~b~0_282, ~m4~0=v_~m4~0_71, ~x~0=v_~x~0_191, ~s~0=v_~s~0_685} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_25|, ~b~0=v_~b~0_281, ~m4~0=v_~m4~0_71, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_55|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_191, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_25|, ~s~0=v_~s~0_684} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#res#1.offset, ~s~0] [2022-12-13 01:48:48,087 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-13 01:48:48,185 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L45-->thread6EXIT: Formula: (let ((.cse0 (= v_~x~0_235 1))) (and .cse0 (= v_~b~0_357 (ite (= (ite (or (not (= (mod v_~b~0_358 256) 0)) .cse0) 1 0) 0) 0 1)) (= |v_thread6Thread1of1ForFork0_#res#1.base_53| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39| (ite (<= v_~m1~0_93 v_~s~0_763) 1 0)) (= |v_thread6Thread1of1ForFork0_#res#1.offset_53| 0) (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|) (= (+ v_~s~0_763 1) v_~s~0_762) (not (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_39| 0)) (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m6~0_89 v_~s~0_763) 1 0)))) InVars {~b~0=v_~b~0_358, ~m6~0=v_~m6~0_89, ~m1~0=v_~m1~0_93, ~s~0=v_~s~0_763} OutVars{thread6Thread1of1ForFork0_#res#1.base=|v_thread6Thread1of1ForFork0_#res#1.base_53|, ~b~0=v_~b~0_357, ~m6~0=v_~m6~0_89, thread6Thread1of1ForFork0_#t~post12#1=|v_thread6Thread1of1ForFork0_#t~post12#1_57|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_41|, ~m1~0=v_~m1~0_93, thread6Thread1of1ForFork0_#res#1.offset=|v_thread6Thread1of1ForFork0_#res#1.offset_53|, ~x~0=v_~x~0_235, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, ~s~0=v_~s~0_762, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|} AuxVars[] AssignedVars[thread6Thread1of1ForFork0_#res#1.base, ~b~0, thread6Thread1of1ForFork0_#t~post12#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork0_#res#1.offset, ~x~0, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [586] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_29| 0) (= v_~x~0_14 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_29| 0) (= (+ v_~s~0_179 1) v_~s~0_178)) InVars {~s~0=v_~s~0_179} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_29|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_29|, ~x~0=v_~x~0_14, ~s~0=v_~s~0_178} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-13 01:48:48,290 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:48:48,293 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1069 [2022-12-13 01:48:48,293 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 56 transitions, 237 flow [2022-12-13 01:48:48,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-13 01:48:48,293 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:48:48,293 INFO L214 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] [2022-12-13 01:48:48,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 01:48:48,297 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 01:48:48,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:48:48,297 INFO L85 PathProgramCache]: Analyzing trace with hash -99509331, now seen corresponding path program 2 times [2022-12-13 01:48:48,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:48:48,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63558619] [2022-12-13 01:48:48,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:48:48,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:48:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:48:49,270 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-13 01:48:49,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:48:49,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63558619] [2022-12-13 01:48:49,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63558619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:48:49,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:48:49,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:48:49,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844511695] [2022-12-13 01:48:49,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:48:49,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:48:49,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:48:49,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:48:49,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:48:49,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 01:48:49,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 56 transitions, 237 flow. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-13 01:48:49,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:48:49,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 01:48:49,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:48:52,115 INFO L130 PetriNetUnfolder]: 27396/36117 cut-off events. [2022-12-13 01:48:52,115 INFO L131 PetriNetUnfolder]: For 32005/32005 co-relation queries the response was YES. [2022-12-13 01:48:52,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116658 conditions, 36117 events. 27396/36117 cut-off events. For 32005/32005 co-relation queries the response was YES. Maximal size of possible extension queue 1132. Compared 187255 event pairs, 4944 based on Foata normal form. 2/36115 useless extension candidates. Maximal degree in co-relation 116648. Up to 14123 conditions per place. [2022-12-13 01:48:52,292 INFO L137 encePairwiseOnDemand]: 23/44 looper letters, 130 selfloop transitions, 37 changer transitions 24/191 dead transitions. [2022-12-13 01:48:52,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 191 transitions, 1087 flow [2022-12-13 01:48:52,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:48:52,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:48:52,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2022-12-13 01:48:52,300 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.53125 [2022-12-13 01:48:52,301 INFO L175 Difference]: Start difference. First operand has 54 places, 56 transitions, 237 flow. Second operand 8 states and 187 transitions. [2022-12-13 01:48:52,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 191 transitions, 1087 flow [2022-12-13 01:48:52,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 191 transitions, 1083 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 01:48:52,314 INFO L231 Difference]: Finished difference. Result has 64 places, 73 transitions, 479 flow [2022-12-13 01:48:52,315 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=479, PETRI_PLACES=64, PETRI_TRANSITIONS=73} [2022-12-13 01:48:52,316 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2022-12-13 01:48:52,316 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:48:52,316 INFO L89 Accepts]: Start accepts. Operand has 64 places, 73 transitions, 479 flow [2022-12-13 01:48:52,319 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:48:52,319 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:48:52,319 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 73 transitions, 479 flow [2022-12-13 01:48:52,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 73 transitions, 479 flow [2022-12-13 01:48:52,744 INFO L130 PetriNetUnfolder]: 2068/3537 cut-off events. [2022-12-13 01:48:52,744 INFO L131 PetriNetUnfolder]: For 10273/14179 co-relation queries the response was YES. [2022-12-13 01:48:52,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16028 conditions, 3537 events. 2068/3537 cut-off events. For 10273/14179 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 23708 event pairs, 623 based on Foata normal form. 42/3226 useless extension candidates. Maximal degree in co-relation 15649. Up to 2465 conditions per place. [2022-12-13 01:48:52,802 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 73 transitions, 479 flow [2022-12-13 01:48:52,802 INFO L226 LiptonReduction]: Number of co-enabled transitions 910 [2022-12-13 01:48:52,865 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:48:52,866 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 550 [2022-12-13 01:48:52,867 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 73 transitions, 481 flow [2022-12-13 01:48:52,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-13 01:48:52,867 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:48:52,867 INFO L214 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] [2022-12-13 01:48:52,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 01:48:52,867 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 01:48:52,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:48:52,868 INFO L85 PathProgramCache]: Analyzing trace with hash 2096025111, now seen corresponding path program 1 times [2022-12-13 01:48:52,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:48:52,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521201756] [2022-12-13 01:48:52,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:48:52,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:48:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:48:53,256 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-13 01:48:53,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:48:53,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521201756] [2022-12-13 01:48:53,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521201756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:48:53,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:48:53,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:48:53,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097018310] [2022-12-13 01:48:53,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:48:53,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:48:53,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:48:53,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:48:53,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:48:53,262 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:48:53,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 73 transitions, 481 flow. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 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-13 01:48:53,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:48:53,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:48:53,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:48:57,958 INFO L130 PetriNetUnfolder]: 44945/59432 cut-off events. [2022-12-13 01:48:57,958 INFO L131 PetriNetUnfolder]: For 217811/217811 co-relation queries the response was YES. [2022-12-13 01:48:58,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266996 conditions, 59432 events. 44945/59432 cut-off events. For 217811/217811 co-relation queries the response was YES. Maximal size of possible extension queue 2473. Compared 341167 event pairs, 3496 based on Foata normal form. 2212/61644 useless extension candidates. Maximal degree in co-relation 213025. Up to 25241 conditions per place. [2022-12-13 01:48:58,330 INFO L137 encePairwiseOnDemand]: 26/45 looper letters, 139 selfloop transitions, 124 changer transitions 0/263 dead transitions. [2022-12-13 01:48:58,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 263 transitions, 2170 flow [2022-12-13 01:48:58,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:48:58,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:48:58,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2022-12-13 01:48:58,332 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6095238095238096 [2022-12-13 01:48:58,332 INFO L175 Difference]: Start difference. First operand has 63 places, 73 transitions, 481 flow. Second operand 7 states and 192 transitions. [2022-12-13 01:48:58,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 263 transitions, 2170 flow [2022-12-13 01:48:58,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 263 transitions, 1906 flow, removed 95 selfloop flow, removed 3 redundant places. [2022-12-13 01:48:58,493 INFO L231 Difference]: Finished difference. Result has 66 places, 180 transitions, 1425 flow [2022-12-13 01:48:58,493 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1425, PETRI_PLACES=66, PETRI_TRANSITIONS=180} [2022-12-13 01:48:58,494 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2022-12-13 01:48:58,494 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:48:58,494 INFO L89 Accepts]: Start accepts. Operand has 66 places, 180 transitions, 1425 flow [2022-12-13 01:48:58,496 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:48:58,496 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:48:58,496 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 180 transitions, 1425 flow [2022-12-13 01:48:58,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 180 transitions, 1425 flow [2022-12-13 01:48:59,766 INFO L130 PetriNetUnfolder]: 11953/17336 cut-off events. [2022-12-13 01:48:59,766 INFO L131 PetriNetUnfolder]: For 56862/71741 co-relation queries the response was YES. [2022-12-13 01:48:59,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77287 conditions, 17336 events. 11953/17336 cut-off events. For 56862/71741 co-relation queries the response was YES. Maximal size of possible extension queue 1289. Compared 111731 event pairs, 728 based on Foata normal form. 288/17396 useless extension candidates. Maximal degree in co-relation 76433. Up to 7963 conditions per place. [2022-12-13 01:48:59,893 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 180 transitions, 1425 flow [2022-12-13 01:48:59,894 INFO L226 LiptonReduction]: Number of co-enabled transitions 1868 [2022-12-13 01:49:00,306 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [691] L105-->thread4EXIT: Formula: (and (= v_~b~0_281 (ite (= (ite (or (not (= (mod v_~b~0_282 256) 0)) (= v_~x~0_191 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~s~0_685 1) v_~s~0_684) (= |v_thread4Thread1of1ForFork2_#res#1.base_25| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_25| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m4~0_71 v_~s~0_685) 1 0))) InVars {~b~0=v_~b~0_282, ~m4~0=v_~m4~0_71, ~x~0=v_~x~0_191, ~s~0=v_~s~0_685} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_25|, ~b~0=v_~b~0_281, ~m4~0=v_~m4~0_71, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_55|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_191, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_25|, ~s~0=v_~s~0_684} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#res#1.offset, ~s~0] [2022-12-13 01:49:00,374 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [703] L45-->thread4EXIT: Formula: (let ((.cse0 (= v_~x~0_237 1))) (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_45| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_45|) (= |v_thread4Thread1of1ForFork2_#res#1.offset_29| 0) (= (ite (<= v_~m1~0_95 v_~s~0_767) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|) (= |v_thread4Thread1of1ForFork2_#res#1.base_29| 0) (= (+ v_~s~0_767 1) v_~s~0_766) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_45| (ite (<= v_~m4~0_89 v_~s~0_767) 1 0)) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_45| 0)) (= v_~b~0_361 (ite (= (ite (or (not (= (mod v_~b~0_362 256) 0)) .cse0) 1 0) 0) 0 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|) .cse0)) InVars {~b~0=v_~b~0_362, ~m4~0=v_~m4~0_89, ~m1~0=v_~m1~0_95, ~s~0=v_~s~0_767} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_45|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_29|, ~b~0=v_~b~0_361, ~m4~0=v_~m4~0_89, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_59|, ~m1~0=v_~m1~0_95, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_45|, ~x~0=v_~x~0_237, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_29|, ~s~0=v_~s~0_766, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~x~0, thread4Thread1of1ForFork2_#res#1.offset, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:49:00,473 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] [2022-12-13 01:49:00,493 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [691] L105-->thread4EXIT: Formula: (and (= v_~b~0_281 (ite (= (ite (or (not (= (mod v_~b~0_282 256) 0)) (= v_~x~0_191 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~s~0_685 1) v_~s~0_684) (= |v_thread4Thread1of1ForFork2_#res#1.base_25| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_25| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m4~0_71 v_~s~0_685) 1 0))) InVars {~b~0=v_~b~0_282, ~m4~0=v_~m4~0_71, ~x~0=v_~x~0_191, ~s~0=v_~s~0_685} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_25|, ~b~0=v_~b~0_281, ~m4~0=v_~m4~0_71, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_55|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_191, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_25|, ~s~0=v_~s~0_684} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#res#1.offset, ~s~0] [2022-12-13 01:49:00,562 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [691] L105-->thread4EXIT: Formula: (and (= v_~b~0_281 (ite (= (ite (or (not (= (mod v_~b~0_282 256) 0)) (= v_~x~0_191 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~s~0_685 1) v_~s~0_684) (= |v_thread4Thread1of1ForFork2_#res#1.base_25| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_25| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m4~0_71 v_~s~0_685) 1 0))) InVars {~b~0=v_~b~0_282, ~m4~0=v_~m4~0_71, ~x~0=v_~x~0_191, ~s~0=v_~s~0_685} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_25|, ~b~0=v_~b~0_281, ~m4~0=v_~m4~0_71, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_55|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_191, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_25|, ~s~0=v_~s~0_684} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#res#1.offset, ~s~0] [2022-12-13 01:49:00,618 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [658] L143-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (= (ite (<= v_~m6~0_49 v_~s~0_537) 1 0) |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (not (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| 0)) (= |v_thread6Thread1of1ForFork0_#res#1.offset_41| 0) (= (+ v_~s~0_537 1) v_~s~0_536) (= |v_thread6Thread1of1ForFork0_#res#1.base_41| 0) (= v_~b~0_165 (ite (= (ite (or (not (= (mod v_~b~0_166 256) 0)) (= v_~x~0_121 1)) 1 0) 0) 0 1))) InVars {~b~0=v_~b~0_166, ~m6~0=v_~m6~0_49, ~x~0=v_~x~0_121, ~s~0=v_~s~0_537} OutVars{thread6Thread1of1ForFork0_#res#1.base=|v_thread6Thread1of1ForFork0_#res#1.base_41|, ~b~0=v_~b~0_165, ~m6~0=v_~m6~0_49, thread6Thread1of1ForFork0_#t~post12#1=|v_thread6Thread1of1ForFork0_#t~post12#1_45|, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29|, thread6Thread1of1ForFork0_#res#1.offset=|v_thread6Thread1of1ForFork0_#res#1.offset_41|, ~x~0=v_~x~0_121, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|, ~s~0=v_~s~0_536} AuxVars[] AssignedVars[thread6Thread1of1ForFork0_#res#1.base, ~b~0, thread6Thread1of1ForFork0_#t~post12#1, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork0_#res#1.offset, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-13 01:49:00,674 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [516] $Ultimate##0-->L45: Formula: (and (= v_~m1~0_9 v_~t~0_73) (= v_~t~0_72 (+ v_~t~0_73 1))) InVars {~t~0=v_~t~0_73} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_72} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m1~0, ~t~0] [2022-12-13 01:49:00,690 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [658] L143-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (= (ite (<= v_~m6~0_49 v_~s~0_537) 1 0) |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (not (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| 0)) (= |v_thread6Thread1of1ForFork0_#res#1.offset_41| 0) (= (+ v_~s~0_537 1) v_~s~0_536) (= |v_thread6Thread1of1ForFork0_#res#1.base_41| 0) (= v_~b~0_165 (ite (= (ite (or (not (= (mod v_~b~0_166 256) 0)) (= v_~x~0_121 1)) 1 0) 0) 0 1))) InVars {~b~0=v_~b~0_166, ~m6~0=v_~m6~0_49, ~x~0=v_~x~0_121, ~s~0=v_~s~0_537} OutVars{thread6Thread1of1ForFork0_#res#1.base=|v_thread6Thread1of1ForFork0_#res#1.base_41|, ~b~0=v_~b~0_165, ~m6~0=v_~m6~0_49, thread6Thread1of1ForFork0_#t~post12#1=|v_thread6Thread1of1ForFork0_#t~post12#1_45|, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29|, thread6Thread1of1ForFork0_#res#1.offset=|v_thread6Thread1of1ForFork0_#res#1.offset_41|, ~x~0=v_~x~0_121, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|, ~s~0=v_~s~0_536} AuxVars[] AssignedVars[thread6Thread1of1ForFork0_#res#1.base, ~b~0, thread6Thread1of1ForFork0_#t~post12#1, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork0_#res#1.offset, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-13 01:49:00,753 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [658] L143-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (= (ite (<= v_~m6~0_49 v_~s~0_537) 1 0) |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (not (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| 0)) (= |v_thread6Thread1of1ForFork0_#res#1.offset_41| 0) (= (+ v_~s~0_537 1) v_~s~0_536) (= |v_thread6Thread1of1ForFork0_#res#1.base_41| 0) (= v_~b~0_165 (ite (= (ite (or (not (= (mod v_~b~0_166 256) 0)) (= v_~x~0_121 1)) 1 0) 0) 0 1))) InVars {~b~0=v_~b~0_166, ~m6~0=v_~m6~0_49, ~x~0=v_~x~0_121, ~s~0=v_~s~0_537} OutVars{thread6Thread1of1ForFork0_#res#1.base=|v_thread6Thread1of1ForFork0_#res#1.base_41|, ~b~0=v_~b~0_165, ~m6~0=v_~m6~0_49, thread6Thread1of1ForFork0_#t~post12#1=|v_thread6Thread1of1ForFork0_#t~post12#1_45|, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29|, thread6Thread1of1ForFork0_#res#1.offset=|v_thread6Thread1of1ForFork0_#res#1.offset_41|, ~x~0=v_~x~0_121, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|, ~s~0=v_~s~0_536} AuxVars[] AssignedVars[thread6Thread1of1ForFork0_#res#1.base, ~b~0, thread6Thread1of1ForFork0_#t~post12#1, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork0_#res#1.offset, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-13 01:49:00,807 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [541] $Ultimate##0-->L124: Formula: (and (= (+ v_~t~0_69 1) v_~t~0_68) (= v_~m5~0_9 v_~t~0_69)) InVars {~t~0=v_~t~0_69} OutVars{thread5Thread1of1ForFork4_#t~post9#1=|v_thread5Thread1of1ForFork4_#t~post9#1_1|, ~m5~0=v_~m5~0_9, ~t~0=v_~t~0_68} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_#t~post9#1, ~m5~0, ~t~0] [2022-12-13 01:49:00,831 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-13 01:49:00,892 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [700] L45-->thread5EXIT: Formula: (let ((.cse0 (= v_~x~0_231 1))) (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= (+ v_~s~0_755 1) v_~s~0_754) .cse0 (= |v_thread5Thread1of1ForFork4_#res#1.base_43| 0) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_45| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_45|) (= (ite (= (ite (or .cse0 (not (= (mod v_~b~0_350 256) 0))) 1 0) 0) 0 1) v_~b~0_349) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35| (ite (<= v_~m1~0_89 v_~s~0_755) 1 0)) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_45| 0)) (= |v_thread5Thread1of1ForFork4_#res#1.offset_43| 0) (= (ite (<= v_~m5~0_101 v_~s~0_755) 1 0) |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_45|))) InVars {~b~0=v_~b~0_350, ~m5~0=v_~m5~0_101, ~m1~0=v_~m1~0_89, ~s~0=v_~s~0_755} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_45|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_43|, ~b~0=v_~b~0_349, ~m5~0=v_~m5~0_101, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~m1~0=v_~m1~0_89, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_43|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_53|, ~x~0=v_~x~0_231, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_45|, ~s~0=v_~s~0_754, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, ~x~0, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:49:00,972 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [691] L105-->thread4EXIT: Formula: (and (= v_~b~0_281 (ite (= (ite (or (not (= (mod v_~b~0_282 256) 0)) (= v_~x~0_191 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~s~0_685 1) v_~s~0_684) (= |v_thread4Thread1of1ForFork2_#res#1.base_25| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_25| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m4~0_71 v_~s~0_685) 1 0))) InVars {~b~0=v_~b~0_282, ~m4~0=v_~m4~0_71, ~x~0=v_~x~0_191, ~s~0=v_~s~0_685} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_25|, ~b~0=v_~b~0_281, ~m4~0=v_~m4~0_71, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_55|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_191, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_25|, ~s~0=v_~s~0_684} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#res#1.offset, ~s~0] [2022-12-13 01:49:01,034 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-13 01:49:01,104 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-13 01:49:01,161 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [658] L143-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (= (ite (<= v_~m6~0_49 v_~s~0_537) 1 0) |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (not (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| 0)) (= |v_thread6Thread1of1ForFork0_#res#1.offset_41| 0) (= (+ v_~s~0_537 1) v_~s~0_536) (= |v_thread6Thread1of1ForFork0_#res#1.base_41| 0) (= v_~b~0_165 (ite (= (ite (or (not (= (mod v_~b~0_166 256) 0)) (= v_~x~0_121 1)) 1 0) 0) 0 1))) InVars {~b~0=v_~b~0_166, ~m6~0=v_~m6~0_49, ~x~0=v_~x~0_121, ~s~0=v_~s~0_537} OutVars{thread6Thread1of1ForFork0_#res#1.base=|v_thread6Thread1of1ForFork0_#res#1.base_41|, ~b~0=v_~b~0_165, ~m6~0=v_~m6~0_49, thread6Thread1of1ForFork0_#t~post12#1=|v_thread6Thread1of1ForFork0_#t~post12#1_45|, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29|, thread6Thread1of1ForFork0_#res#1.offset=|v_thread6Thread1of1ForFork0_#res#1.offset_41|, ~x~0=v_~x~0_121, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|, ~s~0=v_~s~0_536} AuxVars[] AssignedVars[thread6Thread1of1ForFork0_#res#1.base, ~b~0, thread6Thread1of1ForFork0_#t~post12#1, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork0_#res#1.offset, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-13 01:49:01,215 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [661] L124-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork4_#res#1.offset_29| 0) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| 0)) (= v_~b~0_189 (ite (= (ite (or (= v_~x~0_136 1) (not (= (mod v_~b~0_190 256) 0))) 1 0) 0) 0 1)) (= |v_thread5Thread1of1ForFork4_#res#1.base_29| 0) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (ite (<= v_~m5~0_59 v_~s~0_585) 1 0) |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (+ v_~s~0_585 1) v_~s~0_584)) InVars {~b~0=v_~b~0_190, ~m5~0=v_~m5~0_59, ~x~0=v_~x~0_136, ~s~0=v_~s~0_585} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_29|, ~b~0=v_~b~0_189, ~m5~0=v_~m5~0_59, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_29|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_39|, ~x~0=v_~x~0_136, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31|, ~s~0=v_~s~0_584} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0] [2022-12-13 01:49:01,281 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [658] L143-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (= (ite (<= v_~m6~0_49 v_~s~0_537) 1 0) |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (not (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| 0)) (= |v_thread6Thread1of1ForFork0_#res#1.offset_41| 0) (= (+ v_~s~0_537 1) v_~s~0_536) (= |v_thread6Thread1of1ForFork0_#res#1.base_41| 0) (= v_~b~0_165 (ite (= (ite (or (not (= (mod v_~b~0_166 256) 0)) (= v_~x~0_121 1)) 1 0) 0) 0 1))) InVars {~b~0=v_~b~0_166, ~m6~0=v_~m6~0_49, ~x~0=v_~x~0_121, ~s~0=v_~s~0_537} OutVars{thread6Thread1of1ForFork0_#res#1.base=|v_thread6Thread1of1ForFork0_#res#1.base_41|, ~b~0=v_~b~0_165, ~m6~0=v_~m6~0_49, thread6Thread1of1ForFork0_#t~post12#1=|v_thread6Thread1of1ForFork0_#t~post12#1_45|, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29|, thread6Thread1of1ForFork0_#res#1.offset=|v_thread6Thread1of1ForFork0_#res#1.offset_41|, ~x~0=v_~x~0_121, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|, ~s~0=v_~s~0_536} AuxVars[] AssignedVars[thread6Thread1of1ForFork0_#res#1.base, ~b~0, thread6Thread1of1ForFork0_#t~post12#1, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork0_#res#1.offset, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-13 01:49:01,360 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [661] L124-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork4_#res#1.offset_29| 0) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| 0)) (= v_~b~0_189 (ite (= (ite (or (= v_~x~0_136 1) (not (= (mod v_~b~0_190 256) 0))) 1 0) 0) 0 1)) (= |v_thread5Thread1of1ForFork4_#res#1.base_29| 0) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (ite (<= v_~m5~0_59 v_~s~0_585) 1 0) |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (+ v_~s~0_585 1) v_~s~0_584)) InVars {~b~0=v_~b~0_190, ~m5~0=v_~m5~0_59, ~x~0=v_~x~0_136, ~s~0=v_~s~0_585} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_29|, ~b~0=v_~b~0_189, ~m5~0=v_~m5~0_59, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_29|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_39|, ~x~0=v_~x~0_136, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31|, ~s~0=v_~s~0_584} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0] [2022-12-13 01:49:01,415 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [705] L45-->thread1EXIT: Formula: (and (= |v_thread6Thread1of1ForFork0_#res#1.base_55| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_57| 0) (= v_~b~0_369 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|) (= (+ 2 v_~s~0_776) v_~s~0_774) (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_43| |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_43|) (= (ite (<= v_~m6~0_91 v_~s~0_776) 1 0) |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_43|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45| (ite (<= v_~m1~0_99 v_~s~0_776) 1 0)) (= v_~x~0_241 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_57| 0) (= |v_thread6Thread1of1ForFork0_#res#1.offset_55| 0) (not (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_43| 0))) InVars {~m6~0=v_~m6~0_91, ~m1~0=v_~m1~0_99, ~s~0=v_~s~0_776} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_59|, thread6Thread1of1ForFork0_#t~post12#1=|v_thread6Thread1of1ForFork0_#t~post12#1_59|, thread6Thread1of1ForFork0_#res#1.offset=|v_thread6Thread1of1ForFork0_#res#1.offset_55|, thread6Thread1of1ForFork0_#res#1.base=|v_thread6Thread1of1ForFork0_#res#1.base_55|, ~b~0=v_~b~0_369, ~m6~0=v_~m6~0_91, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_43|, ~m1~0=v_~m1~0_99, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_57|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_57|, ~x~0=v_~x~0_241, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_43|, ~s~0=v_~s~0_774, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread6Thread1of1ForFork0_#t~post12#1, thread6Thread1of1ForFork0_#res#1.offset, thread6Thread1of1ForFork0_#res#1.base, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:49:01,517 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [661] L124-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork4_#res#1.offset_29| 0) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| 0)) (= v_~b~0_189 (ite (= (ite (or (= v_~x~0_136 1) (not (= (mod v_~b~0_190 256) 0))) 1 0) 0) 0 1)) (= |v_thread5Thread1of1ForFork4_#res#1.base_29| 0) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (ite (<= v_~m5~0_59 v_~s~0_585) 1 0) |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (+ v_~s~0_585 1) v_~s~0_584)) InVars {~b~0=v_~b~0_190, ~m5~0=v_~m5~0_59, ~x~0=v_~x~0_136, ~s~0=v_~s~0_585} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_29|, ~b~0=v_~b~0_189, ~m5~0=v_~m5~0_59, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_29|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_39|, ~x~0=v_~x~0_136, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31|, ~s~0=v_~s~0_584} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0] [2022-12-13 01:49:01,571 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [586] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_29| 0) (= v_~x~0_14 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_29| 0) (= (+ v_~s~0_179 1) v_~s~0_178)) InVars {~s~0=v_~s~0_179} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_29|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_29|, ~x~0=v_~x~0_14, ~s~0=v_~s~0_178} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-13 01:49:01,597 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-13 01:49:01,650 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [691] L105-->thread4EXIT: Formula: (and (= v_~b~0_281 (ite (= (ite (or (not (= (mod v_~b~0_282 256) 0)) (= v_~x~0_191 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~s~0_685 1) v_~s~0_684) (= |v_thread4Thread1of1ForFork2_#res#1.base_25| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_25| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m4~0_71 v_~s~0_685) 1 0))) InVars {~b~0=v_~b~0_282, ~m4~0=v_~m4~0_71, ~x~0=v_~x~0_191, ~s~0=v_~s~0_685} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_25|, ~b~0=v_~b~0_281, ~m4~0=v_~m4~0_71, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_55|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_191, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_25|, ~s~0=v_~s~0_684} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#res#1.offset, ~s~0] [2022-12-13 01:49:01,711 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [535] $Ultimate##0-->L105: Formula: (and (= v_~m4~0_7 v_~t~0_77) (= v_~t~0_76 (+ v_~t~0_77 1))) InVars {~t~0=v_~t~0_77} OutVars{thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, ~m4~0=v_~m4~0_7, ~t~0=v_~t~0_76} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post7#1, ~m4~0, ~t~0] [2022-12-13 01:49:01,727 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] [2022-12-13 01:49:01,742 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [661] L124-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork4_#res#1.offset_29| 0) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| 0)) (= v_~b~0_189 (ite (= (ite (or (= v_~x~0_136 1) (not (= (mod v_~b~0_190 256) 0))) 1 0) 0) 0 1)) (= |v_thread5Thread1of1ForFork4_#res#1.base_29| 0) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (ite (<= v_~m5~0_59 v_~s~0_585) 1 0) |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (+ v_~s~0_585 1) v_~s~0_584)) InVars {~b~0=v_~b~0_190, ~m5~0=v_~m5~0_59, ~x~0=v_~x~0_136, ~s~0=v_~s~0_585} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_29|, ~b~0=v_~b~0_189, ~m5~0=v_~m5~0_59, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_29|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_39|, ~x~0=v_~x~0_136, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31|, ~s~0=v_~s~0_584} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0] [2022-12-13 01:49:01,799 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-13 01:49:01,865 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [704] L45-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_239 1))) (and (= (ite (= (ite (or (not (= (mod v_~b~0_366 256) 0)) .cse0) 1 0) 0) 0 1) v_~b~0_365) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_49|) (= (+ v_~s~0_771 1) v_~s~0_770) (= (ite (<= v_~m1~0_97 v_~s~0_771) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43| 0)) (= |v_thread2Thread1of1ForFork3_#res#1.offset_63| 0) .cse0 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43|) (= |v_thread2Thread1of1ForFork3_#res#1.base_63| 0) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_49| 0)) (= (ite (<= v_~m2~0_99 v_~s~0_771) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_49|))) InVars {~b~0=v_~b~0_366, ~m2~0=v_~m2~0_99, ~m1~0=v_~m1~0_97, ~s~0=v_~s~0_771} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_75|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_49|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_63|, ~b~0=v_~b~0_365, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43|, ~m2~0=v_~m2~0_99, ~m1~0=v_~m1~0_97, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_63|, ~x~0=v_~x~0_239, ~s~0=v_~s~0_770, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:49:01,968 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [720] $Ultimate##0-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_105 v_~s~0_823) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_53|) (= |v_thread2Thread1of1ForFork3_#res#1.base_67| 0) (= (+ v_~s~0_823 1) v_~s~0_822) (= |v_thread2Thread1of1ForFork3_#res#1.offset_67| 0) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_53| 0)) (= v_~t~0_230 (+ v_~t~0_231 1)) (= v_~b~0_413 (ite (= (ite (or (= v_~x~0_267 1) (not (= (mod v_~b~0_414 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_53| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_53|) (= v_~t~0_231 v_~m3~0_121)) InVars {~b~0=v_~b~0_414, ~m2~0=v_~m2~0_105, ~x~0=v_~x~0_267, ~s~0=v_~s~0_823, ~t~0=v_~t~0_231} OutVars{~m3~0=v_~m3~0_121, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_79|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_53|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_67|, ~b~0=v_~b~0_413, ~m2~0=v_~m2~0_105, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_33|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_53|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_67|, ~x~0=v_~x~0_267, ~s~0=v_~s~0_822, ~t~0=v_~t~0_230} AuxVars[] AssignedVars[~m3~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread3Thread1of1ForFork5_#t~post5#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0, ~t~0] and [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:49:02,058 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [723] $Ultimate##0-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork4_#res#1.offset_47| 0) (= (+ v_~s~0_835 1) v_~s~0_834) (= (+ v_~t~0_243 1) v_~t~0_242) (= v_~b~0_425 (ite (= (ite (or (not (= (mod v_~b~0_426 256) 0)) (= v_~x~0_273 1)) 1 0) 0) 0 1)) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread5Thread1of1ForFork4_#res#1.base_47| 0) (= v_~t~0_243 v_~m3~0_127) (= (ite (<= v_~m5~0_107 v_~s~0_835) 1 0) |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_49|) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_49| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_49|)) InVars {~b~0=v_~b~0_426, ~m5~0=v_~m5~0_107, ~x~0=v_~x~0_273, ~s~0=v_~s~0_835, ~t~0=v_~t~0_243} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_49|, ~m3~0=v_~m3~0_127, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_47|, ~b~0=v_~b~0_425, ~m5~0=v_~m5~0_107, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_47|, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_39|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_57|, ~x~0=v_~x~0_273, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_49|, ~s~0=v_~s~0_834, ~t~0=v_~t~0_242} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~m3~0, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread5Thread1of1ForFork4_#res#1.base, thread3Thread1of1ForFork5_#t~post5#1, thread5Thread1of1ForFork4_#t~post10#1, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0, ~t~0] and [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:49:02,155 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [710] $Ultimate##0-->thread4EXIT: Formula: (and (= (ite (= (ite (or (= v_~x~0_251 1) (not (= (mod v_~b~0_382 256) 0))) 1 0) 0) 0 1) v_~b~0_381) (= v_~t~0_186 (+ v_~t~0_187 1)) (= |v_thread4Thread1of1ForFork2_#res#1.offset_35| 0) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_51| 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_51| (ite (<= v_~m4~0_95 v_~s~0_791) 1 0)) (= |v_thread4Thread1of1ForFork2_#res#1.base_35| 0) (= v_~t~0_187 v_~m3~0_101) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_51| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_51|) (= (+ v_~s~0_791 1) v_~s~0_790)) InVars {~b~0=v_~b~0_382, ~m4~0=v_~m4~0_95, ~x~0=v_~x~0_251, ~s~0=v_~s~0_791, ~t~0=v_~t~0_187} OutVars{~m3~0=v_~m3~0_101, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_51|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_35|, ~b~0=v_~b~0_381, ~m4~0=v_~m4~0_95, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_65|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_51|, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_13|, ~x~0=v_~x~0_251, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_35|, ~s~0=v_~s~0_790, ~t~0=v_~t~0_186} AuxVars[] AssignedVars[~m3~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_#t~post5#1, thread4Thread1of1ForFork2_#res#1.offset, ~s~0, ~t~0] and [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:49:02,279 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [714] $Ultimate##0-->thread6EXIT: Formula: (and (= (ite (<= v_~m6~0_95 v_~s~0_803) 1 0) |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_47|) (= |v_thread6Thread1of1ForFork0_#res#1.offset_59| 0) (= (+ v_~s~0_803 1) v_~s~0_802) (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_47| |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_47|) (= v_~t~0_205 v_~m3~0_109) (not (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_47| 0)) (= |v_thread6Thread1of1ForFork0_#res#1.base_59| 0) (= v_~t~0_204 (+ v_~t~0_205 1)) (= v_~b~0_393 (ite (= (ite (or (= v_~x~0_257 1) (not (= (mod v_~b~0_394 256) 0))) 1 0) 0) 0 1))) InVars {~b~0=v_~b~0_394, ~m6~0=v_~m6~0_95, ~x~0=v_~x~0_257, ~s~0=v_~s~0_803, ~t~0=v_~t~0_205} OutVars{~m3~0=v_~m3~0_109, thread6Thread1of1ForFork0_#res#1.base=|v_thread6Thread1of1ForFork0_#res#1.base_59|, ~b~0=v_~b~0_393, ~m6~0=v_~m6~0_95, thread6Thread1of1ForFork0_#t~post12#1=|v_thread6Thread1of1ForFork0_#t~post12#1_63|, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_47|, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_21|, thread6Thread1of1ForFork0_#res#1.offset=|v_thread6Thread1of1ForFork0_#res#1.offset_59|, ~x~0=v_~x~0_257, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_47|, ~s~0=v_~s~0_802, ~t~0=v_~t~0_204} AuxVars[] AssignedVars[~m3~0, thread6Thread1of1ForFork0_#res#1.base, ~b~0, thread6Thread1of1ForFork0_#t~post12#1, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork5_#t~post5#1, thread6Thread1of1ForFork0_#res#1.offset, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~s~0, ~t~0] and [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:49:02,388 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:49:02,389 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3895 [2022-12-13 01:49:02,389 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 179 transitions, 1537 flow [2022-12-13 01:49:02,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 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-13 01:49:02,390 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:49:02,390 INFO L214 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] [2022-12-13 01:49:02,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 01:49:02,390 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 01:49:02,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:49:02,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1601345526, now seen corresponding path program 1 times [2022-12-13 01:49:02,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:49:02,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530323225] [2022-12-13 01:49:02,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:49:02,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:49:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:49:02,740 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-13 01:49:02,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:49:02,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530323225] [2022-12-13 01:49:02,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530323225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:49:02,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:49:02,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:49:02,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239255022] [2022-12-13 01:49:02,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:49:02,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:49:02,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:49:02,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:49:02,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:49:02,744 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-13 01:49:02,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 179 transitions, 1537 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 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-13 01:49:02,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:49:02,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-13 01:49:02,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:49:10,577 INFO L130 PetriNetUnfolder]: 67661/90200 cut-off events. [2022-12-13 01:49:10,578 INFO L131 PetriNetUnfolder]: For 421906/421906 co-relation queries the response was YES. [2022-12-13 01:49:10,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473123 conditions, 90200 events. 67661/90200 cut-off events. For 421906/421906 co-relation queries the response was YES. Maximal size of possible extension queue 4245. Compared 557474 event pairs, 751 based on Foata normal form. 4046/94246 useless extension candidates. Maximal degree in co-relation 138316. Up to 38791 conditions per place. [2022-12-13 01:49:11,295 INFO L137 encePairwiseOnDemand]: 26/74 looper letters, 249 selfloop transitions, 381 changer transitions 0/630 dead transitions. [2022-12-13 01:49:11,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 630 transitions, 6440 flow [2022-12-13 01:49:11,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:49:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:49:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 366 transitions. [2022-12-13 01:49:11,298 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5495495495495496 [2022-12-13 01:49:11,298 INFO L175 Difference]: Start difference. First operand has 65 places, 179 transitions, 1537 flow. Second operand 9 states and 366 transitions. [2022-12-13 01:49:11,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 630 transitions, 6440 flow [2022-12-13 01:49:29,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 630 transitions, 5300 flow, removed 570 selfloop flow, removed 1 redundant places. [2022-12-13 01:49:29,572 INFO L231 Difference]: Finished difference. Result has 74 places, 483 transitions, 4434 flow [2022-12-13 01:49:29,573 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4434, PETRI_PLACES=74, PETRI_TRANSITIONS=483} [2022-12-13 01:49:29,574 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 17 predicate places. [2022-12-13 01:49:29,575 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:49:29,575 INFO L89 Accepts]: Start accepts. Operand has 74 places, 483 transitions, 4434 flow [2022-12-13 01:49:29,580 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:49:29,580 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:49:29,580 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 483 transitions, 4434 flow [2022-12-13 01:49:29,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 483 transitions, 4434 flow [2022-12-13 01:49:31,644 INFO L130 PetriNetUnfolder]: 18251/27007 cut-off events. [2022-12-13 01:49:31,644 INFO L131 PetriNetUnfolder]: For 50378/76997 co-relation queries the response was YES. [2022-12-13 01:49:31,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107843 conditions, 27007 events. 18251/27007 cut-off events. For 50378/76997 co-relation queries the response was YES. Maximal size of possible extension queue 2283. Compared 191276 event pairs, 306 based on Foata normal form. 667/27391 useless extension candidates. Maximal degree in co-relation 106198. Up to 13945 conditions per place. [2022-12-13 01:49:31,930 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 483 transitions, 4434 flow [2022-12-13 01:49:31,930 INFO L226 LiptonReduction]: Number of co-enabled transitions 4986 [2022-12-13 01:49:31,947 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:49:31,948 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2373 [2022-12-13 01:49:31,948 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 483 transitions, 4434 flow [2022-12-13 01:49:31,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 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-13 01:49:31,948 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:49:31,948 INFO L214 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] [2022-12-13 01:49:31,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 01:49:31,948 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 01:49:31,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:49:31,949 INFO L85 PathProgramCache]: Analyzing trace with hash -822322994, now seen corresponding path program 1 times [2022-12-13 01:49:31,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:49:31,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361934456] [2022-12-13 01:49:31,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:49:31,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:49:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:49:32,212 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-13 01:49:32,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:49:32,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361934456] [2022-12-13 01:49:32,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361934456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:49:32,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:49:32,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:49:32,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782957883] [2022-12-13 01:49:32,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:49:32,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:49:32,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:49:32,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:49:32,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:49:32,216 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-13 01:49:32,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 483 transitions, 4434 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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-13 01:49:32,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:49:32,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-13 01:49:32,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:49:41,935 INFO L130 PetriNetUnfolder]: 74513/100422 cut-off events. [2022-12-13 01:49:41,935 INFO L131 PetriNetUnfolder]: For 221407/221407 co-relation queries the response was YES. [2022-12-13 01:49:42,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466943 conditions, 100422 events. 74513/100422 cut-off events. For 221407/221407 co-relation queries the response was YES. Maximal size of possible extension queue 4926. Compared 644145 event pairs, 3085 based on Foata normal form. 1786/102208 useless extension candidates. Maximal degree in co-relation 303782. Up to 58677 conditions per place. [2022-12-13 01:49:42,776 INFO L137 encePairwiseOnDemand]: 37/72 looper letters, 473 selfloop transitions, 292 changer transitions 0/765 dead transitions. [2022-12-13 01:49:42,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 765 transitions, 8334 flow [2022-12-13 01:49:42,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:49:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:49:42,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 202 transitions. [2022-12-13 01:49:42,778 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4675925925925926 [2022-12-13 01:49:42,778 INFO L175 Difference]: Start difference. First operand has 74 places, 483 transitions, 4434 flow. Second operand 6 states and 202 transitions. [2022-12-13 01:49:42,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 765 transitions, 8334 flow [2022-12-13 01:49:47,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 765 transitions, 8277 flow, removed 22 selfloop flow, removed 1 redundant places. [2022-12-13 01:49:47,599 INFO L231 Difference]: Finished difference. Result has 81 places, 663 transitions, 7672 flow [2022-12-13 01:49:47,600 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=4360, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7672, PETRI_PLACES=81, PETRI_TRANSITIONS=663} [2022-12-13 01:49:47,600 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2022-12-13 01:49:47,600 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:49:47,600 INFO L89 Accepts]: Start accepts. Operand has 81 places, 663 transitions, 7672 flow [2022-12-13 01:49:47,604 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:49:47,604 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:49:47,605 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 663 transitions, 7672 flow [2022-12-13 01:49:47,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 663 transitions, 7672 flow [2022-12-13 01:49:50,489 INFO L130 PetriNetUnfolder]: 20235/30004 cut-off events. [2022-12-13 01:49:50,489 INFO L131 PetriNetUnfolder]: For 96414/150757 co-relation queries the response was YES. [2022-12-13 01:49:50,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152085 conditions, 30004 events. 20235/30004 cut-off events. For 96414/150757 co-relation queries the response was YES. Maximal size of possible extension queue 2565. Compared 216248 event pairs, 167 based on Foata normal form. 707/30408 useless extension candidates. Maximal degree in co-relation 150562. Up to 15947 conditions per place. [2022-12-13 01:49:50,775 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 663 transitions, 7672 flow [2022-12-13 01:49:50,775 INFO L226 LiptonReduction]: Number of co-enabled transitions 6396 [2022-12-13 01:49:50,793 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:49:50,793 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3193 [2022-12-13 01:49:50,794 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 663 transitions, 7672 flow [2022-12-13 01:49:50,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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-13 01:49:50,794 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:49:50,794 INFO L214 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] [2022-12-13 01:49:50,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 01:49:50,794 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 01:49:50,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:49:50,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1793595358, now seen corresponding path program 2 times [2022-12-13 01:49:50,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:49:50,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471688604] [2022-12-13 01:49:50,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:49:50,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:49:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:49:51,048 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-13 01:49:51,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:49:51,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471688604] [2022-12-13 01:49:51,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471688604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:49:51,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:49:51,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:49:51,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985874068] [2022-12-13 01:49:51,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:49:51,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:49:51,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:49:51,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:49:51,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:49:51,052 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-13 01:49:51,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 663 transitions, 7672 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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-13 01:49:51,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:49:51,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-13 01:49:51,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:50:02,545 INFO L130 PetriNetUnfolder]: 69445/94674 cut-off events. [2022-12-13 01:50:02,546 INFO L131 PetriNetUnfolder]: For 347253/347253 co-relation queries the response was YES. [2022-12-13 01:50:02,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515781 conditions, 94674 events. 69445/94674 cut-off events. For 347253/347253 co-relation queries the response was YES. Maximal size of possible extension queue 4862. Compared 620940 event pairs, 2670 based on Foata normal form. 2546/97220 useless extension candidates. Maximal degree in co-relation 315831. Up to 52728 conditions per place. [2022-12-13 01:50:03,412 INFO L137 encePairwiseOnDemand]: 29/72 looper letters, 484 selfloop transitions, 403 changer transitions 0/887 dead transitions. [2022-12-13 01:50:03,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 887 transitions, 11799 flow [2022-12-13 01:50:03,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:50:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:50:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2022-12-13 01:50:03,414 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4837962962962963 [2022-12-13 01:50:03,414 INFO L175 Difference]: Start difference. First operand has 81 places, 663 transitions, 7672 flow. Second operand 6 states and 209 transitions. [2022-12-13 01:50:03,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 887 transitions, 11799 flow [2022-12-13 01:50:12,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 887 transitions, 11562 flow, removed 112 selfloop flow, removed 1 redundant places. [2022-12-13 01:50:13,006 INFO L231 Difference]: Finished difference. Result has 87 places, 788 transitions, 10646 flow [2022-12-13 01:50:13,007 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=7177, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=256, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10646, PETRI_PLACES=87, PETRI_TRANSITIONS=788} [2022-12-13 01:50:13,008 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places. [2022-12-13 01:50:13,008 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:50:13,008 INFO L89 Accepts]: Start accepts. Operand has 87 places, 788 transitions, 10646 flow [2022-12-13 01:50:13,011 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:50:13,011 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:50:13,011 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 788 transitions, 10646 flow [2022-12-13 01:50:13,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 788 transitions, 10646 flow [2022-12-13 01:50:16,121 INFO L130 PetriNetUnfolder]: 19193/29026 cut-off events. [2022-12-13 01:50:16,121 INFO L131 PetriNetUnfolder]: For 113983/161126 co-relation queries the response was YES. [2022-12-13 01:50:16,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161794 conditions, 29026 events. 19193/29026 cut-off events. For 113983/161126 co-relation queries the response was YES. Maximal size of possible extension queue 2562. Compared 213768 event pairs, 169 based on Foata normal form. 1001/29772 useless extension candidates. Maximal degree in co-relation 160122. Up to 14496 conditions per place. [2022-12-13 01:50:16,414 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 788 transitions, 10646 flow [2022-12-13 01:50:16,415 INFO L226 LiptonReduction]: Number of co-enabled transitions 6592 [2022-12-13 01:50:16,428 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:50:16,429 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3421 [2022-12-13 01:50:16,429 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 788 transitions, 10646 flow [2022-12-13 01:50:16,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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-13 01:50:16,429 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:50:16,430 INFO L214 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] [2022-12-13 01:50:16,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 01:50:16,430 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 01:50:16,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:50:16,430 INFO L85 PathProgramCache]: Analyzing trace with hash -559221748, now seen corresponding path program 3 times [2022-12-13 01:50:16,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:50:16,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51844625] [2022-12-13 01:50:16,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:50:16,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:50:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:50:16,712 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-13 01:50:16,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:50:16,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51844625] [2022-12-13 01:50:16,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51844625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:50:16,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:50:16,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:50:16,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532550117] [2022-12-13 01:50:16,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:50:16,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:50:16,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:50:16,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:50:16,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:50:16,715 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 70 [2022-12-13 01:50:16,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 788 transitions, 10646 flow. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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-13 01:50:16,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:50:16,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 70 [2022-12-13 01:50:16,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:50:32,883 INFO L130 PetriNetUnfolder]: 80775/111480 cut-off events. [2022-12-13 01:50:32,884 INFO L131 PetriNetUnfolder]: For 436458/436458 co-relation queries the response was YES. [2022-12-13 01:50:33,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634178 conditions, 111480 events. 80775/111480 cut-off events. For 436458/436458 co-relation queries the response was YES. Maximal size of possible extension queue 5815. Compared 770012 event pairs, 1576 based on Foata normal form. 2116/113596 useless extension candidates. Maximal degree in co-relation 436012. Up to 45171 conditions per place. [2022-12-13 01:50:33,896 INFO L137 encePairwiseOnDemand]: 26/70 looper letters, 425 selfloop transitions, 826 changer transitions 0/1251 dead transitions. [2022-12-13 01:50:33,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 1251 transitions, 18260 flow [2022-12-13 01:50:33,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:50:33,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:50:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 255 transitions. [2022-12-13 01:50:33,897 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5204081632653061 [2022-12-13 01:50:33,897 INFO L175 Difference]: Start difference. First operand has 87 places, 788 transitions, 10646 flow. Second operand 7 states and 255 transitions. [2022-12-13 01:50:33,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 1251 transitions, 18260 flow [2022-12-13 01:50:44,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 1251 transitions, 18161 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-13 01:50:44,095 INFO L231 Difference]: Finished difference. Result has 94 places, 1127 transitions, 18607 flow [2022-12-13 01:50:44,096 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=10519, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=786, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=536, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=18607, PETRI_PLACES=94, PETRI_TRANSITIONS=1127} [2022-12-13 01:50:44,096 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 37 predicate places. [2022-12-13 01:50:44,096 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:50:44,096 INFO L89 Accepts]: Start accepts. Operand has 94 places, 1127 transitions, 18607 flow [2022-12-13 01:50:44,100 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:50:44,100 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:50:44,101 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 1127 transitions, 18607 flow [2022-12-13 01:50:44,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 1127 transitions, 18607 flow [2022-12-13 01:50:48,554 INFO L130 PetriNetUnfolder]: 21704/33311 cut-off events. [2022-12-13 01:50:48,555 INFO L131 PetriNetUnfolder]: For 211544/298913 co-relation queries the response was YES. [2022-12-13 01:50:48,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228884 conditions, 33311 events. 21704/33311 cut-off events. For 211544/298913 co-relation queries the response was YES. Maximal size of possible extension queue 3092. Compared 257675 event pairs, 174 based on Foata normal form. 1271/34331 useless extension candidates. Maximal degree in co-relation 227061. Up to 16639 conditions per place. [2022-12-13 01:50:48,935 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 1127 transitions, 18607 flow [2022-12-13 01:50:48,936 INFO L226 LiptonReduction]: Number of co-enabled transitions 8604 [2022-12-13 01:50:48,961 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [661] L124-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork4_#res#1.offset_29| 0) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| 0)) (= v_~b~0_189 (ite (= (ite (or (= v_~x~0_136 1) (not (= (mod v_~b~0_190 256) 0))) 1 0) 0) 0 1)) (= |v_thread5Thread1of1ForFork4_#res#1.base_29| 0) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (ite (<= v_~m5~0_59 v_~s~0_585) 1 0) |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (+ v_~s~0_585 1) v_~s~0_584)) InVars {~b~0=v_~b~0_190, ~m5~0=v_~m5~0_59, ~x~0=v_~x~0_136, ~s~0=v_~s~0_585} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_29|, ~b~0=v_~b~0_189, ~m5~0=v_~m5~0_59, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_29|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_39|, ~x~0=v_~x~0_136, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31|, ~s~0=v_~s~0_584} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0] and [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:50:49,060 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:50:49,061 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4965 [2022-12-13 01:50:49,061 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 1127 transitions, 18610 flow [2022-12-13 01:50:49,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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-13 01:50:49,062 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:50:49,062 INFO L214 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] [2022-12-13 01:50:49,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 01:50:49,062 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 01:50:49,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:50:49,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1657313262, now seen corresponding path program 4 times [2022-12-13 01:50:49,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:50:49,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37010763] [2022-12-13 01:50:49,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:50:49,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:50:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:50:49,356 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-13 01:50:49,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:50:49,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37010763] [2022-12-13 01:50:49,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37010763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:50:49,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:50:49,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:50:49,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972967595] [2022-12-13 01:50:49,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:50:49,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:50:49,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:50:49,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:50:49,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:50:49,358 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 71 [2022-12-13 01:50:49,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 1127 transitions, 18610 flow. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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-13 01:50:49,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:50:49,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 71 [2022-12-13 01:50:49,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand